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.r197-tall-171640624800057.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 FlexibleBarrier-PT-14b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640624800057
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 13 08:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 13 08:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 13 08:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 13 08:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 726K 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 FlexibleBarrier-PT-14b-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716496028129

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=FlexibleBarrier-PT-14b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-23 20:27:09] [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-23 20:27:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 20:27:09] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2024-05-23 20:27:09] [INFO ] Transformed 2678 places.
[2024-05-23 20:27:09] [INFO ] Transformed 3085 transitions.
[2024-05-23 20:27:09] [INFO ] Found NUPN structural information;
[2024-05-23 20:27:09] [INFO ] Parsed PT model containing 2678 places and 3085 transitions and 7733 arcs in 317 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 2678 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2678/2678 places, 3085/3085 transitions.
Discarding 1077 places :
Symmetric choice reduction at 0 with 1077 rule applications. Total rules 1077 place count 1601 transition count 2008
Iterating global reduction 0 with 1077 rules applied. Total rules applied 2154 place count 1601 transition count 2008
Discarding 502 places :
Symmetric choice reduction at 0 with 502 rule applications. Total rules 2656 place count 1099 transition count 1506
Iterating global reduction 0 with 502 rules applied. Total rules applied 3158 place count 1099 transition count 1506
Discarding 318 places :
Symmetric choice reduction at 0 with 318 rule applications. Total rules 3476 place count 781 transition count 1188
Iterating global reduction 0 with 318 rules applied. Total rules applied 3794 place count 781 transition count 1188
Ensure Unique test removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Iterating post reduction 0 with 152 rules applied. Total rules applied 3946 place count 781 transition count 1036
Applied a total of 3946 rules in 681 ms. Remains 781 /2678 variables (removed 1897) and now considering 1036/3085 (removed 2049) transitions.
// Phase 1: matrix 1036 rows 781 cols
[2024-05-23 20:27:10] [INFO ] Computed 16 invariants in 39 ms
[2024-05-23 20:27:11] [INFO ] Implicit Places using invariants in 497 ms returned []
[2024-05-23 20:27:11] [INFO ] Invariant cache hit.
[2024-05-23 20:27:11] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 1155 ms to find 0 implicit places.
[2024-05-23 20:27:11] [INFO ] Invariant cache hit.
[2024-05-23 20:27:12] [INFO ] Dead Transitions using invariants and state equation in 390 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 781/2678 places, 1036/3085 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2228 ms. Remains : 781/2678 places, 1036/3085 transitions.
Support contains 30 out of 781 places after structural reductions.
[2024-05-23 20:27:12] [INFO ] Flatten gal took : 92 ms
[2024-05-23 20:27:12] [INFO ] Flatten gal took : 48 ms
[2024-05-23 20:27:12] [INFO ] Input system was already deterministic with 1036 transitions.
Incomplete random walk after 10000 steps, including 99 resets, run finished after 423 ms. (steps per millisecond=23 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2024-05-23 20:27:13] [INFO ] Invariant cache hit.
[2024-05-23 20:27:13] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-23 20:27:13] [INFO ] After 296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-23 20:27:14] [INFO ] [Nat]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-23 20:27:14] [INFO ] After 613ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-23 20:27:15] [INFO ] Deduced a trap composed of 225 places in 201 ms of which 5 ms to minimize.
[2024-05-23 20:27:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2024-05-23 20:27:15] [INFO ] After 1527ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 365 ms.
[2024-05-23 20:27:16] [INFO ] After 2272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 7 properties in 115 ms.
Support contains 11 out of 781 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 781/781 places, 1036/1036 transitions.
Graph (trivial) has 723 edges and 781 vertex of which 86 / 781 are part of one of the 14 SCC in 5 ms
Free SCC test removed 72 places
Drop transitions removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 709 transition count 881
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 137 place count 641 transition count 881
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 137 place count 641 transition count 849
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 201 place count 609 transition count 849
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 240 place count 570 transition count 810
Iterating global reduction 2 with 39 rules applied. Total rules applied 279 place count 570 transition count 810
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 281 place count 570 transition count 808
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 288 place count 563 transition count 801
Iterating global reduction 3 with 7 rules applied. Total rules applied 295 place count 563 transition count 801
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 300 place count 563 transition count 796
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 476 place count 475 transition count 708
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 504 place count 475 transition count 680
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 520 place count 459 transition count 664
Iterating global reduction 5 with 16 rules applied. Total rules applied 536 place count 459 transition count 664
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 538 place count 459 transition count 662
Free-agglomeration rule applied 373 times.
Iterating global reduction 6 with 373 rules applied. Total rules applied 911 place count 459 transition count 289
Reduce places removed 373 places and 0 transitions.
Drop transitions removed 167 transitions
Reduce isomorphic transitions removed 167 transitions.
Graph (complete) has 240 edges and 86 vertex of which 76 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 541 rules applied. Total rules applied 1452 place count 76 transition count 122
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1466 place count 76 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1467 place count 75 transition count 107
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 60 edges and 74 vertex of which 24 / 74 are part of one of the 12 SCC in 1 ms
Free SCC test removed 12 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 1470 place count 62 transition count 106
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 9 with 25 rules applied. Total rules applied 1495 place count 61 transition count 82
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 12 Pre rules applied. Total rules applied 1495 place count 61 transition count 70
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 1519 place count 49 transition count 70
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 10 with 11 rules applied. Total rules applied 1530 place count 49 transition count 59
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 11 with 22 rules applied. Total rules applied 1552 place count 38 transition count 48
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1553 place count 38 transition count 47
Free-agglomeration rule applied 12 times.
Iterating global reduction 11 with 12 rules applied. Total rules applied 1565 place count 38 transition count 35
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 11 with 29 rules applied. Total rules applied 1594 place count 20 transition count 24
Applied a total of 1594 rules in 246 ms. Remains 20 /781 variables (removed 761) and now considering 24/1036 (removed 1012) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 20/781 places, 24/1036 transitions.
Finished random walk after 161 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=80 )
Parikh walk visited 0 properties in 0 ms.
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 18 stabilizing places and 18 stable transitions
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(X((G(F(p0))||(F(p0)&&F(G((X(!p2)||p1))))))))'
Support contains 5 out of 781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 781/781 places, 1036/1036 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 762 transition count 1017
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 762 transition count 1017
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 762 transition count 1014
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 55 place count 748 transition count 1000
Iterating global reduction 1 with 14 rules applied. Total rules applied 69 place count 748 transition count 1000
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 78 place count 748 transition count 991
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 81 place count 745 transition count 988
Iterating global reduction 2 with 3 rules applied. Total rules applied 84 place count 745 transition count 988
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 745 transition count 986
Applied a total of 86 rules in 75 ms. Remains 745 /781 variables (removed 36) and now considering 986/1036 (removed 50) transitions.
// Phase 1: matrix 986 rows 745 cols
[2024-05-23 20:27:17] [INFO ] Computed 16 invariants in 17 ms
[2024-05-23 20:27:17] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-05-23 20:27:17] [INFO ] Invariant cache hit.
[2024-05-23 20:27:17] [INFO ] Implicit Places using invariants and state equation in 697 ms returned []
Implicit Place search using SMT with State Equation took 972 ms to find 0 implicit places.
[2024-05-23 20:27:17] [INFO ] Invariant cache hit.
[2024-05-23 20:27:18] [INFO ] Dead Transitions using invariants and state equation in 427 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 745/781 places, 986/1036 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1498 ms. Remains : 745/781 places, 986/1036 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 486 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s644 1), p1:(OR (EQ s701 0) (EQ s637 1)), p2:(OR (EQ s691 0) (EQ s704 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 201 steps with 1 reset in 5 ms.
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-00 finished in 2141 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 4 out of 781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 781/781 places, 1036/1036 transitions.
Graph (trivial) has 732 edges and 781 vertex of which 86 / 781 are part of one of the 14 SCC in 2 ms
Free SCC test removed 72 places
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 708 transition count 891
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 143 place count 637 transition count 891
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 143 place count 637 transition count 859
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 207 place count 605 transition count 859
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 253 place count 559 transition count 813
Iterating global reduction 2 with 46 rules applied. Total rules applied 299 place count 559 transition count 813
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 302 place count 559 transition count 810
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 302 place count 559 transition count 809
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 304 place count 558 transition count 809
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 313 place count 549 transition count 800
Iterating global reduction 3 with 9 rules applied. Total rules applied 322 place count 549 transition count 800
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 330 place count 549 transition count 792
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 500 place count 464 transition count 707
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 503 place count 461 transition count 704
Iterating global reduction 4 with 3 rules applied. Total rules applied 506 place count 461 transition count 704
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 509 place count 461 transition count 701
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 523 place count 461 transition count 687
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 525 place count 459 transition count 685
Applied a total of 525 rules in 495 ms. Remains 459 /781 variables (removed 322) and now considering 685/1036 (removed 351) transitions.
[2024-05-23 20:27:19] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
// Phase 1: matrix 658 rows 459 cols
[2024-05-23 20:27:19] [INFO ] Computed 16 invariants in 18 ms
[2024-05-23 20:27:19] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-05-23 20:27:19] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
[2024-05-23 20:27:19] [INFO ] Invariant cache hit.
[2024-05-23 20:27:20] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
[2024-05-23 20:27:20] [INFO ] Redundant transitions in 42 ms returned []
[2024-05-23 20:27:20] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
[2024-05-23 20:27:20] [INFO ] Invariant cache hit.
[2024-05-23 20:27:20] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 459/781 places, 685/1036 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1565 ms. Remains : 459/781 places, 685/1036 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s403 0) (EQ s61 1) (EQ s205 0) (EQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4885 reset in 864 ms.
Product exploration explored 100000 steps with 4888 reset in 666 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 495 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 843548 steps, run timeout after 3001 ms. (steps per millisecond=281 ) properties seen :{}
Probabilistic random walk after 843548 steps, saw 187787 distinct states, run finished after 3002 ms. (steps per millisecond=280 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 20:27:25] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
[2024-05-23 20:27:25] [INFO ] Invariant cache hit.
[2024-05-23 20:27:25] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 20:27:25] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-05-23 20:27:25] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 20:27:25] [INFO ] After 211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-23 20:27:25] [INFO ] After 298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 459 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 459/459 places, 685/685 transitions.
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 459 transition count 657
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 42 place count 445 transition count 643
Iterating global reduction 1 with 14 rules applied. Total rules applied 56 place count 445 transition count 643
Free-agglomeration rule applied 369 times.
Iterating global reduction 1 with 369 rules applied. Total rules applied 425 place count 445 transition count 274
Reduce places removed 370 places and 0 transitions.
Drop transitions removed 169 transitions
Reduce isomorphic transitions removed 169 transitions.
Graph (complete) has 138 edges and 75 vertex of which 35 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Discarding 40 places :
Also discarding 40 output transitions
Drop transitions removed 40 transitions
Graph (trivial) has 46 edges and 35 vertex of which 12 / 35 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 542 rules applied. Total rules applied 967 place count 29 transition count 64
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 996 place count 28 transition count 36
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 996 place count 28 transition count 30
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1008 place count 22 transition count 30
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 1013 place count 22 transition count 25
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 1023 place count 17 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 1025 place count 16 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1026 place count 16 transition count 18
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 1031 place count 16 transition count 13
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 1044 place count 8 transition count 8
Applied a total of 1044 rules in 61 ms. Remains 8 /459 variables (removed 451) and now considering 8/685 (removed 677) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 8/459 places, 8/685 transitions.
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 459 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 459/459 places, 685/685 transitions.
Applied a total of 0 rules in 40 ms. Remains 459 /459 variables (removed 0) and now considering 685/685 (removed 0) transitions.
[2024-05-23 20:27:26] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
[2024-05-23 20:27:26] [INFO ] Invariant cache hit.
[2024-05-23 20:27:26] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-05-23 20:27:26] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
[2024-05-23 20:27:26] [INFO ] Invariant cache hit.
[2024-05-23 20:27:26] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
[2024-05-23 20:27:26] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-23 20:27:26] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
[2024-05-23 20:27:26] [INFO ] Invariant cache hit.
[2024-05-23 20:27:27] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 959 ms. Remains : 459/459 places, 685/685 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 496 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 844730 steps, run timeout after 3001 ms. (steps per millisecond=281 ) properties seen :{}
Probabilistic random walk after 844730 steps, saw 188002 distinct states, run finished after 3001 ms. (steps per millisecond=281 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 20:27:30] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
[2024-05-23 20:27:30] [INFO ] Invariant cache hit.
[2024-05-23 20:27:30] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 20:27:30] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-05-23 20:27:30] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 20:27:30] [INFO ] After 210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-23 20:27:30] [INFO ] After 304ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 459 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 459/459 places, 685/685 transitions.
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 459 transition count 657
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 42 place count 445 transition count 643
Iterating global reduction 1 with 14 rules applied. Total rules applied 56 place count 445 transition count 643
Free-agglomeration rule applied 369 times.
Iterating global reduction 1 with 369 rules applied. Total rules applied 425 place count 445 transition count 274
Reduce places removed 370 places and 0 transitions.
Drop transitions removed 169 transitions
Reduce isomorphic transitions removed 169 transitions.
Graph (complete) has 138 edges and 75 vertex of which 35 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 40 output transitions
Drop transitions removed 40 transitions
Graph (trivial) has 46 edges and 35 vertex of which 12 / 35 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 542 rules applied. Total rules applied 967 place count 29 transition count 64
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 996 place count 28 transition count 36
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 996 place count 28 transition count 30
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1008 place count 22 transition count 30
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 1013 place count 22 transition count 25
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 1023 place count 17 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 1025 place count 16 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1026 place count 16 transition count 18
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 1031 place count 16 transition count 13
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 1044 place count 8 transition count 8
Applied a total of 1044 rules in 73 ms. Remains 8 /459 variables (removed 451) and now considering 8/685 (removed 677) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 8/459 places, 8/685 transitions.
Finished random walk after 52 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=52 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4863 reset in 639 ms.
Product exploration explored 100000 steps with 4890 reset in 663 ms.
Built C files in :
/tmp/ltsmin11769137790632736968
[2024-05-23 20:27:32] [INFO ] Computing symmetric may disable matrix : 685 transitions.
[2024-05-23 20:27:32] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:27:32] [INFO ] Computing symmetric may enable matrix : 685 transitions.
[2024-05-23 20:27:32] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:27:32] [INFO ] Computing Do-Not-Accords matrix : 685 transitions.
[2024-05-23 20:27:32] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:27:32] [INFO ] Built C files in 145ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11769137790632736968
Running compilation step : cd /tmp/ltsmin11769137790632736968;'/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 1820 ms.
Running link step : cd /tmp/ltsmin11769137790632736968;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin11769137790632736968;'/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/stateBased17078205979433375347.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 459 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 459/459 places, 685/685 transitions.
Applied a total of 0 rules in 34 ms. Remains 459 /459 variables (removed 0) and now considering 685/685 (removed 0) transitions.
[2024-05-23 20:27:47] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
[2024-05-23 20:27:47] [INFO ] Invariant cache hit.
[2024-05-23 20:27:48] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-23 20:27:48] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
[2024-05-23 20:27:48] [INFO ] Invariant cache hit.
[2024-05-23 20:27:48] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
[2024-05-23 20:27:48] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-23 20:27:48] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
[2024-05-23 20:27:48] [INFO ] Invariant cache hit.
[2024-05-23 20:27:48] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 995 ms. Remains : 459/459 places, 685/685 transitions.
Built C files in :
/tmp/ltsmin5128214756941632255
[2024-05-23 20:27:48] [INFO ] Computing symmetric may disable matrix : 685 transitions.
[2024-05-23 20:27:48] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:27:48] [INFO ] Computing symmetric may enable matrix : 685 transitions.
[2024-05-23 20:27:48] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:27:49] [INFO ] Computing Do-Not-Accords matrix : 685 transitions.
[2024-05-23 20:27:49] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:27:49] [INFO ] Built C files in 131ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5128214756941632255
Running compilation step : cd /tmp/ltsmin5128214756941632255;'/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 1690 ms.
Running link step : cd /tmp/ltsmin5128214756941632255;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin5128214756941632255;'/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/stateBased17943589953557880194.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 20:28:04] [INFO ] Flatten gal took : 29 ms
[2024-05-23 20:28:04] [INFO ] Flatten gal took : 28 ms
[2024-05-23 20:28:04] [INFO ] Time to serialize gal into /tmp/LTL960225206644404118.gal : 6 ms
[2024-05-23 20:28:04] [INFO ] Time to serialize properties into /tmp/LTL969495969246608245.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/LTL960225206644404118.gal' '-t' 'CGAL' '-hoa' '/tmp/aut812803511541712939.hoa' '-atoms' '/tmp/LTL969495969246608245.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...314
Loading property file /tmp/LTL969495969246608245.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut812803511541712939.hoa
Detected timeout of ITS tools.
[2024-05-23 20:28:19] [INFO ] Flatten gal took : 23 ms
[2024-05-23 20:28:19] [INFO ] Flatten gal took : 23 ms
[2024-05-23 20:28:19] [INFO ] Time to serialize gal into /tmp/LTL3608386769114432700.gal : 4 ms
[2024-05-23 20:28:19] [INFO ] Time to serialize properties into /tmp/LTL9302842082783595162.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/LTL3608386769114432700.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9302842082783595162.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("(((p2395==0)||(p443==1))||((p1363==0)||(p390==1)))"))))
Formula 0 simplified : FG!"(((p2395==0)||(p443==1))||((p1363==0)||(p390==1)))"
Detected timeout of ITS tools.
[2024-05-23 20:28:34] [INFO ] Flatten gal took : 44 ms
[2024-05-23 20:28:34] [INFO ] Applying decomposition
[2024-05-23 20:28:34] [INFO ] Flatten gal took : 57 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/graph11185617452592265896.txt' '-o' '/tmp/graph11185617452592265896.bin' '-w' '/tmp/graph11185617452592265896.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11185617452592265896.bin' '-l' '-1' '-v' '-w' '/tmp/graph11185617452592265896.weights' '-q' '0' '-e' '0.001'
[2024-05-23 20:28:34] [INFO ] Decomposing Gal with order
[2024-05-23 20:28:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 20:28:35] [INFO ] Removed a total of 281 redundant transitions.
[2024-05-23 20:28:35] [INFO ] Flatten gal took : 295 ms
[2024-05-23 20:28:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 59 ms.
[2024-05-23 20:28:35] [INFO ] Time to serialize gal into /tmp/LTL6238098096927261192.gal : 10 ms
[2024-05-23 20:28:35] [INFO ] Time to serialize properties into /tmp/LTL4800708235475818326.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/LTL6238098096927261192.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4800708235475818326.ltl' '-c' '-stutter-deadlock'

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...254
Read 1 LTL properties
Checking formula 0 : !((G(F("(((u41.p2395==0)||(u8.p443==1))||((i10.u31.p1363==0)||(i15.u6.p390==1)))"))))
Formula 0 simplified : FG!"(((u41.p2395==0)||(u8.p443==1))||((i10.u31.p1363==0)||(i15.u6.p390==1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin530665810698214207
[2024-05-23 20:28:50] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin530665810698214207
Running compilation step : cd /tmp/ltsmin530665810698214207;'/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 1020 ms.
Running link step : cd /tmp/ltsmin530665810698214207;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin530665810698214207;'/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)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-01 finished in 106535 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(X(G((p0&&X(p1))))))'
Support contains 3 out of 781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 781/781 places, 1036/1036 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 761 transition count 1016
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 761 transition count 1016
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 761 transition count 1014
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 58 place count 745 transition count 998
Iterating global reduction 1 with 16 rules applied. Total rules applied 74 place count 745 transition count 998
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 85 place count 745 transition count 987
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 743 transition count 985
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 743 transition count 985
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 743 transition count 984
Applied a total of 90 rules in 65 ms. Remains 743 /781 variables (removed 38) and now considering 984/1036 (removed 52) transitions.
// Phase 1: matrix 984 rows 743 cols
[2024-05-23 20:29:05] [INFO ] Computed 16 invariants in 8 ms
[2024-05-23 20:29:05] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-23 20:29:05] [INFO ] Invariant cache hit.
[2024-05-23 20:29:06] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 931 ms to find 0 implicit places.
[2024-05-23 20:29:06] [INFO ] Invariant cache hit.
[2024-05-23 20:29:06] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 743/781 places, 984/1036 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1384 ms. Remains : 743/781 places, 984/1036 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(EQ s29 1), p1:(OR (EQ s649 0) (EQ s97 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-05 finished in 1578 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)))'
Support contains 3 out of 781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 781/781 places, 1036/1036 transitions.
Graph (trivial) has 733 edges and 781 vertex of which 86 / 781 are part of one of the 14 SCC in 0 ms
Free SCC test removed 72 places
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 708 transition count 892
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 141 place count 638 transition count 892
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 141 place count 638 transition count 858
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 209 place count 604 transition count 858
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 257 place count 556 transition count 810
Iterating global reduction 2 with 48 rules applied. Total rules applied 305 place count 556 transition count 810
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 308 place count 556 transition count 807
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 308 place count 556 transition count 806
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 310 place count 555 transition count 806
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 321 place count 544 transition count 795
Iterating global reduction 3 with 11 rules applied. Total rules applied 332 place count 544 transition count 795
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 343 place count 544 transition count 784
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 513 place count 459 transition count 699
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 516 place count 456 transition count 696
Iterating global reduction 4 with 3 rules applied. Total rules applied 519 place count 456 transition count 696
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 522 place count 456 transition count 693
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 535 place count 456 transition count 680
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 537 place count 454 transition count 678
Applied a total of 537 rules in 142 ms. Remains 454 /781 variables (removed 327) and now considering 678/1036 (removed 358) transitions.
[2024-05-23 20:29:07] [INFO ] Flow matrix only has 651 transitions (discarded 27 similar events)
// Phase 1: matrix 651 rows 454 cols
[2024-05-23 20:29:07] [INFO ] Computed 16 invariants in 16 ms
[2024-05-23 20:29:07] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-23 20:29:07] [INFO ] Flow matrix only has 651 transitions (discarded 27 similar events)
[2024-05-23 20:29:07] [INFO ] Invariant cache hit.
[2024-05-23 20:29:07] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
[2024-05-23 20:29:07] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-23 20:29:07] [INFO ] Flow matrix only has 651 transitions (discarded 27 similar events)
[2024-05-23 20:29:07] [INFO ] Invariant cache hit.
[2024-05-23 20:29:08] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 454/781 places, 678/1036 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1018 ms. Remains : 454/781 places, 678/1036 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s58 1), p0:(OR (EQ s335 0) (EQ s422 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 391 steps with 19 reset in 10 ms.
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-07 finished in 1120 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(F(p0)))'
Support contains 1 out of 781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 781/781 places, 1036/1036 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 758 transition count 1013
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 758 transition count 1013
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 758 transition count 1010
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 67 place count 740 transition count 992
Iterating global reduction 1 with 18 rules applied. Total rules applied 85 place count 740 transition count 992
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 97 place count 740 transition count 980
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 100 place count 737 transition count 977
Iterating global reduction 2 with 3 rules applied. Total rules applied 103 place count 737 transition count 977
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 105 place count 737 transition count 975
Applied a total of 105 rules in 64 ms. Remains 737 /781 variables (removed 44) and now considering 975/1036 (removed 61) transitions.
// Phase 1: matrix 975 rows 737 cols
[2024-05-23 20:29:08] [INFO ] Computed 16 invariants in 16 ms
[2024-05-23 20:29:08] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-05-23 20:29:08] [INFO ] Invariant cache hit.
[2024-05-23 20:29:09] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 888 ms to find 0 implicit places.
[2024-05-23 20:29:09] [INFO ] Invariant cache hit.
[2024-05-23 20:29:09] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 737/781 places, 975/1036 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1323 ms. Remains : 737/781 places, 975/1036 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s670 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 95 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-08 finished in 1407 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 2 out of 781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 781/781 places, 1036/1036 transitions.
Graph (trivial) has 735 edges and 781 vertex of which 86 / 781 are part of one of the 14 SCC in 1 ms
Free SCC test removed 72 places
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 708 transition count 891
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 143 place count 637 transition count 891
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 143 place count 637 transition count 857
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 211 place count 603 transition count 857
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 258 place count 556 transition count 810
Iterating global reduction 2 with 47 rules applied. Total rules applied 305 place count 556 transition count 810
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 308 place count 556 transition count 807
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 308 place count 556 transition count 806
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 310 place count 555 transition count 806
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 320 place count 545 transition count 796
Iterating global reduction 3 with 10 rules applied. Total rules applied 330 place count 545 transition count 796
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 340 place count 545 transition count 786
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 510 place count 460 transition count 701
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 512 place count 458 transition count 699
Iterating global reduction 4 with 2 rules applied. Total rules applied 514 place count 458 transition count 699
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 516 place count 458 transition count 697
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 530 place count 458 transition count 683
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 532 place count 456 transition count 681
Applied a total of 532 rules in 143 ms. Remains 456 /781 variables (removed 325) and now considering 681/1036 (removed 355) transitions.
[2024-05-23 20:29:09] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
// Phase 1: matrix 654 rows 456 cols
[2024-05-23 20:29:09] [INFO ] Computed 16 invariants in 7 ms
[2024-05-23 20:29:09] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-23 20:29:09] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 20:29:09] [INFO ] Invariant cache hit.
[2024-05-23 20:29:10] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
[2024-05-23 20:29:10] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-23 20:29:10] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 20:29:10] [INFO ] Invariant cache hit.
[2024-05-23 20:29:10] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 456/781 places, 681/1036 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 979 ms. Remains : 456/781 places, 681/1036 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s395 0) (EQ s274 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4879 reset in 643 ms.
Stuttering criterion allowed to conclude after 58474 steps with 2848 reset in 401 ms.
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-11 finished in 2074 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 2 out of 781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 781/781 places, 1036/1036 transitions.
Graph (trivial) has 733 edges and 781 vertex of which 85 / 781 are part of one of the 14 SCC in 2 ms
Free SCC test removed 71 places
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 709 transition count 894
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 141 place count 639 transition count 894
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 141 place count 639 transition count 860
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 209 place count 605 transition count 860
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 257 place count 557 transition count 812
Iterating global reduction 2 with 48 rules applied. Total rules applied 305 place count 557 transition count 812
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 308 place count 557 transition count 809
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 308 place count 557 transition count 808
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 310 place count 556 transition count 808
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 321 place count 545 transition count 797
Iterating global reduction 3 with 11 rules applied. Total rules applied 332 place count 545 transition count 797
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 343 place count 545 transition count 786
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 513 place count 460 transition count 701
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 516 place count 457 transition count 698
Iterating global reduction 4 with 3 rules applied. Total rules applied 519 place count 457 transition count 698
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 522 place count 457 transition count 695
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 536 place count 457 transition count 681
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 538 place count 455 transition count 679
Applied a total of 538 rules in 137 ms. Remains 455 /781 variables (removed 326) and now considering 679/1036 (removed 357) transitions.
[2024-05-23 20:29:11] [INFO ] Flow matrix only has 652 transitions (discarded 27 similar events)
// Phase 1: matrix 652 rows 455 cols
[2024-05-23 20:29:11] [INFO ] Computed 16 invariants in 18 ms
[2024-05-23 20:29:12] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-23 20:29:12] [INFO ] Flow matrix only has 652 transitions (discarded 27 similar events)
[2024-05-23 20:29:12] [INFO ] Invariant cache hit.
[2024-05-23 20:29:12] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
[2024-05-23 20:29:12] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-23 20:29:12] [INFO ] Flow matrix only has 652 transitions (discarded 27 similar events)
[2024-05-23 20:29:12] [INFO ] Invariant cache hit.
[2024-05-23 20:29:12] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 455/781 places, 679/1036 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 977 ms. Remains : 455/781 places, 679/1036 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s260 0) (EQ s312 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 92 steps with 5 reset in 2 ms.
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-14 finished in 1054 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)||G(F((X(p2)&&p1))))))'
Support contains 8 out of 781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 781/781 places, 1036/1036 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 765 transition count 1020
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 765 transition count 1020
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 765 transition count 1019
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 46 place count 752 transition count 1006
Iterating global reduction 1 with 13 rules applied. Total rules applied 59 place count 752 transition count 1006
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 69 place count 752 transition count 996
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 751 transition count 995
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 751 transition count 995
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 751 transition count 994
Applied a total of 72 rules in 57 ms. Remains 751 /781 variables (removed 30) and now considering 994/1036 (removed 42) transitions.
// Phase 1: matrix 994 rows 751 cols
[2024-05-23 20:29:12] [INFO ] Computed 16 invariants in 17 ms
[2024-05-23 20:29:13] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-23 20:29:13] [INFO ] Invariant cache hit.
[2024-05-23 20:29:13] [INFO ] Implicit Places using invariants and state equation in 569 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
[2024-05-23 20:29:13] [INFO ] Invariant cache hit.
[2024-05-23 20:29:13] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 751/781 places, 994/1036 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1256 ms. Remains : 751/781 places, 994/1036 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-15 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) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s342 0) (EQ s66 1) (EQ s496 0) (EQ s648 1)), p1:(AND (EQ s173 0) (EQ s334 1)), p2:(OR (EQ s555 0) (EQ s68 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1000 reset in 239 ms.
Product exploration explored 100000 steps with 997 reset in 231 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 181 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 100 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 275051 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 275051 steps, saw 109392 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 8 properties.
[2024-05-23 20:29:18] [INFO ] Invariant cache hit.
[2024-05-23 20:29:18] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-23 20:29:18] [INFO ] [Nat]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-23 20:29:19] [INFO ] After 421ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2024-05-23 20:29:19] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 0 ms to minimize.
[2024-05-23 20:29:19] [INFO ] Deduced a trap composed of 115 places in 90 ms of which 1 ms to minimize.
[2024-05-23 20:29:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 287 ms
[2024-05-23 20:29:19] [INFO ] After 1037ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 193 ms.
[2024-05-23 20:29:20] [INFO ] After 1480ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :6
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 3 properties in 40 ms.
Support contains 8 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 994/994 transitions.
Graph (trivial) has 696 edges and 751 vertex of which 85 / 751 are part of one of the 14 SCC in 1 ms
Free SCC test removed 71 places
Drop transitions removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 680 transition count 841
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 135 place count 613 transition count 841
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 135 place count 613 transition count 811
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 195 place count 583 transition count 811
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 222 place count 556 transition count 784
Iterating global reduction 2 with 27 rules applied. Total rules applied 249 place count 556 transition count 784
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 251 place count 554 transition count 782
Iterating global reduction 2 with 2 rules applied. Total rules applied 253 place count 554 transition count 782
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 427 place count 467 transition count 695
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 455 place count 467 transition count 667
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 469 place count 453 transition count 653
Iterating global reduction 3 with 14 rules applied. Total rules applied 483 place count 453 transition count 653
Free-agglomeration rule applied 369 times.
Iterating global reduction 3 with 369 rules applied. Total rules applied 852 place count 453 transition count 284
Reduce places removed 369 places and 0 transitions.
Drop transitions removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Graph (complete) has 225 edges and 84 vertex of which 64 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 538 rules applied. Total rules applied 1390 place count 64 transition count 116
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 1418 place count 64 transition count 88
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1419 place count 64 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1420 place count 63 transition count 87
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 50 edges and 62 vertex of which 20 / 62 are part of one of the 10 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 1423 place count 52 transition count 86
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 1444 place count 51 transition count 66
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 1444 place count 51 transition count 57
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 1462 place count 42 transition count 57
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1471 place count 42 transition count 48
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 1489 place count 33 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1491 place count 32 transition count 38
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1492 place count 32 transition count 37
Free-agglomeration rule applied 9 times.
Iterating global reduction 8 with 9 rules applied. Total rules applied 1501 place count 32 transition count 28
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 1525 place count 17 transition count 19
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1526 place count 17 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1527 place count 16 transition count 18
Applied a total of 1527 rules in 90 ms. Remains 16 /751 variables (removed 735) and now considering 18/994 (removed 976) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 16/751 places, 18/994 transitions.
Finished random walk after 165 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=55 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1)), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 18 factoid took 539 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 108 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 8 out of 751 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 751/751 places, 994/994 transitions.
Applied a total of 0 rules in 22 ms. Remains 751 /751 variables (removed 0) and now considering 994/994 (removed 0) transitions.
[2024-05-23 20:29:20] [INFO ] Invariant cache hit.
[2024-05-23 20:29:21] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-23 20:29:21] [INFO ] Invariant cache hit.
[2024-05-23 20:29:21] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 802 ms to find 0 implicit places.
[2024-05-23 20:29:21] [INFO ] Invariant cache hit.
[2024-05-23 20:29:22] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1196 ms. Remains : 751/751 places, 994/994 transitions.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 162 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 100 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 291324 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 291324 steps, saw 115191 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 7 properties.
[2024-05-23 20:29:25] [INFO ] Invariant cache hit.
[2024-05-23 20:29:25] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-23 20:29:26] [INFO ] [Nat]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-23 20:29:26] [INFO ] After 435ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2024-05-23 20:29:26] [INFO ] After 768ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 186 ms.
[2024-05-23 20:29:27] [INFO ] After 1185ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 3 properties in 32 ms.
Support contains 8 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 994/994 transitions.
Graph (trivial) has 696 edges and 751 vertex of which 85 / 751 are part of one of the 14 SCC in 0 ms
Free SCC test removed 71 places
Drop transitions removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 680 transition count 841
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 135 place count 613 transition count 841
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 135 place count 613 transition count 811
Deduced a syphon composed of 30 places in 10 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 195 place count 583 transition count 811
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 222 place count 556 transition count 784
Iterating global reduction 2 with 27 rules applied. Total rules applied 249 place count 556 transition count 784
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 251 place count 554 transition count 782
Iterating global reduction 2 with 2 rules applied. Total rules applied 253 place count 554 transition count 782
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 427 place count 467 transition count 695
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 455 place count 467 transition count 667
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 469 place count 453 transition count 653
Iterating global reduction 3 with 14 rules applied. Total rules applied 483 place count 453 transition count 653
Free-agglomeration rule applied 369 times.
Iterating global reduction 3 with 369 rules applied. Total rules applied 852 place count 453 transition count 284
Reduce places removed 369 places and 0 transitions.
Drop transitions removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Graph (complete) has 225 edges and 84 vertex of which 64 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 538 rules applied. Total rules applied 1390 place count 64 transition count 116
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 1418 place count 64 transition count 88
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1419 place count 64 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1420 place count 63 transition count 87
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 50 edges and 62 vertex of which 20 / 62 are part of one of the 10 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 1423 place count 52 transition count 86
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 1444 place count 51 transition count 66
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 1444 place count 51 transition count 57
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 1462 place count 42 transition count 57
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1471 place count 42 transition count 48
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 1489 place count 33 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1491 place count 32 transition count 38
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1492 place count 32 transition count 37
Free-agglomeration rule applied 9 times.
Iterating global reduction 8 with 9 rules applied. Total rules applied 1501 place count 32 transition count 28
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 1525 place count 17 transition count 19
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1526 place count 17 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1527 place count 16 transition count 18
Applied a total of 1527 rules in 99 ms. Remains 16 /751 variables (removed 735) and now considering 18/994 (removed 976) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 16/751 places, 18/994 transitions.
Finished random walk after 321 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=107 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1)), (F (AND p1 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 15 factoid took 436 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 995 reset in 218 ms.
Product exploration explored 100000 steps with 994 reset in 217 ms.
Built C files in :
/tmp/ltsmin278127500968222851
[2024-05-23 20:29:28] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin278127500968222851
Running compilation step : cd /tmp/ltsmin278127500968222851;'/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 1526 ms.
Running link step : cd /tmp/ltsmin278127500968222851;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin278127500968222851;'/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' '--hoa' '/tmp/stateBased4764291282142326505.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 751 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 751/751 places, 994/994 transitions.
Applied a total of 0 rules in 18 ms. Remains 751 /751 variables (removed 0) and now considering 994/994 (removed 0) transitions.
[2024-05-23 20:29:43] [INFO ] Invariant cache hit.
[2024-05-23 20:29:43] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-23 20:29:43] [INFO ] Invariant cache hit.
[2024-05-23 20:29:44] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
[2024-05-23 20:29:44] [INFO ] Invariant cache hit.
[2024-05-23 20:29:44] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1254 ms. Remains : 751/751 places, 994/994 transitions.
Built C files in :
/tmp/ltsmin15122304104302025891
[2024-05-23 20:29:44] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15122304104302025891
Running compilation step : cd /tmp/ltsmin15122304104302025891;'/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 1538 ms.
Running link step : cd /tmp/ltsmin15122304104302025891;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15122304104302025891;'/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' '--hoa' '/tmp/stateBased5510290002798696215.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 20:30:00] [INFO ] Flatten gal took : 25 ms
[2024-05-23 20:30:00] [INFO ] Flatten gal took : 22 ms
[2024-05-23 20:30:00] [INFO ] Time to serialize gal into /tmp/LTL1483446927369312377.gal : 5 ms
[2024-05-23 20:30:00] [INFO ] Time to serialize properties into /tmp/LTL1580193120562514084.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/LTL1483446927369312377.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18425903354054062074.hoa' '-atoms' '/tmp/LTL1580193120562514084.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/LTL1580193120562514084.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18425903354054062074.hoa
Detected timeout of ITS tools.
[2024-05-23 20:30:15] [INFO ] Flatten gal took : 22 ms
[2024-05-23 20:30:15] [INFO ] Flatten gal took : 22 ms
[2024-05-23 20:30:15] [INFO ] Time to serialize gal into /tmp/LTL1892144536920053554.gal : 20 ms
[2024-05-23 20:30:15] [INFO ] Time to serialize properties into /tmp/LTL6434433864268791383.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/LTL1892144536920053554.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6434433864268791383.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 : !((F((G("(((p1140==0)||(p229==1))||((p1645==0)||(p2186==1)))"))||(G(F(("((p541==0)&&(p1104==1))")&&(X("((p1795==0)||(p235==1))")))))))...156
Formula 0 simplified : G(F!"(((p1140==0)||(p229==1))||((p1645==0)||(p2186==1)))" & FG(!"((p541==0)&&(p1104==1))" | X!"((p1795==0)||(p235==1))"))
Detected timeout of ITS tools.
[2024-05-23 20:30:30] [INFO ] Flatten gal took : 21 ms
[2024-05-23 20:30:30] [INFO ] Applying decomposition
[2024-05-23 20:30:30] [INFO ] Flatten gal took : 22 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/graph13131611551741091851.txt' '-o' '/tmp/graph13131611551741091851.bin' '-w' '/tmp/graph13131611551741091851.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13131611551741091851.bin' '-l' '-1' '-v' '-w' '/tmp/graph13131611551741091851.weights' '-q' '0' '-e' '0.001'
[2024-05-23 20:30:30] [INFO ] Decomposing Gal with order
[2024-05-23 20:30:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 20:30:30] [INFO ] Removed a total of 274 redundant transitions.
[2024-05-23 20:30:30] [INFO ] Flatten gal took : 103 ms
[2024-05-23 20:30:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 23 ms.
[2024-05-23 20:30:30] [INFO ] Time to serialize gal into /tmp/LTL6470204813326563654.gal : 13 ms
[2024-05-23 20:30:30] [INFO ] Time to serialize properties into /tmp/LTL9897703032620742765.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/LTL6470204813326563654.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9897703032620742765.ltl' '-c' '-stutter-deadlock'

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...254
Read 1 LTL properties
Checking formula 0 : !((F((G("(((i10.u100.p1140==0)||(i2.u22.p229==1))||((i14.u136.p1645==0)||(i3.u153.p2186==1)))"))||(G(F(("((i4.u36.p541==0)&&(i10.u90.p...220
Formula 0 simplified : G(F!"(((i10.u100.p1140==0)||(i2.u22.p229==1))||((i14.u136.p1645==0)||(i3.u153.p2186==1)))" & FG(!"((i4.u36.p541==0)&&(i10.u90.p1104=...208
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16331787873718219581
[2024-05-23 20:30:45] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16331787873718219581
Running compilation step : cd /tmp/ltsmin16331787873718219581;'/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 1520 ms.
Running link step : cd /tmp/ltsmin16331787873718219581;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin16331787873718219581;'/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))||[](<>((X((LTLAPp2==true))&&(LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-15 finished in 108189 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)))'
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)||G(F((X(p2)&&p1))))))'
Found a Shortening insensitive property : FlexibleBarrier-PT-14b-LTLCardinality-15
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 8 out of 781 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 781/781 places, 1036/1036 transitions.
Graph (trivial) has 726 edges and 781 vertex of which 86 / 781 are part of one of the 14 SCC in 1 ms
Free SCC test removed 72 places
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 708 transition count 895
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 135 place count 641 transition count 895
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 135 place count 641 transition count 862
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 201 place count 608 transition count 862
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 243 place count 566 transition count 820
Iterating global reduction 2 with 42 rules applied. Total rules applied 285 place count 566 transition count 820
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 286 place count 566 transition count 819
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 297 place count 555 transition count 808
Iterating global reduction 3 with 11 rules applied. Total rules applied 308 place count 555 transition count 808
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 317 place count 555 transition count 799
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 487 place count 470 transition count 714
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 489 place count 468 transition count 712
Iterating global reduction 4 with 2 rules applied. Total rules applied 491 place count 468 transition count 712
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 493 place count 468 transition count 710
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 507 place count 468 transition count 696
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 508 place count 468 transition count 696
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 510 place count 466 transition count 694
Applied a total of 510 rules in 107 ms. Remains 466 /781 variables (removed 315) and now considering 694/1036 (removed 342) transitions.
[2024-05-23 20:31:01] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
// Phase 1: matrix 667 rows 466 cols
[2024-05-23 20:31:01] [INFO ] Computed 16 invariants in 13 ms
[2024-05-23 20:31:01] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-23 20:31:01] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
[2024-05-23 20:31:01] [INFO ] Invariant cache hit.
[2024-05-23 20:31:01] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
[2024-05-23 20:31:01] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
[2024-05-23 20:31:01] [INFO ] Invariant cache hit.
[2024-05-23 20:31:02] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 466/781 places, 694/1036 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 995 ms. Remains : 466/781 places, 694/1036 transitions.
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-15 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) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s171 0) (EQ s28 1) (EQ s250 0) (EQ s367 1)), p1:(AND (EQ s83 0) (EQ s164 1)), p2:(OR (EQ s287 0) (EQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4438 reset in 609 ms.
Product exploration explored 100000 steps with 4456 reset in 615 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 177 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 456 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-23 20:31:04] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
[2024-05-23 20:31:04] [INFO ] Invariant cache hit.
[2024-05-23 20:31:04] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 20:31:04] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-05-23 20:31:04] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2024-05-23 20:31:04] [INFO ] After 387ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 94 ms.
[2024-05-23 20:31:04] [INFO ] After 609ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 8 out of 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 694/694 transitions.
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 466 transition count 666
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 42 place count 452 transition count 652
Iterating global reduction 1 with 14 rules applied. Total rules applied 56 place count 452 transition count 652
Free-agglomeration rule applied 369 times.
Iterating global reduction 1 with 369 rules applied. Total rules applied 425 place count 452 transition count 283
Reduce places removed 370 places and 0 transitions.
Drop transitions removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Graph (complete) has 154 edges and 82 vertex of which 62 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Graph (trivial) has 57 edges and 62 vertex of which 20 / 62 are part of one of the 10 SCC in 0 ms
Free SCC test removed 10 places
Iterating post reduction 1 with 540 rules applied. Total rules applied 965 place count 52 transition count 95
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 993 place count 52 transition count 67
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 993 place count 52 transition count 57
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1013 place count 42 transition count 57
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1023 place count 42 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1023 place count 42 transition count 46
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 1025 place count 41 transition count 46
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 1043 place count 32 transition count 37
Free-agglomeration rule applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 1052 place count 32 transition count 28
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 1076 place count 17 transition count 19
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1077 place count 17 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1078 place count 16 transition count 18
Applied a total of 1078 rules in 53 ms. Remains 16 /466 variables (removed 450) and now considering 18/694 (removed 676) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 16/466 places, 18/694 transitions.
Finished random walk after 1113 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=556 )
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (G (NOT (AND (NOT p0) p1))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1)), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 19 factoid took 544 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 8 out of 466 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 466/466 places, 694/694 transitions.
Applied a total of 0 rules in 6 ms. Remains 466 /466 variables (removed 0) and now considering 694/694 (removed 0) transitions.
[2024-05-23 20:31:05] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
[2024-05-23 20:31:05] [INFO ] Invariant cache hit.
[2024-05-23 20:31:06] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-23 20:31:06] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
[2024-05-23 20:31:06] [INFO ] Invariant cache hit.
[2024-05-23 20:31:06] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
[2024-05-23 20:31:06] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
[2024-05-23 20:31:06] [INFO ] Invariant cache hit.
[2024-05-23 20:31:06] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 869 ms. Remains : 466/466 places, 694/694 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 p1))), (X p0), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 125 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 459 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 386544 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{3=1}
Probabilistic random walk after 386544 steps, saw 123027 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :1
Running SMT prover for 5 properties.
[2024-05-23 20:31:10] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
[2024-05-23 20:31:10] [INFO ] Invariant cache hit.
[2024-05-23 20:31:10] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-23 20:31:10] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-05-23 20:31:10] [INFO ] After 263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-23 20:31:11] [INFO ] After 442ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 109 ms.
[2024-05-23 20:31:11] [INFO ] After 682ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 8 ms.
Support contains 8 out of 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 694/694 transitions.
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 466 transition count 666
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 42 place count 452 transition count 652
Iterating global reduction 1 with 14 rules applied. Total rules applied 56 place count 452 transition count 652
Free-agglomeration rule applied 369 times.
Iterating global reduction 1 with 369 rules applied. Total rules applied 425 place count 452 transition count 283
Reduce places removed 370 places and 0 transitions.
Drop transitions removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Graph (complete) has 154 edges and 82 vertex of which 62 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Graph (trivial) has 57 edges and 62 vertex of which 20 / 62 are part of one of the 10 SCC in 0 ms
Free SCC test removed 10 places
Iterating post reduction 1 with 540 rules applied. Total rules applied 965 place count 52 transition count 95
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 993 place count 52 transition count 67
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 993 place count 52 transition count 57
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1013 place count 42 transition count 57
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1023 place count 42 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1023 place count 42 transition count 46
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 1025 place count 41 transition count 46
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 1043 place count 32 transition count 37
Free-agglomeration rule applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 1052 place count 32 transition count 28
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 1076 place count 17 transition count 19
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1077 place count 17 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1078 place count 16 transition count 18
Applied a total of 1078 rules in 43 ms. Remains 16 /466 variables (removed 450) and now considering 18/694 (removed 676) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 16/466 places, 18/694 transitions.
Finished random walk after 1006 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=335 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 p1))), (X p0), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND (NOT p1) p0 (NOT p2))), (F (AND p1 p0 (NOT p2))), (F (NOT p0)), (F (AND p1 p0)), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 10 factoid took 297 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 4443 reset in 595 ms.
Product exploration explored 100000 steps with 4440 reset in 599 ms.
Built C files in :
/tmp/ltsmin1114845401954487114
[2024-05-23 20:31:13] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1114845401954487114
Running compilation step : cd /tmp/ltsmin1114845401954487114;'/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 1041 ms.
Running link step : cd /tmp/ltsmin1114845401954487114;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin1114845401954487114;'/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' '--hoa' '/tmp/stateBased15861495311856139610.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 466 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 466/466 places, 694/694 transitions.
Applied a total of 0 rules in 15 ms. Remains 466 /466 variables (removed 0) and now considering 694/694 (removed 0) transitions.
[2024-05-23 20:31:28] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
[2024-05-23 20:31:28] [INFO ] Invariant cache hit.
[2024-05-23 20:31:28] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-23 20:31:28] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
[2024-05-23 20:31:28] [INFO ] Invariant cache hit.
[2024-05-23 20:31:28] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
[2024-05-23 20:31:28] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
[2024-05-23 20:31:28] [INFO ] Invariant cache hit.
[2024-05-23 20:31:29] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 887 ms. Remains : 466/466 places, 694/694 transitions.
Built C files in :
/tmp/ltsmin8619239623561173574
[2024-05-23 20:31:29] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8619239623561173574
Running compilation step : cd /tmp/ltsmin8619239623561173574;'/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 1116 ms.
Running link step : cd /tmp/ltsmin8619239623561173574;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8619239623561173574;'/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' '--hoa' '/tmp/stateBased6011836313684504635.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 20:31:44] [INFO ] Flatten gal took : 16 ms
[2024-05-23 20:31:44] [INFO ] Flatten gal took : 15 ms
[2024-05-23 20:31:44] [INFO ] Time to serialize gal into /tmp/LTL8618431749080612405.gal : 4 ms
[2024-05-23 20:31:44] [INFO ] Time to serialize properties into /tmp/LTL6893013223323574278.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/LTL8618431749080612405.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4623662010353523924.hoa' '-atoms' '/tmp/LTL6893013223323574278.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/LTL6893013223323574278.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4623662010353523924.hoa
Detected timeout of ITS tools.
[2024-05-23 20:31:59] [INFO ] Flatten gal took : 15 ms
[2024-05-23 20:31:59] [INFO ] Flatten gal took : 15 ms
[2024-05-23 20:31:59] [INFO ] Time to serialize gal into /tmp/LTL3017359836118407425.gal : 4 ms
[2024-05-23 20:31:59] [INFO ] Time to serialize properties into /tmp/LTL9636572042189272412.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/LTL3017359836118407425.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9636572042189272412.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 : !((F((G("(((p1140==0)||(p229==1))||((p1645==0)||(p2186==1)))"))||(G(F(("((p541==0)&&(p1104==1))")&&(X("((p1795==0)||(p235==1))")))))))...156
Formula 0 simplified : G(F!"(((p1140==0)||(p229==1))||((p1645==0)||(p2186==1)))" & FG(!"((p541==0)&&(p1104==1))" | X!"((p1795==0)||(p235==1))"))
Detected timeout of ITS tools.
[2024-05-23 20:32:14] [INFO ] Flatten gal took : 24 ms
[2024-05-23 20:32:14] [INFO ] Applying decomposition
[2024-05-23 20:32:14] [INFO ] Flatten gal took : 14 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/graph7863639137066359209.txt' '-o' '/tmp/graph7863639137066359209.bin' '-w' '/tmp/graph7863639137066359209.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7863639137066359209.bin' '-l' '-1' '-v' '-w' '/tmp/graph7863639137066359209.weights' '-q' '0' '-e' '0.001'
[2024-05-23 20:32:14] [INFO ] Decomposing Gal with order
[2024-05-23 20:32:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 20:32:14] [INFO ] Removed a total of 289 redundant transitions.
[2024-05-23 20:32:14] [INFO ] Flatten gal took : 51 ms
[2024-05-23 20:32:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 8 ms.
[2024-05-23 20:32:14] [INFO ] Time to serialize gal into /tmp/LTL9498281841783235772.gal : 5 ms
[2024-05-23 20:32:14] [INFO ] Time to serialize properties into /tmp/LTL3147669722389212226.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/LTL9498281841783235772.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3147669722389212226.ltl' '-c' '-stutter-deadlock'

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...254
Read 1 LTL properties
Checking formula 0 : !((F((G("(((i8.u28.p1140==0)||(i1.u5.p229==1))||((u40.p1645==0)||(u44.p2186==1)))"))||(G(F(("((i3.u12.p541==0)&&(i8.u25.p1104==1))")&&...205
Formula 0 simplified : G(F!"(((i8.u28.p1140==0)||(i1.u5.p229==1))||((u40.p1645==0)||(u44.p2186==1)))" & FG(!"((i3.u12.p541==0)&&(i8.u25.p1104==1))" | X!"((...193
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2916818564690455929
[2024-05-23 20:32:29] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2916818564690455929
Running compilation step : cd /tmp/ltsmin2916818564690455929;'/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 1027 ms.
Running link step : cd /tmp/ltsmin2916818564690455929;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2916818564690455929;'/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))||[](<>((X((LTLAPp2==true))&&(LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-15 finished in 103781 ms.
[2024-05-23 20:32:44] [INFO ] Flatten gal took : 29 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12646619076133797953
[2024-05-23 20:32:44] [INFO ] Computing symmetric may disable matrix : 1036 transitions.
[2024-05-23 20:32:44] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:32:44] [INFO ] Applying decomposition
[2024-05-23 20:32:44] [INFO ] Computing symmetric may enable matrix : 1036 transitions.
[2024-05-23 20:32:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:32:44] [INFO ] Flatten gal took : 31 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/graph11479284885499688923.txt' '-o' '/tmp/graph11479284885499688923.bin' '-w' '/tmp/graph11479284885499688923.weights'
[2024-05-23 20:32:45] [INFO ] Computing Do-Not-Accords matrix : 1036 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11479284885499688923.bin' '-l' '-1' '-v' '-w' '/tmp/graph11479284885499688923.weights' '-q' '0' '-e' '0.001'
[2024-05-23 20:32:45] [INFO ] Decomposing Gal with order
[2024-05-23 20:32:45] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:32:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 20:32:45] [INFO ] Built C files in 212ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12646619076133797953
Running compilation step : cd /tmp/ltsmin12646619076133797953;'/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-23 20:32:45] [INFO ] Removed a total of 319 redundant transitions.
[2024-05-23 20:32:45] [INFO ] Flatten gal took : 110 ms
[2024-05-23 20:32:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 11 ms.
[2024-05-23 20:32:45] [INFO ] Time to serialize gal into /tmp/LTLCardinality13206486536808396973.gal : 9 ms
[2024-05-23 20:32:45] [INFO ] Time to serialize properties into /tmp/LTLCardinality14178814513899423737.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/LTLCardinality13206486536808396973.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14178814513899423737.ltl' '-c' '-stutter-deadlock'

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...278
Read 2 LTL properties
Checking formula 0 : !((G(F("(((i12.u150.p2395==0)||(i4.i1.i1.u37.p443==1))||((i13.u113.p1363==0)||(i3.u30.p390==1)))"))))
Formula 0 simplified : FG!"(((i12.u150.p2395==0)||(i4.i1.i1.u37.p443==1))||((i13.u113.p1363==0)||(i3.u30.p390==1)))"
Compilation finished in 3165 ms.
Running link step : cd /tmp/ltsmin12646619076133797953;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin12646619076133797953;'/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' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-23 20:54:37] [INFO ] Applying decomposition
[2024-05-23 20:54:37] [INFO ] Flatten gal took : 52 ms
[2024-05-23 20:54:37] [INFO ] Decomposing Gal with order
[2024-05-23 20:54:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 20:54:37] [INFO ] Removed a total of 271 redundant transitions.
[2024-05-23 20:54:37] [INFO ] Flatten gal took : 194 ms
[2024-05-23 20:54:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 880 labels/synchronizations in 230 ms.
[2024-05-23 20:54:37] [INFO ] Time to serialize gal into /tmp/LTLCardinality1901919150512363073.gal : 26 ms
[2024-05-23 20:54:37] [INFO ] Time to serialize properties into /tmp/LTLCardinality14610319462368600236.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/LTLCardinality1901919150512363073.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14610319462368600236.ltl' '-c' '-stutter-deadlock'

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 2 LTL properties
Checking formula 0 : !((G(F("(((i1.u29.p2395==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u17.p443==1))||((i0.i0.i0.i0.u24.p1363==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0...184
Formula 0 simplified : FG!"(((i1.u29.p2395==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u17.p443==1))||((i0.i0.i0.i0.u24.p1363==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i...178
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin12646619076133797953;'/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' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12646619076133797953;'/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' '<>(([]((LTLAPp1==true))||[](<>((X((LTLAPp3==true))&&(LTLAPp2==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-23 21:16:30] [INFO ] Flatten gal took : 77 ms
[2024-05-23 21:16:30] [INFO ] Input system was already deterministic with 1036 transitions.
[2024-05-23 21:16:30] [INFO ] Transformed 781 places.
[2024-05-23 21:16:30] [INFO ] Transformed 1036 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-23 21:16:31] [INFO ] Time to serialize gal into /tmp/LTLCardinality15555742119329238663.gal : 4 ms
[2024-05-23 21:16:31] [INFO ] Time to serialize properties into /tmp/LTLCardinality1488464506920620034.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/LTLCardinality15555742119329238663.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1488464506920620034.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...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("(((p2395==0)||(p443==1))||((p1363==0)||(p390==1)))"))))
Formula 0 simplified : FG!"(((p2395==0)||(p443==1))||((p1363==0)||(p390==1)))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10819660 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16200232 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="FlexibleBarrier-PT-14b"
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 FlexibleBarrier-PT-14b, 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 r197-tall-171640624800057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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