Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.3K Apr 29 13:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 29 13:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 13:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 29 13:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 9 07:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 945K May 10 09:33 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-16b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652644918420

Running Version 202205111006
[2022-05-15 20:02:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 20:02:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 20:02:01] [INFO ] Load time of PNML (sax parser for PT used): 599 ms
[2022-05-15 20:02:01] [INFO ] Transformed 3472 places.
[2022-05-15 20:02:01] [INFO ] Transformed 4001 transitions.
[2022-05-15 20:02:01] [INFO ] Found NUPN structural information;
[2022-05-15 20:02:01] [INFO ] Parsed PT model containing 3472 places and 4001 transitions in 893 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 146 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 3472 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3472/3472 places, 4001/4001 transitions.
Discarding 1420 places :
Symmetric choice reduction at 0 with 1420 rule applications. Total rules 1420 place count 2052 transition count 2581
Iterating global reduction 0 with 1420 rules applied. Total rules applied 2840 place count 2052 transition count 2581
Discarding 665 places :
Symmetric choice reduction at 0 with 665 rule applications. Total rules 3505 place count 1387 transition count 1916
Iterating global reduction 0 with 665 rules applied. Total rules applied 4170 place count 1387 transition count 1916
Discarding 428 places :
Symmetric choice reduction at 0 with 428 rule applications. Total rules 4598 place count 959 transition count 1488
Iterating global reduction 0 with 428 rules applied. Total rules applied 5026 place count 959 transition count 1488
Ensure Unique test removed 209 transitions
Reduce isomorphic transitions removed 209 transitions.
Iterating post reduction 0 with 209 rules applied. Total rules applied 5235 place count 959 transition count 1279
Applied a total of 5235 rules in 1040 ms. Remains 959 /3472 variables (removed 2513) and now considering 1279/4001 (removed 2722) transitions.
// Phase 1: matrix 1279 rows 959 cols
[2022-05-15 20:02:03] [INFO ] Computed 18 place invariants in 68 ms
[2022-05-15 20:02:04] [INFO ] Implicit Places using invariants in 1046 ms returned []
// Phase 1: matrix 1279 rows 959 cols
[2022-05-15 20:02:04] [INFO ] Computed 18 place invariants in 27 ms
[2022-05-15 20:02:05] [INFO ] Implicit Places using invariants and state equation in 1606 ms returned []
Implicit Place search using SMT with State Equation took 2701 ms to find 0 implicit places.
// Phase 1: matrix 1279 rows 959 cols
[2022-05-15 20:02:06] [INFO ] Computed 18 place invariants in 20 ms
[2022-05-15 20:02:07] [INFO ] Dead Transitions using invariants and state equation in 1032 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 959/3472 places, 1279/4001 transitions.
Finished structural reductions, in 1 iterations. Remains : 959/3472 places, 1279/4001 transitions.
Support contains 43 out of 959 places after structural reductions.
[2022-05-15 20:02:07] [INFO ] Flatten gal took : 236 ms
[2022-05-15 20:02:07] [INFO ] Flatten gal took : 114 ms
[2022-05-15 20:02:07] [INFO ] Input system was already deterministic with 1279 transitions.
Support contains 42 out of 959 places (down from 43) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 89 resets, run finished after 1252 ms. (steps per millisecond=7 ) properties (out of 34) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Running SMT prover for 27 properties.
// Phase 1: matrix 1279 rows 959 cols
[2022-05-15 20:02:09] [INFO ] Computed 18 place invariants in 15 ms
[2022-05-15 20:02:10] [INFO ] [Real]Absence check using 18 positive place invariants in 24 ms returned sat
[2022-05-15 20:02:10] [INFO ] After 1259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2022-05-15 20:02:11] [INFO ] [Nat]Absence check using 18 positive place invariants in 16 ms returned sat
[2022-05-15 20:02:14] [INFO ] After 2602ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :26
[2022-05-15 20:02:17] [INFO ] Deduced a trap composed of 285 places in 564 ms of which 17 ms to minimize.
[2022-05-15 20:02:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 693 ms
[2022-05-15 20:02:18] [INFO ] Deduced a trap composed of 283 places in 643 ms of which 3 ms to minimize.
[2022-05-15 20:02:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 801 ms
[2022-05-15 20:02:19] [INFO ] Deduced a trap composed of 284 places in 578 ms of which 3 ms to minimize.
[2022-05-15 20:02:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 695 ms
[2022-05-15 20:02:19] [INFO ] After 7694ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :26
Attempting to minimize the solution found.
Minimization took 1514 ms.
[2022-05-15 20:02:21] [INFO ] After 10642ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :26
Fused 27 Parikh solutions to 26 different solutions.
Parikh walk visited 14 properties in 669 ms.
Support contains 17 out of 959 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 959/959 places, 1279/1279 transitions.
Graph (trivial) has 864 edges and 959 vertex of which 85 / 959 are part of one of the 14 SCC in 8 ms
Free SCC test removed 71 places
Drop transitions removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 888 transition count 1115
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 810 transition count 1115
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 157 place count 810 transition count 1076
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 235 place count 771 transition count 1076
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 273 place count 733 transition count 1038
Iterating global reduction 2 with 38 rules applied. Total rules applied 311 place count 733 transition count 1038
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 312 place count 733 transition count 1037
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 323 place count 722 transition count 1026
Iterating global reduction 3 with 11 rules applied. Total rules applied 334 place count 722 transition count 1026
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 341 place count 722 transition count 1019
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 2 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 4 with 214 rules applied. Total rules applied 555 place count 615 transition count 912
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 585 place count 615 transition count 882
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 602 place count 598 transition count 865
Iterating global reduction 5 with 17 rules applied. Total rules applied 619 place count 598 transition count 865
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 620 place count 598 transition count 864
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 624 place count 596 transition count 864
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 628 place count 596 transition count 860
Free-agglomeration rule applied 469 times.
Iterating global reduction 6 with 469 rules applied. Total rules applied 1097 place count 596 transition count 391
Reduce places removed 469 places and 0 transitions.
Drop transitions removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Iterating post reduction 6 with 621 rules applied. Total rules applied 1718 place count 127 transition count 239
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 7 with 26 rules applied. Total rules applied 1744 place count 127 transition count 213
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 1746 place count 127 transition count 213
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1747 place count 126 transition count 212
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 80 edges and 125 vertex of which 28 / 125 are part of one of the 14 SCC in 1 ms
Free SCC test removed 14 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 1749 place count 111 transition count 212
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 8 with 28 rules applied. Total rules applied 1777 place count 111 transition count 184
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 16 Pre rules applied. Total rules applied 1777 place count 111 transition count 168
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 9 with 32 rules applied. Total rules applied 1809 place count 95 transition count 168
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 1824 place count 95 transition count 153
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 10 with 36 rules applied. Total rules applied 1860 place count 77 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1861 place count 77 transition count 134
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1862 place count 77 transition count 133
Free-agglomeration rule applied 14 times.
Iterating global reduction 11 with 14 rules applied. Total rules applied 1876 place count 77 transition count 119
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 13 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 11 with 52 rules applied. Total rules applied 1928 place count 54 transition count 90
Discarding 8 places :
Symmetric choice reduction at 12 with 8 rule applications. Total rules 1936 place count 46 transition count 82
Iterating global reduction 12 with 8 rules applied. Total rules applied 1944 place count 46 transition count 82
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 1952 place count 46 transition count 74
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 13 with 9 rules applied. Total rules applied 1961 place count 46 transition count 65
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1962 place count 46 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1963 place count 45 transition count 64
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 1964 place count 45 transition count 64
Applied a total of 1964 rules in 1177 ms. Remains 45 /959 variables (removed 914) and now considering 64/1279 (removed 1215) transitions.
Finished structural reductions, in 1 iterations. Remains : 45/959 places, 64/1279 transitions.
Finished random walk after 1043 steps, including 0 resets, run visited all 12 properties in 54 ms. (steps per millisecond=19 )
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 18 stabilizing places and 18 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(F(G(p0))))))'
Support contains 1 out of 959 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 959/959 places, 1279/1279 transitions.
Graph (trivial) has 908 edges and 959 vertex of which 97 / 959 are part of one of the 16 SCC in 3 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 90 place count 877 transition count 1107
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 179 place count 788 transition count 1107
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 179 place count 788 transition count 1068
Deduced a syphon composed of 39 places in 2 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 257 place count 749 transition count 1068
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 310 place count 696 transition count 1015
Iterating global reduction 2 with 53 rules applied. Total rules applied 363 place count 696 transition count 1015
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 365 place count 696 transition count 1013
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 365 place count 696 transition count 1012
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 367 place count 695 transition count 1012
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 378 place count 684 transition count 1001
Iterating global reduction 3 with 11 rules applied. Total rules applied 389 place count 684 transition count 1001
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 400 place count 684 transition count 990
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 1 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 4 with 196 rules applied. Total rules applied 596 place count 586 transition count 892
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 598 place count 584 transition count 890
Iterating global reduction 4 with 2 rules applied. Total rules applied 600 place count 584 transition count 890
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 602 place count 584 transition count 888
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 618 place count 584 transition count 872
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 620 place count 582 transition count 870
Applied a total of 620 rules in 583 ms. Remains 582 /959 variables (removed 377) and now considering 870/1279 (removed 409) transitions.
[2022-05-15 20:02:24] [INFO ] Flow matrix only has 839 transitions (discarded 31 similar events)
// Phase 1: matrix 839 rows 582 cols
[2022-05-15 20:02:24] [INFO ] Computed 18 place invariants in 14 ms
[2022-05-15 20:02:25] [INFO ] Implicit Places using invariants in 543 ms returned []
[2022-05-15 20:02:25] [INFO ] Flow matrix only has 839 transitions (discarded 31 similar events)
// Phase 1: matrix 839 rows 582 cols
[2022-05-15 20:02:25] [INFO ] Computed 18 place invariants in 14 ms
[2022-05-15 20:02:26] [INFO ] Implicit Places using invariants and state equation in 1104 ms returned []
Implicit Place search using SMT with State Equation took 1667 ms to find 0 implicit places.
[2022-05-15 20:02:26] [INFO ] Redundant transitions in 98 ms returned []
[2022-05-15 20:02:26] [INFO ] Flow matrix only has 839 transitions (discarded 31 similar events)
// Phase 1: matrix 839 rows 582 cols
[2022-05-15 20:02:26] [INFO ] Computed 18 place invariants in 13 ms
[2022-05-15 20:02:27] [INFO ] Dead Transitions using invariants and state equation in 863 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 582/959 places, 870/1279 transitions.
Finished structural reductions, in 1 iterations. Remains : 582/959 places, 870/1279 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s483 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 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-00 finished in 3517 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U X(p1)) U (X(G(X(p2)))||F(X(G(p0))))))'
Support contains 4 out of 959 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 959/959 places, 1279/1279 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 936 transition count 1256
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 936 transition count 1256
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 936 transition count 1254
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 67 place count 917 transition count 1235
Iterating global reduction 1 with 19 rules applied. Total rules applied 86 place count 917 transition count 1235
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 94 place count 917 transition count 1227
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 103 place count 908 transition count 1218
Iterating global reduction 2 with 9 rules applied. Total rules applied 112 place count 908 transition count 1218
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 117 place count 908 transition count 1213
Applied a total of 117 rules in 185 ms. Remains 908 /959 variables (removed 51) and now considering 1213/1279 (removed 66) transitions.
// Phase 1: matrix 1213 rows 908 cols
[2022-05-15 20:02:27] [INFO ] Computed 18 place invariants in 22 ms
[2022-05-15 20:02:28] [INFO ] Implicit Places using invariants in 702 ms returned []
// Phase 1: matrix 1213 rows 908 cols
[2022-05-15 20:02:28] [INFO ] Computed 18 place invariants in 14 ms
[2022-05-15 20:02:29] [INFO ] Implicit Places using invariants and state equation in 1396 ms returned []
Implicit Place search using SMT with State Equation took 2106 ms to find 0 implicit places.
// Phase 1: matrix 1213 rows 908 cols
[2022-05-15 20:02:29] [INFO ] Computed 18 place invariants in 19 ms
[2022-05-15 20:02:30] [INFO ] Dead Transitions using invariants and state equation in 1247 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 908/959 places, 1213/1279 transitions.
Finished structural reductions, in 1 iterations. Remains : 908/959 places, 1213/1279 transitions.
Stuttering acceptance computed with spot in 622 ms :[(AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 5}, { cond=p0, acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0, 1} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 1}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 3}], [{ cond=(NOT p2), acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(AND p1 p2), acceptance={} source=7 dest: 3}], [{ cond=p2, acceptance={} source=8 dest: 7}, { cond=(AND p0 p2), acceptance={} source=8 dest: 8}]], initial=4, aps=[p1:(AND (EQ s249 1) (EQ s902 1)), p0:(EQ s391 1), p2:(EQ s341 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33365 reset in 1173 ms.
Product exploration explored 100000 steps with 33289 reset in 854 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 (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (NOT p1)), (X (AND (NOT p0) (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), true, (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1308 ms. Reduced automaton from 9 states, 19 edges and 3 AP to 9 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 456 ms :[(AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2)]
Incomplete random walk after 10000 steps, including 88 resets, run finished after 683 ms. (steps per millisecond=14 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 131697 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 131697 steps, saw 64538 distinct states, run finished after 3002 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1213 rows 908 cols
[2022-05-15 20:02:39] [INFO ] Computed 18 place invariants in 12 ms
[2022-05-15 20:02:40] [INFO ] [Real]Absence check using 18 positive place invariants in 20 ms returned sat
[2022-05-15 20:02:41] [INFO ] After 1494ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-15 20:02:41] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2022-05-15 20:02:42] [INFO ] After 1346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-05-15 20:02:44] [INFO ] After 2566ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 590 ms.
[2022-05-15 20:02:44] [INFO ] After 3695ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 9 properties in 55 ms.
Support contains 2 out of 908 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 908/908 places, 1213/1213 transitions.
Graph (trivial) has 855 edges and 908 vertex of which 97 / 908 are part of one of the 16 SCC in 1 ms
Free SCC test removed 81 places
Drop transitions removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 77 place count 827 transition count 1039
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 153 place count 751 transition count 1039
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 153 place count 751 transition count 1004
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 223 place count 716 transition count 1004
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 253 place count 686 transition count 974
Iterating global reduction 2 with 30 rules applied. Total rules applied 283 place count 686 transition count 974
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 284 place count 685 transition count 973
Iterating global reduction 2 with 1 rules applied. Total rules applied 285 place count 685 transition count 973
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 485 place count 585 transition count 873
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 517 place count 585 transition count 841
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 533 place count 569 transition count 825
Iterating global reduction 3 with 16 rules applied. Total rules applied 549 place count 569 transition count 825
Free-agglomeration rule applied 483 times.
Iterating global reduction 3 with 483 rules applied. Total rules applied 1032 place count 569 transition count 342
Reduce places removed 483 places and 0 transitions.
Drop transitions removed 210 transitions
Reduce isomorphic transitions removed 210 transitions.
Iterating post reduction 3 with 693 rules applied. Total rules applied 1725 place count 86 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1726 place count 85 transition count 131
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 112 edges and 83 vertex of which 80 / 83 are part of one of the 16 SCC in 0 ms
Free SCC test removed 64 places
Iterating post reduction 4 with 3 rules applied. Total rules applied 1729 place count 19 transition count 131
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 112 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 125 transitions.
Iterating post reduction 5 with 139 rules applied. Total rules applied 1868 place count 5 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1869 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1869 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1871 place count 4 transition count 4
Applied a total of 1871 rules in 276 ms. Remains 4 /908 variables (removed 904) and now considering 4/1213 (removed 1209) transitions.
Finished structural reductions, in 1 iterations. Remains : 4/908 places, 4/1213 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (NOT p1)), (X (AND (NOT p0) (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), true, (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (AND p0 p2)), (F p2), (F (AND (NOT p0) p2)), (F (AND p0 (NOT p2))), (F p1), (F (AND (NOT p1) p2)), (F p0), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p1 p2))]
Knowledge based reduction with 17 factoid took 1308 ms. Reduced automaton from 9 states, 19 edges and 3 AP to 9 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 449 ms :[(AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2)]
Stuttering acceptance computed with spot in 479 ms :[(AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2)]
// Phase 1: matrix 1213 rows 908 cols
[2022-05-15 20:02:47] [INFO ] Computed 18 place invariants in 22 ms
[2022-05-15 20:02:48] [INFO ] [Real]Absence check using 18 positive place invariants in 44 ms returned sat
[2022-05-15 20:02:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:02:52] [INFO ] [Real]Absence check using state equation in 3804 ms returned sat
[2022-05-15 20:02:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:02:53] [INFO ] [Nat]Absence check using 18 positive place invariants in 28 ms returned sat
[2022-05-15 20:02:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:02:55] [INFO ] [Nat]Absence check using state equation in 2180 ms returned sat
[2022-05-15 20:02:55] [INFO ] Computed and/alt/rep : 1176/1884/1176 causal constraints (skipped 36 transitions) in 167 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 20:03:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p2))
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 4 out of 908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 908/908 places, 1213/1213 transitions.
Applied a total of 0 rules in 66 ms. Remains 908 /908 variables (removed 0) and now considering 1213/1213 (removed 0) transitions.
// Phase 1: matrix 1213 rows 908 cols
[2022-05-15 20:03:07] [INFO ] Computed 18 place invariants in 22 ms
[2022-05-15 20:03:08] [INFO ] Implicit Places using invariants in 1070 ms returned []
// Phase 1: matrix 1213 rows 908 cols
[2022-05-15 20:03:08] [INFO ] Computed 18 place invariants in 21 ms
[2022-05-15 20:03:10] [INFO ] Implicit Places using invariants and state equation in 1722 ms returned []
Implicit Place search using SMT with State Equation took 2794 ms to find 0 implicit places.
// Phase 1: matrix 1213 rows 908 cols
[2022-05-15 20:03:10] [INFO ] Computed 18 place invariants in 21 ms
[2022-05-15 20:03:11] [INFO ] Dead Transitions using invariants and state equation in 1557 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 908/908 places, 1213/1213 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 (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (NOT p1)), (X (AND (NOT p0) (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), true, (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1305 ms. Reduced automaton from 9 states, 19 edges and 3 AP to 9 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 541 ms :[(AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2)]
Incomplete random walk after 10000 steps, including 89 resets, run finished after 659 ms. (steps per millisecond=15 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1213 rows 908 cols
[2022-05-15 20:03:14] [INFO ] Computed 18 place invariants in 13 ms
[2022-05-15 20:03:14] [INFO ] [Real]Absence check using 18 positive place invariants in 17 ms returned sat
[2022-05-15 20:03:15] [INFO ] After 1344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-15 20:03:16] [INFO ] [Nat]Absence check using 18 positive place invariants in 20 ms returned sat
[2022-05-15 20:03:17] [INFO ] After 907ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-15 20:03:17] [INFO ] After 1564ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 517 ms.
[2022-05-15 20:03:18] [INFO ] After 2537ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 5 properties in 41 ms.
Support contains 3 out of 908 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 908/908 places, 1213/1213 transitions.
Graph (trivial) has 630 edges and 908 vertex of which 97 / 908 are part of one of the 16 SCC in 2 ms
Free SCC test removed 81 places
Drop transitions removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 77 place count 827 transition count 1039
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 153 place count 751 transition count 1039
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 153 place count 751 transition count 1004
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 223 place count 716 transition count 1004
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 254 place count 685 transition count 973
Iterating global reduction 2 with 31 rules applied. Total rules applied 285 place count 685 transition count 973
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 286 place count 684 transition count 972
Iterating global reduction 2 with 1 rules applied. Total rules applied 287 place count 684 transition count 972
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 288 place count 684 transition count 971
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 488 place count 584 transition count 871
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 504 place count 584 transition count 855
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 520 place count 568 transition count 839
Iterating global reduction 4 with 16 rules applied. Total rules applied 536 place count 568 transition count 839
Free-agglomeration rule applied 257 times.
Iterating global reduction 4 with 257 rules applied. Total rules applied 793 place count 568 transition count 582
Reduce places removed 257 places and 0 transitions.
Iterating post reduction 4 with 257 rules applied. Total rules applied 1050 place count 311 transition count 582
Discarding 91 places :
Symmetric choice reduction at 5 with 91 rule applications. Total rules 1141 place count 220 transition count 491
Iterating global reduction 5 with 91 rules applied. Total rules applied 1232 place count 220 transition count 491
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Iterating post reduction 5 with 91 rules applied. Total rules applied 1323 place count 220 transition count 400
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1324 place count 219 transition count 399
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 79 edges and 218 vertex of which 32 / 218 are part of one of the 16 SCC in 1 ms
Free SCC test removed 16 places
Iterating post reduction 6 with 2 rules applied. Total rules applied 1326 place count 202 transition count 399
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 7 with 32 rules applied. Total rules applied 1358 place count 202 transition count 367
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 15 Pre rules applied. Total rules applied 1358 place count 202 transition count 352
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 8 with 30 rules applied. Total rules applied 1388 place count 187 transition count 352
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 8 with 32 rules applied. Total rules applied 1420 place count 171 transition count 336
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 1436 place count 171 transition count 320
Free-agglomeration rule applied 16 times.
Iterating global reduction 8 with 16 rules applied. Total rules applied 1452 place count 171 transition count 304
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Iterating post reduction 8 with 149 rules applied. Total rules applied 1601 place count 141 transition count 185
Reduce places removed 91 places and 0 transitions.
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Iterating post reduction 9 with 182 rules applied. Total rules applied 1783 place count 50 transition count 94
Discarding 38 places :
Symmetric choice reduction at 10 with 38 rule applications. Total rules 1821 place count 12 transition count 56
Iterating global reduction 10 with 38 rules applied. Total rules applied 1859 place count 12 transition count 56
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 10 with 38 rules applied. Total rules applied 1897 place count 12 transition count 18
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1899 place count 12 transition count 16
Applied a total of 1899 rules in 330 ms. Remains 12 /908 variables (removed 896) and now considering 16/1213 (removed 1197) transitions.
Finished structural reductions, in 1 iterations. Remains : 12/908 places, 16/1213 transitions.
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (NOT p1)), (X (AND (NOT p0) (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), true, (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (AND p0 p2)), (F p2), (F (AND (NOT p0) p2)), (F (AND p0 (NOT p2))), (F p1), (F (AND (NOT p1) p2)), (F p0), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p1 p2))]
Knowledge based reduction with 17 factoid took 1400 ms. Reduced automaton from 9 states, 19 edges and 3 AP to 9 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 456 ms :[(AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2)]
Stuttering acceptance computed with spot in 466 ms :[(AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2)]
// Phase 1: matrix 1213 rows 908 cols
[2022-05-15 20:03:21] [INFO ] Computed 18 place invariants in 21 ms
[2022-05-15 20:03:22] [INFO ] [Real]Absence check using 18 positive place invariants in 37 ms returned sat
[2022-05-15 20:03:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:03:26] [INFO ] [Real]Absence check using state equation in 4063 ms returned sat
[2022-05-15 20:03:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:03:27] [INFO ] [Nat]Absence check using 18 positive place invariants in 24 ms returned sat
[2022-05-15 20:03:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:03:28] [INFO ] [Nat]Absence check using state equation in 1820 ms returned sat
[2022-05-15 20:03:29] [INFO ] Computed and/alt/rep : 1176/1884/1176 causal constraints (skipped 36 transitions) in 90 ms.
[2022-05-15 20:03:41] [INFO ] Added : 485 causal constraints over 97 iterations in 12318 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 459 ms :[(AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2)]
Product exploration explored 100000 steps with 33224 reset in 960 ms.
Product exploration explored 100000 steps with 33405 reset in 783 ms.
Applying partial POR strategy [false, false, true, true, false, true, false, true, false]
Stuttering acceptance computed with spot in 454 ms :[(AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2)]
Support contains 4 out of 908 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 908/908 places, 1213/1213 transitions.
Graph (trivial) has 629 edges and 908 vertex of which 97 / 908 are part of one of the 16 SCC in 2 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 827 transition count 1131
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 46 Pre rules applied. Total rules applied 64 place count 827 transition count 1131
Deduced a syphon composed of 109 places in 1 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 110 place count 827 transition count 1131
Discarding 74 places :
Symmetric choice reduction at 1 with 74 rule applications. Total rules 184 place count 753 transition count 1057
Deduced a syphon composed of 65 places in 2 ms
Iterating global reduction 1 with 74 rules applied. Total rules applied 258 place count 753 transition count 1057
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 259 place count 752 transition count 1056
Deduced a syphon composed of 65 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 260 place count 752 transition count 1056
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 150 places in 1 ms
Iterating global reduction 1 with 85 rules applied. Total rules applied 345 place count 752 transition count 1088
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 380 place count 717 transition count 1053
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 415 place count 717 transition count 1053
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 131 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 431 place count 717 transition count 1085
Deduced a syphon composed of 131 places in 0 ms
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 447 place count 717 transition count 1069
Deduced a syphon composed of 131 places in 0 ms
Applied a total of 447 rules in 826 ms. Remains 717 /908 variables (removed 191) and now considering 1069/1213 (removed 144) transitions.
[2022-05-15 20:03:45] [INFO ] Redundant transitions in 108 ms returned []
[2022-05-15 20:03:45] [INFO ] Flow matrix only has 1023 transitions (discarded 46 similar events)
// Phase 1: matrix 1023 rows 717 cols
[2022-05-15 20:03:45] [INFO ] Computed 18 place invariants in 14 ms
[2022-05-15 20:03:46] [INFO ] Dead Transitions using invariants and state equation in 739 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 717/908 places, 1069/1213 transitions.
Finished structural reductions, in 1 iterations. Remains : 717/908 places, 1069/1213 transitions.
Product exploration explored 100000 steps with 33487 reset in 1146 ms.
Product exploration explored 100000 steps with 33522 reset in 800 ms.
Built C files in :
/tmp/ltsmin10684863958956917312
[2022-05-15 20:03:48] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10684863958956917312
Running compilation step : cd /tmp/ltsmin10684863958956917312;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10684863958956917312;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10684863958956917312;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 908/908 places, 1213/1213 transitions.
Applied a total of 0 rules in 32 ms. Remains 908 /908 variables (removed 0) and now considering 1213/1213 (removed 0) transitions.
// Phase 1: matrix 1213 rows 908 cols
[2022-05-15 20:03:51] [INFO ] Computed 18 place invariants in 16 ms
[2022-05-15 20:03:51] [INFO ] Implicit Places using invariants in 670 ms returned []
// Phase 1: matrix 1213 rows 908 cols
[2022-05-15 20:03:51] [INFO ] Computed 18 place invariants in 12 ms
[2022-05-15 20:03:53] [INFO ] Implicit Places using invariants and state equation in 1564 ms returned []
Implicit Place search using SMT with State Equation took 2238 ms to find 0 implicit places.
// Phase 1: matrix 1213 rows 908 cols
[2022-05-15 20:03:53] [INFO ] Computed 18 place invariants in 22 ms
[2022-05-15 20:03:54] [INFO ] Dead Transitions using invariants and state equation in 1458 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 908/908 places, 1213/1213 transitions.
Built C files in :
/tmp/ltsmin1904502016020068889
[2022-05-15 20:03:54] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1904502016020068889
Running compilation step : cd /tmp/ltsmin1904502016020068889;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1904502016020068889;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1904502016020068889;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 20:03:58] [INFO ] Flatten gal took : 72 ms
[2022-05-15 20:03:58] [INFO ] Flatten gal took : 61 ms
[2022-05-15 20:03:58] [INFO ] Time to serialize gal into /tmp/LTL11932107868002336236.gal : 18 ms
[2022-05-15 20:03:58] [INFO ] Time to serialize properties into /tmp/LTL14099325568439863356.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11932107868002336236.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14099325568439863356.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1193210...268
Read 1 LTL properties
Checking formula 0 : !(((!(("(p1385==1)")U(X("((p885==1)&&(p3457==1))"))))U((X(G(X("(p1192==1)"))))||(F(X(G("(p1385==1)")))))))
Formula 0 simplified : !(!("(p1385==1)" U X"((p885==1)&&(p3457==1))") U (XGX"(p1192==1)" | FXG"(p1385==1)"))
Detected timeout of ITS tools.
[2022-05-15 20:04:13] [INFO ] Flatten gal took : 56 ms
[2022-05-15 20:04:13] [INFO ] Applying decomposition
[2022-05-15 20:04:13] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph404607441280488906.txt' '-o' '/tmp/graph404607441280488906.bin' '-w' '/tmp/graph404607441280488906.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph404607441280488906.bin' '-l' '-1' '-v' '-w' '/tmp/graph404607441280488906.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:04:13] [INFO ] Decomposing Gal with order
[2022-05-15 20:04:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:04:14] [INFO ] Removed a total of 351 redundant transitions.
[2022-05-15 20:04:14] [INFO ] Flatten gal took : 440 ms
[2022-05-15 20:04:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 27 ms.
[2022-05-15 20:04:14] [INFO ] Time to serialize gal into /tmp/LTL4836605165305883531.gal : 20 ms
[2022-05-15 20:04:14] [INFO ] Time to serialize properties into /tmp/LTL17999578062881400661.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4836605165305883531.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17999578062881400661.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4836605...246
Read 1 LTL properties
Checking formula 0 : !(((!(("(i10.u101.p1385==1)")U(X("((i5.i0.i1.u63.p885==1)&&(u173.p3457==1))"))))U((X(G(X("(i8.u87.p1192==1)"))))||(F(X(G("(i10.u101.p1...170
Formula 0 simplified : !(!("(i10.u101.p1385==1)" U X"((i5.i0.i1.u63.p885==1)&&(u173.p3457==1))") U (XGX"(i8.u87.p1192==1)" | FXG"(i10.u101.p1385==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9861345690307624903
[2022-05-15 20:04:29] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9861345690307624903
Running compilation step : cd /tmp/ltsmin9861345690307624903;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9861345690307624903;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9861345690307624903;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-01 finished in 125067 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U p1)||p2)))'
Support contains 4 out of 959 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 959/959 places, 1279/1279 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 934 transition count 1254
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 934 transition count 1254
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 934 transition count 1252
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 72 place count 914 transition count 1232
Iterating global reduction 1 with 20 rules applied. Total rules applied 92 place count 914 transition count 1232
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 101 place count 914 transition count 1223
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 110 place count 905 transition count 1214
Iterating global reduction 2 with 9 rules applied. Total rules applied 119 place count 905 transition count 1214
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 124 place count 905 transition count 1209
Applied a total of 124 rules in 140 ms. Remains 905 /959 variables (removed 54) and now considering 1209/1279 (removed 70) transitions.
// Phase 1: matrix 1209 rows 905 cols
[2022-05-15 20:04:32] [INFO ] Computed 18 place invariants in 14 ms
[2022-05-15 20:04:33] [INFO ] Implicit Places using invariants in 948 ms returned []
// Phase 1: matrix 1209 rows 905 cols
[2022-05-15 20:04:33] [INFO ] Computed 18 place invariants in 22 ms
[2022-05-15 20:04:35] [INFO ] Implicit Places using invariants and state equation in 1877 ms returned []
Implicit Place search using SMT with State Equation took 2829 ms to find 0 implicit places.
// Phase 1: matrix 1209 rows 905 cols
[2022-05-15 20:04:35] [INFO ] Computed 18 place invariants in 22 ms
[2022-05-15 20:04:36] [INFO ] Dead Transitions using invariants and state equation in 1336 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 905/959 places, 1209/1279 transitions.
Finished structural reductions, in 1 iterations. Remains : 905/959 places, 1209/1279 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(EQ s627 1), p2:(EQ s214 1), p1:(AND (EQ s83 1) (EQ s904 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-02 finished in 4492 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p0)||G(p1)||p2)))))'
Support contains 6 out of 959 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 959/959 places, 1279/1279 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 937 transition count 1257
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 937 transition count 1257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 937 transition count 1256
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 63 place count 919 transition count 1238
Iterating global reduction 1 with 18 rules applied. Total rules applied 81 place count 919 transition count 1238
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 89 place count 919 transition count 1230
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 97 place count 911 transition count 1222
Iterating global reduction 2 with 8 rules applied. Total rules applied 105 place count 911 transition count 1222
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 109 place count 911 transition count 1218
Applied a total of 109 rules in 129 ms. Remains 911 /959 variables (removed 48) and now considering 1218/1279 (removed 61) transitions.
// Phase 1: matrix 1218 rows 911 cols
[2022-05-15 20:04:37] [INFO ] Computed 18 place invariants in 15 ms
[2022-05-15 20:04:37] [INFO ] Implicit Places using invariants in 764 ms returned []
// Phase 1: matrix 1218 rows 911 cols
[2022-05-15 20:04:37] [INFO ] Computed 18 place invariants in 14 ms
[2022-05-15 20:04:39] [INFO ] Implicit Places using invariants and state equation in 1396 ms returned []
Implicit Place search using SMT with State Equation took 2162 ms to find 0 implicit places.
// Phase 1: matrix 1218 rows 911 cols
[2022-05-15 20:04:39] [INFO ] Computed 18 place invariants in 20 ms
[2022-05-15 20:04:40] [INFO ] Dead Transitions using invariants and state equation in 1375 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 911/959 places, 1218/1279 transitions.
Finished structural reductions, in 1 iterations. Remains : 911/959 places, 1218/1279 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(AND (EQ s177 0) (EQ s397 1)), p1:(AND (EQ s343 1) (EQ s402 1) (EQ s813 1)), p2:(EQ s349 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 115 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-03 finished in 3896 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!X(p0)) U (X(p1)&&!X(p0)&&p2))))'
Support contains 3 out of 959 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 959/959 places, 1279/1279 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 936 transition count 1256
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 936 transition count 1256
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 936 transition count 1254
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 67 place count 917 transition count 1235
Iterating global reduction 1 with 19 rules applied. Total rules applied 86 place count 917 transition count 1235
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 94 place count 917 transition count 1227
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 103 place count 908 transition count 1218
Iterating global reduction 2 with 9 rules applied. Total rules applied 112 place count 908 transition count 1218
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 117 place count 908 transition count 1213
Applied a total of 117 rules in 116 ms. Remains 908 /959 variables (removed 51) and now considering 1213/1279 (removed 66) transitions.
// Phase 1: matrix 1213 rows 908 cols
[2022-05-15 20:04:40] [INFO ] Computed 18 place invariants in 18 ms
[2022-05-15 20:04:41] [INFO ] Implicit Places using invariants in 974 ms returned []
// Phase 1: matrix 1213 rows 908 cols
[2022-05-15 20:04:41] [INFO ] Computed 18 place invariants in 19 ms
[2022-05-15 20:04:43] [INFO ] Implicit Places using invariants and state equation in 1720 ms returned []
Implicit Place search using SMT with State Equation took 2698 ms to find 0 implicit places.
// Phase 1: matrix 1213 rows 908 cols
[2022-05-15 20:04:43] [INFO ] Computed 18 place invariants in 19 ms
[2022-05-15 20:04:45] [INFO ] Dead Transitions using invariants and state equation in 1544 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 908/959 places, 1213/1279 transitions.
Finished structural reductions, in 1 iterations. Remains : 908/959 places, 1213/1279 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p2) (NOT p1) p0), (OR (NOT p2) (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 2}], [{ cond=(OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=2 dest: 1}, { cond=(OR (AND p0 p2) (AND (NOT p1) p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s369 1), p0:(EQ s261 1), p1:(EQ s760 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 110 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-05 finished in 4522 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U p1))'
Support contains 2 out of 959 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 959/959 places, 1279/1279 transitions.
Graph (trivial) has 905 edges and 959 vertex of which 91 / 959 are part of one of the 15 SCC in 1 ms
Free SCC test removed 76 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 90 place count 882 transition count 1112
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 179 place count 793 transition count 1112
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 179 place count 793 transition count 1072
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 259 place count 753 transition count 1072
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 310 place count 702 transition count 1021
Iterating global reduction 2 with 51 rules applied. Total rules applied 361 place count 702 transition count 1021
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 363 place count 702 transition count 1019
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 363 place count 702 transition count 1018
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 365 place count 701 transition count 1018
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 376 place count 690 transition count 1007
Iterating global reduction 3 with 11 rules applied. Total rules applied 387 place count 690 transition count 1007
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 398 place count 690 transition count 996
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 600 place count 589 transition count 895
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 602 place count 587 transition count 893
Iterating global reduction 4 with 2 rules applied. Total rules applied 604 place count 587 transition count 893
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 606 place count 587 transition count 891
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 608 place count 586 transition count 891
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 625 place count 586 transition count 874
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 627 place count 584 transition count 872
Applied a total of 627 rules in 441 ms. Remains 584 /959 variables (removed 375) and now considering 872/1279 (removed 407) transitions.
[2022-05-15 20:04:45] [INFO ] Flow matrix only has 842 transitions (discarded 30 similar events)
// Phase 1: matrix 842 rows 584 cols
[2022-05-15 20:04:45] [INFO ] Computed 18 place invariants in 19 ms
[2022-05-15 20:04:46] [INFO ] Implicit Places using invariants in 776 ms returned []
[2022-05-15 20:04:46] [INFO ] Flow matrix only has 842 transitions (discarded 30 similar events)
// Phase 1: matrix 842 rows 584 cols
[2022-05-15 20:04:46] [INFO ] Computed 18 place invariants in 25 ms
[2022-05-15 20:04:47] [INFO ] Implicit Places using invariants and state equation in 1297 ms returned []
Implicit Place search using SMT with State Equation took 2076 ms to find 0 implicit places.
[2022-05-15 20:04:47] [INFO ] Redundant transitions in 18 ms returned []
[2022-05-15 20:04:47] [INFO ] Flow matrix only has 842 transitions (discarded 30 similar events)
// Phase 1: matrix 842 rows 584 cols
[2022-05-15 20:04:47] [INFO ] Computed 18 place invariants in 19 ms
[2022-05-15 20:04:48] [INFO ] Dead Transitions using invariants and state equation in 994 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 584/959 places, 872/1279 transitions.
Finished structural reductions, in 1 iterations. Remains : 584/959 places, 872/1279 transitions.
Stuttering acceptance computed with spot in 58 ms :[true, p1]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s69 1), p0:(NEQ s311 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1972 steps with 105 reset in 53 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-06 finished in 3666 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||p1)))'
Support contains 2 out of 959 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 959/959 places, 1279/1279 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 936 transition count 1256
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 936 transition count 1256
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 936 transition count 1254
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 66 place count 918 transition count 1236
Iterating global reduction 1 with 18 rules applied. Total rules applied 84 place count 918 transition count 1236
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 93 place count 918 transition count 1227
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 100 place count 911 transition count 1220
Iterating global reduction 2 with 7 rules applied. Total rules applied 107 place count 911 transition count 1220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 110 place count 911 transition count 1217
Applied a total of 110 rules in 140 ms. Remains 911 /959 variables (removed 48) and now considering 1217/1279 (removed 62) transitions.
// Phase 1: matrix 1217 rows 911 cols
[2022-05-15 20:04:49] [INFO ] Computed 18 place invariants in 16 ms
[2022-05-15 20:04:50] [INFO ] Implicit Places using invariants in 913 ms returned []
// Phase 1: matrix 1217 rows 911 cols
[2022-05-15 20:04:50] [INFO ] Computed 18 place invariants in 18 ms
[2022-05-15 20:04:51] [INFO ] Implicit Places using invariants and state equation in 1530 ms returned []
Implicit Place search using SMT with State Equation took 2445 ms to find 0 implicit places.
// Phase 1: matrix 1217 rows 911 cols
[2022-05-15 20:04:51] [INFO ] Computed 18 place invariants in 20 ms
[2022-05-15 20:04:53] [INFO ] Dead Transitions using invariants and state equation in 1598 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 911/959 places, 1217/1279 transitions.
Finished structural reductions, in 1 iterations. Remains : 911/959 places, 1217/1279 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(EQ s513 1), p1:(EQ s598 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 115 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-07 finished in 4312 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 out of 959 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 959/959 places, 1279/1279 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 934 transition count 1254
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 934 transition count 1254
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 934 transition count 1252
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 72 place count 914 transition count 1232
Iterating global reduction 1 with 20 rules applied. Total rules applied 92 place count 914 transition count 1232
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 101 place count 914 transition count 1223
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 110 place count 905 transition count 1214
Iterating global reduction 2 with 9 rules applied. Total rules applied 119 place count 905 transition count 1214
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 124 place count 905 transition count 1209
Applied a total of 124 rules in 122 ms. Remains 905 /959 variables (removed 54) and now considering 1209/1279 (removed 70) transitions.
// Phase 1: matrix 1209 rows 905 cols
[2022-05-15 20:04:53] [INFO ] Computed 18 place invariants in 19 ms
[2022-05-15 20:04:54] [INFO ] Implicit Places using invariants in 985 ms returned []
// Phase 1: matrix 1209 rows 905 cols
[2022-05-15 20:04:54] [INFO ] Computed 18 place invariants in 19 ms
[2022-05-15 20:04:55] [INFO ] Implicit Places using invariants and state equation in 1494 ms returned []
Implicit Place search using SMT with State Equation took 2482 ms to find 0 implicit places.
// Phase 1: matrix 1209 rows 905 cols
[2022-05-15 20:04:55] [INFO ] Computed 18 place invariants in 31 ms
[2022-05-15 20:04:57] [INFO ] Dead Transitions using invariants and state equation in 1187 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 905/959 places, 1209/1279 transitions.
Finished structural reductions, in 1 iterations. Remains : 905/959 places, 1209/1279 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s664 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-08 finished in 3884 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(p0))))'
Support contains 1 out of 959 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 959/959 places, 1279/1279 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 934 transition count 1254
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 934 transition count 1254
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 934 transition count 1252
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 72 place count 914 transition count 1232
Iterating global reduction 1 with 20 rules applied. Total rules applied 92 place count 914 transition count 1232
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 101 place count 914 transition count 1223
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 110 place count 905 transition count 1214
Iterating global reduction 2 with 9 rules applied. Total rules applied 119 place count 905 transition count 1214
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 124 place count 905 transition count 1209
Applied a total of 124 rules in 124 ms. Remains 905 /959 variables (removed 54) and now considering 1209/1279 (removed 70) transitions.
// Phase 1: matrix 1209 rows 905 cols
[2022-05-15 20:04:57] [INFO ] Computed 18 place invariants in 13 ms
[2022-05-15 20:04:58] [INFO ] Implicit Places using invariants in 995 ms returned []
// Phase 1: matrix 1209 rows 905 cols
[2022-05-15 20:04:58] [INFO ] Computed 18 place invariants in 21 ms
[2022-05-15 20:04:59] [INFO ] Implicit Places using invariants and state equation in 1514 ms returned []
Implicit Place search using SMT with State Equation took 2512 ms to find 0 implicit places.
// Phase 1: matrix 1209 rows 905 cols
[2022-05-15 20:04:59] [INFO ] Computed 18 place invariants in 13 ms
[2022-05-15 20:05:01] [INFO ] Dead Transitions using invariants and state equation in 1486 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 905/959 places, 1209/1279 transitions.
Finished structural reductions, in 1 iterations. Remains : 905/959 places, 1209/1279 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-09 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 s667 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1275 ms.
Product exploration explored 100000 steps with 50000 reset in 1012 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-09 finished in 6557 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X((F(p0)||p1))&&p2))||G(p3)))'
Support contains 3 out of 959 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 959/959 places, 1279/1279 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 937 transition count 1257
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 937 transition count 1257
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 937 transition count 1255
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 63 place count 920 transition count 1238
Iterating global reduction 1 with 17 rules applied. Total rules applied 80 place count 920 transition count 1238
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 86 place count 920 transition count 1232
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 95 place count 911 transition count 1223
Iterating global reduction 2 with 9 rules applied. Total rules applied 104 place count 911 transition count 1223
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 109 place count 911 transition count 1218
Applied a total of 109 rules in 112 ms. Remains 911 /959 variables (removed 48) and now considering 1218/1279 (removed 61) transitions.
// Phase 1: matrix 1218 rows 911 cols
[2022-05-15 20:05:03] [INFO ] Computed 18 place invariants in 13 ms
[2022-05-15 20:05:04] [INFO ] Implicit Places using invariants in 984 ms returned []
// Phase 1: matrix 1218 rows 911 cols
[2022-05-15 20:05:04] [INFO ] Computed 18 place invariants in 19 ms
[2022-05-15 20:05:06] [INFO ] Implicit Places using invariants and state equation in 1758 ms returned []
Implicit Place search using SMT with State Equation took 2744 ms to find 0 implicit places.
// Phase 1: matrix 1218 rows 911 cols
[2022-05-15 20:05:06] [INFO ] Computed 18 place invariants in 18 ms
[2022-05-15 20:05:07] [INFO ] Dead Transitions using invariants and state equation in 1344 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 911/959 places, 1218/1279 transitions.
Finished structural reductions, in 1 iterations. Remains : 911/959 places, 1218/1279 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 3}, { cond=(AND p2 p3), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p2 p3 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p3 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p2 p3 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=3, aps=[p2:(EQ s179 0), p0:(EQ s179 1), p1:(EQ s268 0), p3:(OR (EQ s890 1) (EQ s179 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1148 ms.
Product exploration explored 100000 steps with 50000 reset in 1012 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 p2 (NOT p0) p1 (NOT p3)), (X (NOT (AND p2 p3 (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)))), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 p3))), (X (NOT (AND (NOT p2) p3 (NOT p1) (NOT p0)))), (X (AND p2 (NOT p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p2 (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 p3 (NOT p1) (NOT p0))))), (X (X (AND p2 (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p2 p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3) (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p2 (NOT p0) p1 (NOT p3))
Knowledge based reduction with 29 factoid took 1159 ms. Reduced automaton from 6 states, 18 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-11 finished in 7784 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U !X(p1)))'
Support contains 2 out of 959 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 959/959 places, 1279/1279 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 936 transition count 1256
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 936 transition count 1256
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 936 transition count 1254
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 66 place count 918 transition count 1236
Iterating global reduction 1 with 18 rules applied. Total rules applied 84 place count 918 transition count 1236
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 93 place count 918 transition count 1227
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 100 place count 911 transition count 1220
Iterating global reduction 2 with 7 rules applied. Total rules applied 107 place count 911 transition count 1220
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 112 place count 911 transition count 1215
Applied a total of 112 rules in 177 ms. Remains 911 /959 variables (removed 48) and now considering 1215/1279 (removed 64) transitions.
// Phase 1: matrix 1215 rows 911 cols
[2022-05-15 20:05:11] [INFO ] Computed 18 place invariants in 22 ms
[2022-05-15 20:05:12] [INFO ] Implicit Places using invariants in 1070 ms returned []
// Phase 1: matrix 1215 rows 911 cols
[2022-05-15 20:05:12] [INFO ] Computed 18 place invariants in 22 ms
[2022-05-15 20:05:14] [INFO ] Implicit Places using invariants and state equation in 1439 ms returned []
Implicit Place search using SMT with State Equation took 2515 ms to find 0 implicit places.
// Phase 1: matrix 1215 rows 911 cols
[2022-05-15 20:05:14] [INFO ] Computed 18 place invariants in 21 ms
[2022-05-15 20:05:15] [INFO ] Dead Transitions using invariants and state equation in 1490 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 911/959 places, 1215/1279 transitions.
Finished structural reductions, in 1 iterations. Remains : 911/959 places, 1215/1279 transitions.
Stuttering acceptance computed with spot in 303 ms :[p1, true, p1, p1]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(OR (EQ s688 1) (NEQ s830 1)), p1:(EQ s688 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1371 ms.
Product exploration explored 100000 steps with 50000 reset in 1075 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)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 8 factoid took 126 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-12 finished in 7096 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p0)||p1))||G(X(F(p2))))))'
Support contains 3 out of 959 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 959/959 places, 1279/1279 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 936 transition count 1256
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 936 transition count 1256
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 936 transition count 1254
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 66 place count 918 transition count 1236
Iterating global reduction 1 with 18 rules applied. Total rules applied 84 place count 918 transition count 1236
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 92 place count 918 transition count 1228
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 101 place count 909 transition count 1219
Iterating global reduction 2 with 9 rules applied. Total rules applied 110 place count 909 transition count 1219
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 115 place count 909 transition count 1214
Applied a total of 115 rules in 119 ms. Remains 909 /959 variables (removed 50) and now considering 1214/1279 (removed 65) transitions.
// Phase 1: matrix 1214 rows 909 cols
[2022-05-15 20:05:18] [INFO ] Computed 18 place invariants in 12 ms
[2022-05-15 20:05:19] [INFO ] Implicit Places using invariants in 913 ms returned []
// Phase 1: matrix 1214 rows 909 cols
[2022-05-15 20:05:19] [INFO ] Computed 18 place invariants in 20 ms
[2022-05-15 20:05:21] [INFO ] Implicit Places using invariants and state equation in 1908 ms returned []
Implicit Place search using SMT with State Equation took 2823 ms to find 0 implicit places.
// Phase 1: matrix 1214 rows 909 cols
[2022-05-15 20:05:21] [INFO ] Computed 18 place invariants in 16 ms
[2022-05-15 20:05:23] [INFO ] Dead Transitions using invariants and state equation in 1539 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 909/959 places, 1214/1279 transitions.
Finished structural reductions, in 1 iterations. Remains : 909/959 places, 1214/1279 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s700 0), p0:(EQ s585 1), p2:(EQ s478 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 888 reset in 401 ms.
Product exploration explored 100000 steps with 890 reset in 517 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 p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 368 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 88 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1214 rows 909 cols
[2022-05-15 20:05:25] [INFO ] Computed 18 place invariants in 21 ms
[2022-05-15 20:05:25] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-15 20:05:25] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2022-05-15 20:05:26] [INFO ] After 941ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-15 20:05:27] [INFO ] After 1411ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 277 ms.
[2022-05-15 20:05:27] [INFO ] After 1978ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 2 properties in 29 ms.
Support contains 3 out of 909 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 909/909 places, 1214/1214 transitions.
Graph (trivial) has 852 edges and 909 vertex of which 91 / 909 are part of one of the 15 SCC in 1 ms
Free SCC test removed 76 places
Drop transitions removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Drop transitions removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 77 place count 833 transition count 1046
Reduce places removed 76 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 77 rules applied. Total rules applied 154 place count 757 transition count 1045
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 155 place count 756 transition count 1045
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 155 place count 756 transition count 1008
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 229 place count 719 transition count 1008
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 258 place count 690 transition count 979
Iterating global reduction 3 with 29 rules applied. Total rules applied 287 place count 690 transition count 979
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 491 place count 588 transition count 877
Drop transitions removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 522 place count 588 transition count 846
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 538 place count 572 transition count 830
Iterating global reduction 4 with 16 rules applied. Total rules applied 554 place count 572 transition count 830
Free-agglomeration rule applied 482 times.
Iterating global reduction 4 with 482 rules applied. Total rules applied 1036 place count 572 transition count 348
Reduce places removed 482 places and 0 transitions.
Drop transitions removed 195 transitions
Reduce isomorphic transitions removed 195 transitions.
Iterating post reduction 4 with 677 rules applied. Total rules applied 1713 place count 90 transition count 153
Drop transitions removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 5 with 29 rules applied. Total rules applied 1742 place count 90 transition count 124
Graph (complete) has 242 edges and 90 vertex of which 35 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.2 ms
Discarding 55 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 1 rules applied. Total rules applied 1743 place count 35 transition count 124
Drop transitions removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Iterating post reduction 6 with 77 rules applied. Total rules applied 1820 place count 35 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1820 place count 35 transition count 46
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1822 place count 34 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1823 place count 33 transition count 45
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 25 edges and 32 vertex of which 8 / 32 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 1825 place count 28 transition count 45
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 1833 place count 28 transition count 37
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 5 Pre rules applied. Total rules applied 1833 place count 28 transition count 32
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 1843 place count 23 transition count 32
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1848 place count 23 transition count 27
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 10 with 14 rules applied. Total rules applied 1862 place count 16 transition count 20
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1863 place count 16 transition count 19
Free-agglomeration rule applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 1867 place count 16 transition count 15
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 11 rules applied. Total rules applied 1878 place count 9 transition count 11
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1879 place count 9 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1880 place count 8 transition count 10
Applied a total of 1880 rules in 242 ms. Remains 8 /909 variables (removed 901) and now considering 10/1214 (removed 1204) transitions.
Finished structural reductions, in 1 iterations. Remains : 8/909 places, 10/1214 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0) (NOT p2)))]
Knowledge based reduction with 9 factoid took 737 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1214/1214 transitions.
Applied a total of 0 rules in 24 ms. Remains 909 /909 variables (removed 0) and now considering 1214/1214 (removed 0) transitions.
// Phase 1: matrix 1214 rows 909 cols
[2022-05-15 20:05:28] [INFO ] Computed 18 place invariants in 12 ms
[2022-05-15 20:05:29] [INFO ] Implicit Places using invariants in 804 ms returned []
// Phase 1: matrix 1214 rows 909 cols
[2022-05-15 20:05:29] [INFO ] Computed 18 place invariants in 19 ms
[2022-05-15 20:05:31] [INFO ] Implicit Places using invariants and state equation in 1532 ms returned []
Implicit Place search using SMT with State Equation took 2339 ms to find 0 implicit places.
// Phase 1: matrix 1214 rows 909 cols
[2022-05-15 20:05:31] [INFO ] Computed 18 place invariants in 13 ms
[2022-05-15 20:05:32] [INFO ] Dead Transitions using invariants and state equation in 1332 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 909/909 places, 1214/1214 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 p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 342 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 87 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1214 rows 909 cols
[2022-05-15 20:05:33] [INFO ] Computed 18 place invariants in 20 ms
[2022-05-15 20:05:33] [INFO ] After 320ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-15 20:05:34] [INFO ] [Nat]Absence check using 18 positive place invariants in 22 ms returned sat
[2022-05-15 20:05:35] [INFO ] After 1015ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-15 20:05:35] [INFO ] After 1506ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 288 ms.
[2022-05-15 20:05:36] [INFO ] After 2235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 2 properties in 24 ms.
Support contains 3 out of 909 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 909/909 places, 1214/1214 transitions.
Graph (trivial) has 852 edges and 909 vertex of which 91 / 909 are part of one of the 15 SCC in 0 ms
Free SCC test removed 76 places
Drop transitions removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Drop transitions removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 77 place count 833 transition count 1046
Reduce places removed 76 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 77 rules applied. Total rules applied 154 place count 757 transition count 1045
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 155 place count 756 transition count 1045
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 155 place count 756 transition count 1008
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 229 place count 719 transition count 1008
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 258 place count 690 transition count 979
Iterating global reduction 3 with 29 rules applied. Total rules applied 287 place count 690 transition count 979
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 491 place count 588 transition count 877
Drop transitions removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 522 place count 588 transition count 846
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 538 place count 572 transition count 830
Iterating global reduction 4 with 16 rules applied. Total rules applied 554 place count 572 transition count 830
Free-agglomeration rule applied 482 times.
Iterating global reduction 4 with 482 rules applied. Total rules applied 1036 place count 572 transition count 348
Reduce places removed 482 places and 0 transitions.
Drop transitions removed 195 transitions
Reduce isomorphic transitions removed 195 transitions.
Iterating post reduction 4 with 677 rules applied. Total rules applied 1713 place count 90 transition count 153
Drop transitions removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 5 with 29 rules applied. Total rules applied 1742 place count 90 transition count 124
Graph (complete) has 242 edges and 90 vertex of which 35 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.0 ms
Discarding 55 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 1 rules applied. Total rules applied 1743 place count 35 transition count 124
Drop transitions removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Iterating post reduction 6 with 77 rules applied. Total rules applied 1820 place count 35 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1820 place count 35 transition count 46
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1822 place count 34 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1823 place count 33 transition count 45
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 25 edges and 32 vertex of which 8 / 32 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 1825 place count 28 transition count 45
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 1833 place count 28 transition count 37
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 5 Pre rules applied. Total rules applied 1833 place count 28 transition count 32
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 1843 place count 23 transition count 32
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1848 place count 23 transition count 27
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 10 with 14 rules applied. Total rules applied 1862 place count 16 transition count 20
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1863 place count 16 transition count 19
Free-agglomeration rule applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 1867 place count 16 transition count 15
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 11 rules applied. Total rules applied 1878 place count 9 transition count 11
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1879 place count 9 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1880 place count 8 transition count 10
Applied a total of 1880 rules in 253 ms. Remains 8 /909 variables (removed 901) and now considering 10/1214 (removed 1204) transitions.
Finished structural reductions, in 1 iterations. Remains : 8/909 places, 10/1214 transitions.
Finished random walk after 21 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0) (NOT p2)))]
Knowledge based reduction with 9 factoid took 734 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 891 reset in 445 ms.
Product exploration explored 100000 steps with 890 reset in 463 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 909 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 909/909 places, 1214/1214 transitions.
Graph (trivial) has 852 edges and 909 vertex of which 91 / 909 are part of one of the 15 SCC in 1 ms
Free SCC test removed 76 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 833 transition count 1137
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 63 place count 833 transition count 1138
Deduced a syphon composed of 111 places in 1 ms
Iterating global reduction 1 with 49 rules applied. Total rules applied 112 place count 833 transition count 1138
Discarding 74 places :
Symmetric choice reduction at 1 with 74 rule applications. Total rules 186 place count 759 transition count 1064
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 1 with 74 rules applied. Total rules applied 260 place count 759 transition count 1064
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 155 places in 1 ms
Iterating global reduction 1 with 89 rules applied. Total rules applied 349 place count 759 transition count 1096
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 387 place count 721 transition count 1058
Deduced a syphon composed of 117 places in 1 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 425 place count 721 transition count 1058
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 133 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 441 place count 721 transition count 1090
Deduced a syphon composed of 133 places in 0 ms
Drop transitions removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 1 with 31 rules applied. Total rules applied 472 place count 721 transition count 1059
Deduced a syphon composed of 133 places in 0 ms
Applied a total of 472 rules in 342 ms. Remains 721 /909 variables (removed 188) and now considering 1059/1214 (removed 155) transitions.
[2022-05-15 20:05:39] [INFO ] Redundant transitions in 30 ms returned []
[2022-05-15 20:05:39] [INFO ] Flow matrix only has 1029 transitions (discarded 30 similar events)
// Phase 1: matrix 1029 rows 721 cols
[2022-05-15 20:05:39] [INFO ] Computed 18 place invariants in 22 ms
[2022-05-15 20:05:40] [INFO ] Dead Transitions using invariants and state equation in 1311 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 721/909 places, 1059/1214 transitions.
Finished structural reductions, in 1 iterations. Remains : 721/909 places, 1059/1214 transitions.
Product exploration explored 100000 steps with 3864 reset in 1464 ms.
Product exploration explored 100000 steps with 3850 reset in 1471 ms.
Built C files in :
/tmp/ltsmin7364337440363263469
[2022-05-15 20:05:43] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7364337440363263469
Running compilation step : cd /tmp/ltsmin7364337440363263469;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7364337440363263469;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7364337440363263469;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1214/1214 transitions.
Applied a total of 0 rules in 26 ms. Remains 909 /909 variables (removed 0) and now considering 1214/1214 (removed 0) transitions.
// Phase 1: matrix 1214 rows 909 cols
[2022-05-15 20:05:46] [INFO ] Computed 18 place invariants in 12 ms
[2022-05-15 20:05:47] [INFO ] Implicit Places using invariants in 585 ms returned []
// Phase 1: matrix 1214 rows 909 cols
[2022-05-15 20:05:47] [INFO ] Computed 18 place invariants in 14 ms
[2022-05-15 20:05:49] [INFO ] Implicit Places using invariants and state equation in 1801 ms returned []
Implicit Place search using SMT with State Equation took 2387 ms to find 0 implicit places.
// Phase 1: matrix 1214 rows 909 cols
[2022-05-15 20:05:49] [INFO ] Computed 18 place invariants in 17 ms
[2022-05-15 20:05:50] [INFO ] Dead Transitions using invariants and state equation in 1302 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 909/909 places, 1214/1214 transitions.
Built C files in :
/tmp/ltsmin9039306374119702056
[2022-05-15 20:05:50] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9039306374119702056
Running compilation step : cd /tmp/ltsmin9039306374119702056;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9039306374119702056;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9039306374119702056;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 20:05:53] [INFO ] Flatten gal took : 54 ms
[2022-05-15 20:05:53] [INFO ] Flatten gal took : 49 ms
[2022-05-15 20:05:53] [INFO ] Time to serialize gal into /tmp/LTL13184442579097285468.gal : 11 ms
[2022-05-15 20:05:53] [INFO ] Time to serialize properties into /tmp/LTL708428511814061041.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13184442579097285468.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL708428511814061041.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1318444...266
Read 1 LTL properties
Checking formula 0 : !((X((G((F("(p2076==1)"))||("(p2446==0)")))||(G(X(F("(p1726==0)")))))))
Formula 0 simplified : !X(G("(p2446==0)" | F"(p2076==1)") | GXF"(p1726==0)")
Detected timeout of ITS tools.
[2022-05-15 20:06:08] [INFO ] Flatten gal took : 42 ms
[2022-05-15 20:06:08] [INFO ] Applying decomposition
[2022-05-15 20:06:08] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2534108392696966941.txt' '-o' '/tmp/graph2534108392696966941.bin' '-w' '/tmp/graph2534108392696966941.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2534108392696966941.bin' '-l' '-1' '-v' '-w' '/tmp/graph2534108392696966941.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:06:08] [INFO ] Decomposing Gal with order
[2022-05-15 20:06:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:06:09] [INFO ] Removed a total of 352 redundant transitions.
[2022-05-15 20:06:09] [INFO ] Flatten gal took : 246 ms
[2022-05-15 20:06:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 24 ms.
[2022-05-15 20:06:09] [INFO ] Time to serialize gal into /tmp/LTL13774448336417506209.gal : 38 ms
[2022-05-15 20:06:09] [INFO ] Time to serialize properties into /tmp/LTL11365371921378959619.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13774448336417506209.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11365371921378959619.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1377444...247
Read 1 LTL properties
Checking formula 0 : !((X((G((F("(i14.i1.i0.u144.p2076==1)"))||("(i17.u172.p2446==0)")))||(G(X(F("(i12.i0.i0.u124.p1726==0)")))))))
Formula 0 simplified : !X(G("(i17.u172.p2446==0)" | F"(i14.i1.i0.u144.p2076==1)") | GXF"(i12.i0.i0.u124.p1726==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15664450789798790749
[2022-05-15 20:06:24] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15664450789798790749
Running compilation step : cd /tmp/ltsmin15664450789798790749;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15664450789798790749;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15664450789798790749;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-13 finished in 68852 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(X(p0) U (G(p1)||p2))))'
Support contains 6 out of 959 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 959/959 places, 1279/1279 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 938 transition count 1258
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 938 transition count 1258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 938 transition count 1257
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 60 place count 921 transition count 1240
Iterating global reduction 1 with 17 rules applied. Total rules applied 77 place count 921 transition count 1240
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 86 place count 921 transition count 1231
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 93 place count 914 transition count 1224
Iterating global reduction 2 with 7 rules applied. Total rules applied 100 place count 914 transition count 1224
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 104 place count 914 transition count 1220
Applied a total of 104 rules in 118 ms. Remains 914 /959 variables (removed 45) and now considering 1220/1279 (removed 59) transitions.
// Phase 1: matrix 1220 rows 914 cols
[2022-05-15 20:06:27] [INFO ] Computed 18 place invariants in 13 ms
[2022-05-15 20:06:28] [INFO ] Implicit Places using invariants in 930 ms returned []
// Phase 1: matrix 1220 rows 914 cols
[2022-05-15 20:06:28] [INFO ] Computed 18 place invariants in 21 ms
[2022-05-15 20:06:30] [INFO ] Implicit Places using invariants and state equation in 1796 ms returned []
Implicit Place search using SMT with State Equation took 2729 ms to find 0 implicit places.
// Phase 1: matrix 1220 rows 914 cols
[2022-05-15 20:06:30] [INFO ] Computed 18 place invariants in 22 ms
[2022-05-15 20:06:31] [INFO ] Dead Transitions using invariants and state equation in 1672 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 914/959 places, 1220/1279 transitions.
Finished structural reductions, in 1 iterations. Remains : 914/959 places, 1220/1279 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR p2 p1), (OR (AND p0 p2) (AND p0 p1)), p1]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (OR (EQ s20 1) (EQ s682 1)) (EQ s803 1)), p1:(EQ s20 1), p0:(AND (EQ s98 1) (EQ s477 1) (EQ s838 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 50000 reset in 1168 ms.
Product exploration explored 100000 steps with 50000 reset in 1260 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 (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p2) (NOT p1) (NOT p0))
Knowledge based reduction with 13 factoid took 366 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-14 finished in 7455 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U X(G(X(p1)))))'
Support contains 2 out of 959 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 959/959 places, 1279/1279 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 935 transition count 1255
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 935 transition count 1255
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 935 transition count 1253
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 69 place count 916 transition count 1234
Iterating global reduction 1 with 19 rules applied. Total rules applied 88 place count 916 transition count 1234
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 97 place count 916 transition count 1225
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 105 place count 908 transition count 1217
Iterating global reduction 2 with 8 rules applied. Total rules applied 113 place count 908 transition count 1217
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 117 place count 908 transition count 1213
Applied a total of 117 rules in 195 ms. Remains 908 /959 variables (removed 51) and now considering 1213/1279 (removed 66) transitions.
// Phase 1: matrix 1213 rows 908 cols
[2022-05-15 20:06:35] [INFO ] Computed 18 place invariants in 21 ms
[2022-05-15 20:06:36] [INFO ] Implicit Places using invariants in 1043 ms returned []
// Phase 1: matrix 1213 rows 908 cols
[2022-05-15 20:06:36] [INFO ] Computed 18 place invariants in 21 ms
[2022-05-15 20:06:37] [INFO ] Implicit Places using invariants and state equation in 1552 ms returned []
Implicit Place search using SMT with State Equation took 2598 ms to find 0 implicit places.
// Phase 1: matrix 1213 rows 908 cols
[2022-05-15 20:06:37] [INFO ] Computed 18 place invariants in 12 ms
[2022-05-15 20:06:39] [INFO ] Dead Transitions using invariants and state equation in 1341 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 908/959 places, 1213/1279 transitions.
Finished structural reductions, in 1 iterations. Remains : 908/959 places, 1213/1279 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (NEQ s595 1) (EQ s303 1)), p0:(EQ s595 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 888 reset in 369 ms.
Product exploration explored 100000 steps with 891 reset in 423 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 p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 5 states, 9 edges and 2 AP to 5 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 89 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 163276 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 163276 steps, saw 81095 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1213 rows 908 cols
[2022-05-15 20:06:43] [INFO ] Computed 18 place invariants in 20 ms
[2022-05-15 20:06:44] [INFO ] [Real]Absence check using 18 positive place invariants in 19 ms returned sat
[2022-05-15 20:06:45] [INFO ] After 847ms SMT Verify possible using state equation in real domain returned unsat :1 sat :3
[2022-05-15 20:06:45] [INFO ] After 1169ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 209 ms.
[2022-05-15 20:06:45] [INFO ] After 1724ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 219 steps, including 2 resets, run visited all 3 properties in 13 ms. (steps per millisecond=16 )
Parikh walk visited 3 properties in 14 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 4 factoid took 333 ms. Reduced automaton from 5 states, 9 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 250 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 250 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Support contains 2 out of 908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 908/908 places, 1213/1213 transitions.
Applied a total of 0 rules in 39 ms. Remains 908 /908 variables (removed 0) and now considering 1213/1213 (removed 0) transitions.
// Phase 1: matrix 1213 rows 908 cols
[2022-05-15 20:06:46] [INFO ] Computed 18 place invariants in 21 ms
[2022-05-15 20:06:47] [INFO ] Implicit Places using invariants in 1043 ms returned []
// Phase 1: matrix 1213 rows 908 cols
[2022-05-15 20:06:47] [INFO ] Computed 18 place invariants in 23 ms
[2022-05-15 20:06:48] [INFO ] Implicit Places using invariants and state equation in 1467 ms returned []
Implicit Place search using SMT with State Equation took 2511 ms to find 0 implicit places.
// Phase 1: matrix 1213 rows 908 cols
[2022-05-15 20:06:49] [INFO ] Computed 18 place invariants in 16 ms
[2022-05-15 20:06:50] [INFO ] Dead Transitions using invariants and state equation in 1305 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 908/908 places, 1213/1213 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 p1 (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 88 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 216272 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 216272 steps, saw 94496 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1213 rows 908 cols
[2022-05-15 20:06:53] [INFO ] Computed 18 place invariants in 13 ms
[2022-05-15 20:06:53] [INFO ] [Real]Absence check using 18 positive place invariants in 21 ms returned sat
[2022-05-15 20:06:54] [INFO ] After 912ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-15 20:06:55] [INFO ] After 1155ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 142 ms.
[2022-05-15 20:06:55] [INFO ] After 1557ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 20:06:55] [INFO ] [Nat]Absence check using 18 positive place invariants in 22 ms returned sat
[2022-05-15 20:06:56] [INFO ] After 842ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 20:06:56] [INFO ] After 987ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 88 ms.
[2022-05-15 20:06:56] [INFO ] After 1405ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 79 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=26 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 251 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 889 reset in 474 ms.
Product exploration explored 100000 steps with 888 reset in 446 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Support contains 2 out of 908 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 908/908 places, 1213/1213 transitions.
Graph (trivial) has 853 edges and 908 vertex of which 91 / 908 are part of one of the 15 SCC in 0 ms
Free SCC test removed 76 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 832 transition count 1136
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 46 Pre rules applied. Total rules applied 64 place count 832 transition count 1136
Deduced a syphon composed of 109 places in 1 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 110 place count 832 transition count 1136
Discarding 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 182 place count 760 transition count 1064
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 1 with 72 rules applied. Total rules applied 254 place count 760 transition count 1064
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 255 place count 759 transition count 1063
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 256 place count 759 transition count 1063
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 156 places in 1 ms
Iterating global reduction 1 with 90 rules applied. Total rules applied 346 place count 759 transition count 1095
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 386 place count 719 transition count 1055
Deduced a syphon composed of 116 places in 0 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 426 place count 719 transition count 1055
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 133 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 443 place count 719 transition count 1090
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 444 place count 718 transition count 1088
Deduced a syphon composed of 132 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 445 place count 718 transition count 1088
Deduced a syphon composed of 132 places in 1 ms
Drop transitions removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 1 with 33 rules applied. Total rules applied 478 place count 718 transition count 1055
Deduced a syphon composed of 132 places in 0 ms
Applied a total of 478 rules in 303 ms. Remains 718 /908 variables (removed 190) and now considering 1055/1213 (removed 158) transitions.
[2022-05-15 20:06:59] [INFO ] Redundant transitions in 29 ms returned []
[2022-05-15 20:06:59] [INFO ] Flow matrix only has 1025 transitions (discarded 30 similar events)
// Phase 1: matrix 1025 rows 718 cols
[2022-05-15 20:06:59] [INFO ] Computed 18 place invariants in 22 ms
[2022-05-15 20:07:00] [INFO ] Dead Transitions using invariants and state equation in 1251 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 718/908 places, 1055/1213 transitions.
Finished structural reductions, in 1 iterations. Remains : 718/908 places, 1055/1213 transitions.
Product exploration explored 100000 steps with 3433 reset in 1062 ms.
Product exploration explored 100000 steps with 3452 reset in 1075 ms.
Built C files in :
/tmp/ltsmin8997987958776494878
[2022-05-15 20:07:02] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8997987958776494878
Running compilation step : cd /tmp/ltsmin8997987958776494878;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8997987958776494878;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8997987958776494878;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 908/908 places, 1213/1213 transitions.
Applied a total of 0 rules in 25 ms. Remains 908 /908 variables (removed 0) and now considering 1213/1213 (removed 0) transitions.
// Phase 1: matrix 1213 rows 908 cols
[2022-05-15 20:07:05] [INFO ] Computed 18 place invariants in 18 ms
[2022-05-15 20:07:06] [INFO ] Implicit Places using invariants in 791 ms returned []
// Phase 1: matrix 1213 rows 908 cols
[2022-05-15 20:07:06] [INFO ] Computed 18 place invariants in 21 ms
[2022-05-15 20:07:07] [INFO ] Implicit Places using invariants and state equation in 1506 ms returned []
Implicit Place search using SMT with State Equation took 2299 ms to find 0 implicit places.
// Phase 1: matrix 1213 rows 908 cols
[2022-05-15 20:07:07] [INFO ] Computed 18 place invariants in 12 ms
[2022-05-15 20:07:09] [INFO ] Dead Transitions using invariants and state equation in 1288 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 908/908 places, 1213/1213 transitions.
Built C files in :
/tmp/ltsmin8265843563690872677
[2022-05-15 20:07:09] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8265843563690872677
Running compilation step : cd /tmp/ltsmin8265843563690872677;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8265843563690872677;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8265843563690872677;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 20:07:12] [INFO ] Flatten gal took : 38 ms
[2022-05-15 20:07:12] [INFO ] Flatten gal took : 46 ms
[2022-05-15 20:07:12] [INFO ] Time to serialize gal into /tmp/LTL11077991875689194968.gal : 6 ms
[2022-05-15 20:07:12] [INFO ] Time to serialize properties into /tmp/LTL7261345573530527518.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11077991875689194968.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7261345573530527518.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1107799...267
Read 1 LTL properties
Checking formula 0 : !(((G(F("(p2104==1)")))U(X(G(X("((p2104!=1)||(p1049==1))"))))))
Formula 0 simplified : !(GF"(p2104==1)" U XGX"((p2104!=1)||(p1049==1))")
Detected timeout of ITS tools.
[2022-05-15 20:07:27] [INFO ] Flatten gal took : 35 ms
[2022-05-15 20:07:27] [INFO ] Applying decomposition
[2022-05-15 20:07:27] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph937274712654502237.txt' '-o' '/tmp/graph937274712654502237.bin' '-w' '/tmp/graph937274712654502237.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph937274712654502237.bin' '-l' '-1' '-v' '-w' '/tmp/graph937274712654502237.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:07:27] [INFO ] Decomposing Gal with order
[2022-05-15 20:07:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:07:27] [INFO ] Removed a total of 335 redundant transitions.
[2022-05-15 20:07:27] [INFO ] Flatten gal took : 177 ms
[2022-05-15 20:07:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 19 ms.
[2022-05-15 20:07:27] [INFO ] Time to serialize gal into /tmp/LTL7780418342377622900.gal : 16 ms
[2022-05-15 20:07:27] [INFO ] Time to serialize properties into /tmp/LTL9427888154536287489.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7780418342377622900.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9427888154536287489.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7780418...245
Read 1 LTL properties
Checking formula 0 : !(((G(F("(i17.u158.p2104==1)")))U(X(G(X("((i17.u158.p2104!=1)||(i9.u71.p1049==1))"))))))
Formula 0 simplified : !(GF"(i17.u158.p2104==1)" U XGX"((i17.u158.p2104!=1)||(i9.u71.p1049==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10957284458672141074
[2022-05-15 20:07:43] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10957284458672141074
Running compilation step : cd /tmp/ltsmin10957284458672141074;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10957284458672141074;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10957284458672141074;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-15 finished in 71097 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U X(p1)) U (X(G(X(p2)))||F(X(G(p0))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p0)||p1))||G(X(F(p2))))))'
Found a SL insensitive property : FlexibleBarrier-PT-16b-LTLFireability-13
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 959 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 959/959 places, 1279/1279 transitions.
Graph (trivial) has 902 edges and 959 vertex of which 91 / 959 are part of one of the 15 SCC in 1 ms
Free SCC test removed 76 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 882 transition count 1115
Reduce places removed 86 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 87 rules applied. Total rules applied 174 place count 796 transition count 1114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 175 place count 795 transition count 1114
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 175 place count 795 transition count 1072
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 259 place count 753 transition count 1072
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 309 place count 703 transition count 1022
Iterating global reduction 3 with 50 rules applied. Total rules applied 359 place count 703 transition count 1022
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 361 place count 703 transition count 1020
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 361 place count 703 transition count 1019
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 363 place count 702 transition count 1019
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 374 place count 691 transition count 1008
Iterating global reduction 4 with 11 rules applied. Total rules applied 385 place count 691 transition count 1008
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 396 place count 691 transition count 997
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 5 with 200 rules applied. Total rules applied 596 place count 591 transition count 897
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 598 place count 589 transition count 895
Iterating global reduction 5 with 2 rules applied. Total rules applied 600 place count 589 transition count 895
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 602 place count 589 transition count 893
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 617 place count 589 transition count 878
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 619 place count 587 transition count 876
Applied a total of 619 rules in 289 ms. Remains 587 /959 variables (removed 372) and now considering 876/1279 (removed 403) transitions.
[2022-05-15 20:07:46] [INFO ] Flow matrix only has 846 transitions (discarded 30 similar events)
// Phase 1: matrix 846 rows 587 cols
[2022-05-15 20:07:46] [INFO ] Computed 18 place invariants in 20 ms
[2022-05-15 20:07:47] [INFO ] Implicit Places using invariants in 936 ms returned []
[2022-05-15 20:07:47] [INFO ] Flow matrix only has 846 transitions (discarded 30 similar events)
// Phase 1: matrix 846 rows 587 cols
[2022-05-15 20:07:47] [INFO ] Computed 18 place invariants in 20 ms
[2022-05-15 20:07:48] [INFO ] Implicit Places using invariants and state equation in 1334 ms returned []
Implicit Place search using SMT with State Equation took 2272 ms to find 0 implicit places.
[2022-05-15 20:07:48] [INFO ] Flow matrix only has 846 transitions (discarded 30 similar events)
// Phase 1: matrix 846 rows 587 cols
[2022-05-15 20:07:48] [INFO ] Computed 18 place invariants in 12 ms
[2022-05-15 20:07:49] [INFO ] Dead Transitions using invariants and state equation in 817 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 587/959 places, 876/1279 transitions.
Finished structural reductions, in 1 iterations. Remains : 587/959 places, 876/1279 transitions.
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s382 0), p0:(EQ s310 1), p2:(EQ s248 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4367 reset in 1179 ms.
Product exploration explored 100000 steps with 4386 reset in 1094 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 : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 8 factoid took 380 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 447 resets, run finished after 619 ms. (steps per millisecond=16 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-05-15 20:07:53] [INFO ] Flow matrix only has 846 transitions (discarded 30 similar events)
// Phase 1: matrix 846 rows 587 cols
[2022-05-15 20:07:53] [INFO ] Computed 18 place invariants in 12 ms
[2022-05-15 20:07:53] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-15 20:07:53] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2022-05-15 20:07:54] [INFO ] After 669ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-15 20:07:54] [INFO ] After 975ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 186 ms.
[2022-05-15 20:07:55] [INFO ] After 1345ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 587 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 587/587 places, 876/876 transitions.
Drop transitions removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 587 transition count 845
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 47 place count 571 transition count 829
Iterating global reduction 1 with 16 rules applied. Total rules applied 63 place count 571 transition count 829
Free-agglomeration rule applied 482 times.
Iterating global reduction 1 with 482 rules applied. Total rules applied 545 place count 571 transition count 347
Reduce places removed 483 places and 0 transitions.
Drop transitions removed 195 transitions
Reduce isomorphic transitions removed 195 transitions.
Graph (trivial) has 81 edges and 88 vertex of which 30 / 88 are part of one of the 15 SCC in 0 ms
Free SCC test removed 15 places
Iterating post reduction 1 with 679 rules applied. Total rules applied 1224 place count 73 transition count 152
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 1254 place count 73 transition count 122
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 1254 place count 73 transition count 106
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 1286 place count 57 transition count 106
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 1302 place count 57 transition count 90
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 1338 place count 39 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1339 place count 39 transition count 71
Drop transitions removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 5 with 29 rules applied. Total rules applied 1368 place count 39 transition count 42
Graph (complete) has 63 edges and 39 vertex of which 17 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Iterating post reduction 5 with 1 rules applied. Total rules applied 1369 place count 17 transition count 31
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1380 place count 17 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1380 place count 17 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1382 place count 16 transition count 19
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1386 place count 16 transition count 15
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1397 place count 9 transition count 11
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1398 place count 9 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1399 place count 8 transition count 10
Applied a total of 1399 rules in 141 ms. Remains 8 /587 variables (removed 579) and now considering 10/876 (removed 866) transitions.
Finished structural reductions, in 1 iterations. Remains : 8/587 places, 10/876 transitions.
Finished random walk after 24 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) (NOT p2))), (F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0) (NOT p2)))]
Knowledge based reduction with 8 factoid took 672 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 587 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 587/587 places, 876/876 transitions.
Applied a total of 0 rules in 18 ms. Remains 587 /587 variables (removed 0) and now considering 876/876 (removed 0) transitions.
[2022-05-15 20:07:56] [INFO ] Flow matrix only has 846 transitions (discarded 30 similar events)
// Phase 1: matrix 846 rows 587 cols
[2022-05-15 20:07:56] [INFO ] Computed 18 place invariants in 13 ms
[2022-05-15 20:07:56] [INFO ] Implicit Places using invariants in 665 ms returned []
[2022-05-15 20:07:56] [INFO ] Flow matrix only has 846 transitions (discarded 30 similar events)
// Phase 1: matrix 846 rows 587 cols
[2022-05-15 20:07:56] [INFO ] Computed 18 place invariants in 20 ms
[2022-05-15 20:07:57] [INFO ] Implicit Places using invariants and state equation in 1057 ms returned []
Implicit Place search using SMT with State Equation took 1726 ms to find 0 implicit places.
[2022-05-15 20:07:57] [INFO ] Flow matrix only has 846 transitions (discarded 30 similar events)
// Phase 1: matrix 846 rows 587 cols
[2022-05-15 20:07:57] [INFO ] Computed 18 place invariants in 13 ms
[2022-05-15 20:07:58] [INFO ] Dead Transitions using invariants and state equation in 763 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 587/587 places, 876/876 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 : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 8 factoid took 626 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 442 resets, run finished after 522 ms. (steps per millisecond=19 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-05-15 20:08:00] [INFO ] Flow matrix only has 846 transitions (discarded 30 similar events)
// Phase 1: matrix 846 rows 587 cols
[2022-05-15 20:08:00] [INFO ] Computed 18 place invariants in 20 ms
[2022-05-15 20:08:00] [INFO ] After 200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-15 20:08:00] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2022-05-15 20:08:01] [INFO ] After 641ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-15 20:08:01] [INFO ] After 837ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 118 ms.
[2022-05-15 20:08:01] [INFO ] After 1238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 587 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 587/587 places, 876/876 transitions.
Drop transitions removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 587 transition count 845
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 47 place count 571 transition count 829
Iterating global reduction 1 with 16 rules applied. Total rules applied 63 place count 571 transition count 829
Free-agglomeration rule applied 482 times.
Iterating global reduction 1 with 482 rules applied. Total rules applied 545 place count 571 transition count 347
Reduce places removed 483 places and 0 transitions.
Drop transitions removed 195 transitions
Reduce isomorphic transitions removed 195 transitions.
Graph (trivial) has 81 edges and 88 vertex of which 30 / 88 are part of one of the 15 SCC in 0 ms
Free SCC test removed 15 places
Iterating post reduction 1 with 679 rules applied. Total rules applied 1224 place count 73 transition count 152
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 1254 place count 73 transition count 122
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 1254 place count 73 transition count 106
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 1286 place count 57 transition count 106
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 1302 place count 57 transition count 90
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 1338 place count 39 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1339 place count 39 transition count 71
Drop transitions removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 5 with 29 rules applied. Total rules applied 1368 place count 39 transition count 42
Graph (complete) has 63 edges and 39 vertex of which 17 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Iterating post reduction 5 with 1 rules applied. Total rules applied 1369 place count 17 transition count 31
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1380 place count 17 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1380 place count 17 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1382 place count 16 transition count 19
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1386 place count 16 transition count 15
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1397 place count 9 transition count 11
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1398 place count 9 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1399 place count 8 transition count 10
Applied a total of 1399 rules in 95 ms. Remains 8 /587 variables (removed 579) and now considering 10/876 (removed 866) transitions.
Finished structural reductions, in 1 iterations. Remains : 8/587 places, 10/876 transitions.
Finished random walk after 29 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) (NOT p2))), (F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0) (NOT p2)))]
Knowledge based reduction with 8 factoid took 612 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 4366 reset in 982 ms.
Product exploration explored 100000 steps with 4361 reset in 933 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 587 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 587/587 places, 876/876 transitions.
Applied a total of 0 rules in 45 ms. Remains 587 /587 variables (removed 0) and now considering 876/876 (removed 0) transitions.
[2022-05-15 20:08:05] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-15 20:08:05] [INFO ] Flow matrix only has 846 transitions (discarded 30 similar events)
// Phase 1: matrix 846 rows 587 cols
[2022-05-15 20:08:05] [INFO ] Computed 18 place invariants in 11 ms
[2022-05-15 20:08:06] [INFO ] Dead Transitions using invariants and state equation in 985 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 587/587 places, 876/876 transitions.
Product exploration explored 100000 steps with 4368 reset in 1442 ms.
Product exploration explored 100000 steps with 4361 reset in 1179 ms.
Built C files in :
/tmp/ltsmin5405824162986849684
[2022-05-15 20:08:08] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5405824162986849684
Running compilation step : cd /tmp/ltsmin5405824162986849684;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2348 ms.
Running link step : cd /tmp/ltsmin5405824162986849684;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin5405824162986849684;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased305283376631246251.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 587 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 587/587 places, 876/876 transitions.
Applied a total of 0 rules in 11 ms. Remains 587 /587 variables (removed 0) and now considering 876/876 (removed 0) transitions.
[2022-05-15 20:08:23] [INFO ] Flow matrix only has 846 transitions (discarded 30 similar events)
// Phase 1: matrix 846 rows 587 cols
[2022-05-15 20:08:23] [INFO ] Computed 18 place invariants in 12 ms
[2022-05-15 20:08:24] [INFO ] Implicit Places using invariants in 673 ms returned []
[2022-05-15 20:08:24] [INFO ] Flow matrix only has 846 transitions (discarded 30 similar events)
// Phase 1: matrix 846 rows 587 cols
[2022-05-15 20:08:24] [INFO ] Computed 18 place invariants in 19 ms
[2022-05-15 20:08:26] [INFO ] Implicit Places using invariants and state equation in 1360 ms returned []
Implicit Place search using SMT with State Equation took 2036 ms to find 0 implicit places.
[2022-05-15 20:08:26] [INFO ] Flow matrix only has 846 transitions (discarded 30 similar events)
// Phase 1: matrix 846 rows 587 cols
[2022-05-15 20:08:26] [INFO ] Computed 18 place invariants in 21 ms
[2022-05-15 20:08:26] [INFO ] Dead Transitions using invariants and state equation in 879 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 587/587 places, 876/876 transitions.
Built C files in :
/tmp/ltsmin13178861093985976939
[2022-05-15 20:08:26] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13178861093985976939
Running compilation step : cd /tmp/ltsmin13178861093985976939;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2195 ms.
Running link step : cd /tmp/ltsmin13178861093985976939;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13178861093985976939;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5860474131616342443.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 20:08:42] [INFO ] Flatten gal took : 27 ms
[2022-05-15 20:08:42] [INFO ] Flatten gal took : 28 ms
[2022-05-15 20:08:42] [INFO ] Time to serialize gal into /tmp/LTL3087960241193358394.gal : 5 ms
[2022-05-15 20:08:42] [INFO ] Time to serialize properties into /tmp/LTL10288243734813144195.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3087960241193358394.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10288243734813144195.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3087960...267
Read 1 LTL properties
Checking formula 0 : !((X((G((F("(p2076==1)"))||("(p2446==0)")))||(G(X(F("(p1726==0)")))))))
Formula 0 simplified : !X(G("(p2446==0)" | F"(p2076==1)") | GXF"(p1726==0)")
Detected timeout of ITS tools.
[2022-05-15 20:08:57] [INFO ] Flatten gal took : 27 ms
[2022-05-15 20:08:57] [INFO ] Applying decomposition
[2022-05-15 20:08:57] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph227896839830501475.txt' '-o' '/tmp/graph227896839830501475.bin' '-w' '/tmp/graph227896839830501475.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph227896839830501475.bin' '-l' '-1' '-v' '-w' '/tmp/graph227896839830501475.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:08:57] [INFO ] Decomposing Gal with order
[2022-05-15 20:08:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:08:57] [INFO ] Removed a total of 357 redundant transitions.
[2022-05-15 20:08:57] [INFO ] Flatten gal took : 176 ms
[2022-05-15 20:08:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 29 ms.
[2022-05-15 20:08:57] [INFO ] Time to serialize gal into /tmp/LTL13271183997094110049.gal : 9 ms
[2022-05-15 20:08:57] [INFO ] Time to serialize properties into /tmp/LTL16363965244582990585.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13271183997094110049.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16363965244582990585.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1327118...247
Read 1 LTL properties
Checking formula 0 : !((X((G((F("(i13.u42.p2076==1)"))||("(i10.u50.p2446==0)")))||(G(X(F("(i11.u35.p1726==0)")))))))
Formula 0 simplified : !X(G("(i10.u50.p2446==0)" | F"(i13.u42.p2076==1)") | GXF"(i11.u35.p1726==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13451322505774446941
[2022-05-15 20:09:12] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13451322505774446941
Running compilation step : cd /tmp/ltsmin13451322505774446941;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2306 ms.
Running link step : cd /tmp/ltsmin13451322505774446941;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13451322505774446941;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((<>((LTLAPp0==true))||(LTLAPp1==true)))||[](X(<>((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-13 finished in 101597 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U X(G(X(p1)))))'
Found a SL insensitive property : FlexibleBarrier-PT-16b-LTLFireability-15
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 2 out of 959 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 959/959 places, 1279/1279 transitions.
Graph (trivial) has 904 edges and 959 vertex of which 91 / 959 are part of one of the 15 SCC in 1 ms
Free SCC test removed 76 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 882 transition count 1113
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 177 place count 794 transition count 1113
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 177 place count 794 transition count 1074
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 255 place count 755 transition count 1074
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 306 place count 704 transition count 1023
Iterating global reduction 2 with 51 rules applied. Total rules applied 357 place count 704 transition count 1023
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 359 place count 704 transition count 1021
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 359 place count 704 transition count 1020
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 361 place count 703 transition count 1020
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 372 place count 692 transition count 1009
Iterating global reduction 3 with 11 rules applied. Total rules applied 383 place count 692 transition count 1009
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 393 place count 692 transition count 999
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 595 place count 591 transition count 898
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 598 place count 588 transition count 895
Iterating global reduction 4 with 3 rules applied. Total rules applied 601 place count 588 transition count 895
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 604 place count 588 transition count 892
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 606 place count 587 transition count 892
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 623 place count 587 transition count 875
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 625 place count 585 transition count 873
Applied a total of 625 rules in 227 ms. Remains 585 /959 variables (removed 374) and now considering 873/1279 (removed 406) transitions.
[2022-05-15 20:09:28] [INFO ] Flow matrix only has 843 transitions (discarded 30 similar events)
// Phase 1: matrix 843 rows 585 cols
[2022-05-15 20:09:28] [INFO ] Computed 18 place invariants in 14 ms
[2022-05-15 20:09:28] [INFO ] Implicit Places using invariants in 671 ms returned []
[2022-05-15 20:09:28] [INFO ] Flow matrix only has 843 transitions (discarded 30 similar events)
// Phase 1: matrix 843 rows 585 cols
[2022-05-15 20:09:29] [INFO ] Computed 18 place invariants in 13 ms
[2022-05-15 20:09:30] [INFO ] Implicit Places using invariants and state equation in 1044 ms returned []
Implicit Place search using SMT with State Equation took 1726 ms to find 0 implicit places.
[2022-05-15 20:09:30] [INFO ] Flow matrix only has 843 transitions (discarded 30 similar events)
// Phase 1: matrix 843 rows 585 cols
[2022-05-15 20:09:30] [INFO ] Computed 18 place invariants in 12 ms
[2022-05-15 20:09:30] [INFO ] Dead Transitions using invariants and state equation in 731 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 585/959 places, 873/1279 transitions.
Finished structural reductions, in 1 iterations. Remains : 585/959 places, 873/1279 transitions.
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (NEQ s311 1) (EQ s156 1)), p0:(EQ s311 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4156 reset in 1001 ms.
Product exploration explored 100000 steps with 4177 reset in 900 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 : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 233 ms. Reduced automaton from 5 states, 9 edges and 2 AP to 5 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 428 resets, run finished after 493 ms. (steps per millisecond=20 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 267919 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 267919 steps, saw 71041 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 4 properties.
[2022-05-15 20:09:36] [INFO ] Flow matrix only has 843 transitions (discarded 30 similar events)
// Phase 1: matrix 843 rows 585 cols
[2022-05-15 20:09:36] [INFO ] Computed 18 place invariants in 12 ms
[2022-05-15 20:09:36] [INFO ] [Real]Absence check using 18 positive place invariants in 10 ms returned sat
[2022-05-15 20:09:37] [INFO ] After 583ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2022-05-15 20:09:37] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2022-05-15 20:09:38] [INFO ] After 467ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2022-05-15 20:09:38] [INFO ] After 632ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 99 ms.
[2022-05-15 20:09:38] [INFO ] After 936ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 585 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 585/585 places, 873/873 transitions.
Drop transitions removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 585 transition count 842
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 47 place count 569 transition count 826
Iterating global reduction 1 with 16 rules applied. Total rules applied 63 place count 569 transition count 826
Free-agglomeration rule applied 482 times.
Iterating global reduction 1 with 482 rules applied. Total rules applied 545 place count 569 transition count 344
Reduce places removed 484 places and 0 transitions.
Drop transitions removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Graph (trivial) has 113 edges and 85 vertex of which 77 / 85 are part of one of the 16 SCC in 0 ms
Free SCC test removed 61 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 1 with 682 rules applied. Total rules applied 1227 place count 24 transition count 147
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 107 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 133 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 149 rules applied. Total rules applied 1376 place count 9 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 1379 place count 8 transition count 11
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1381 place count 7 transition count 10
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1384 place count 7 transition count 7
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 1 rules applied. Total rules applied 1385 place count 7 transition count 6
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 1387 place count 6 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1388 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1388 place count 5 transition count 4
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 1390 place count 4 transition count 4
Applied a total of 1390 rules in 92 ms. Remains 4 /585 variables (removed 581) and now considering 4/873 (removed 869) transitions.
Finished structural reductions, in 1 iterations. Remains : 4/585 places, 4/873 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=5 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 4 factoid took 379 ms. Reduced automaton from 5 states, 9 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Support contains 2 out of 585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 585/585 places, 873/873 transitions.
Applied a total of 0 rules in 11 ms. Remains 585 /585 variables (removed 0) and now considering 873/873 (removed 0) transitions.
[2022-05-15 20:09:39] [INFO ] Flow matrix only has 843 transitions (discarded 30 similar events)
// Phase 1: matrix 843 rows 585 cols
[2022-05-15 20:09:39] [INFO ] Computed 18 place invariants in 12 ms
[2022-05-15 20:09:39] [INFO ] Implicit Places using invariants in 600 ms returned []
[2022-05-15 20:09:39] [INFO ] Flow matrix only has 843 transitions (discarded 30 similar events)
// Phase 1: matrix 843 rows 585 cols
[2022-05-15 20:09:39] [INFO ] Computed 18 place invariants in 12 ms
[2022-05-15 20:09:41] [INFO ] Implicit Places using invariants and state equation in 1214 ms returned []
Implicit Place search using SMT with State Equation took 1816 ms to find 0 implicit places.
[2022-05-15 20:09:41] [INFO ] Flow matrix only has 843 transitions (discarded 30 similar events)
// Phase 1: matrix 843 rows 585 cols
[2022-05-15 20:09:41] [INFO ] Computed 18 place invariants in 19 ms
[2022-05-15 20:09:42] [INFO ] Dead Transitions using invariants and state equation in 998 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 585/585 places, 873/873 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 : [(AND p1 (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 429 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 292364 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 292364 steps, saw 77377 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-15 20:09:45] [INFO ] Flow matrix only has 843 transitions (discarded 30 similar events)
// Phase 1: matrix 843 rows 585 cols
[2022-05-15 20:09:45] [INFO ] Computed 18 place invariants in 12 ms
[2022-05-15 20:09:45] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2022-05-15 20:09:46] [INFO ] After 702ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 20:09:46] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2022-05-15 20:09:47] [INFO ] After 590ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 20:09:47] [INFO ] After 752ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 113 ms.
[2022-05-15 20:09:47] [INFO ] After 1091ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 585 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 585/585 places, 873/873 transitions.
Drop transitions removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 585 transition count 842
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 47 place count 569 transition count 826
Iterating global reduction 1 with 16 rules applied. Total rules applied 63 place count 569 transition count 826
Free-agglomeration rule applied 482 times.
Iterating global reduction 1 with 482 rules applied. Total rules applied 545 place count 569 transition count 344
Reduce places removed 484 places and 0 transitions.
Drop transitions removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Graph (trivial) has 113 edges and 85 vertex of which 77 / 85 are part of one of the 16 SCC in 0 ms
Free SCC test removed 61 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 1 with 682 rules applied. Total rules applied 1227 place count 24 transition count 147
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 107 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 133 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 149 rules applied. Total rules applied 1376 place count 9 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 1379 place count 8 transition count 11
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1381 place count 7 transition count 10
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1384 place count 7 transition count 7
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 1 rules applied. Total rules applied 1385 place count 7 transition count 6
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 1387 place count 6 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1388 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1388 place count 5 transition count 4
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 1390 place count 4 transition count 4
Applied a total of 1390 rules in 121 ms. Remains 4 /585 variables (removed 581) and now considering 4/873 (removed 869) transitions.
Finished structural reductions, in 1 iterations. Remains : 4/585 places, 4/873 transitions.
Finished random walk after 11 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 2 factoid took 180 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 242 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4174 reset in 977 ms.
Product exploration explored 100000 steps with 4153 reset in 1160 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Support contains 2 out of 585 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 585/585 places, 873/873 transitions.
Applied a total of 0 rules in 72 ms. Remains 585 /585 variables (removed 0) and now considering 873/873 (removed 0) transitions.
[2022-05-15 20:09:51] [INFO ] Redundant transitions in 20 ms returned []
[2022-05-15 20:09:51] [INFO ] Flow matrix only has 843 transitions (discarded 30 similar events)
// Phase 1: matrix 843 rows 585 cols
[2022-05-15 20:09:51] [INFO ] Computed 18 place invariants in 20 ms
[2022-05-15 20:09:51] [INFO ] Dead Transitions using invariants and state equation in 775 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 585/585 places, 873/873 transitions.
Product exploration explored 100000 steps with 4152 reset in 1369 ms.
Product exploration explored 100000 steps with 4164 reset in 1402 ms.
Built C files in :
/tmp/ltsmin524340267691434601
[2022-05-15 20:09:54] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin524340267691434601
Running compilation step : cd /tmp/ltsmin524340267691434601;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2168 ms.
Running link step : cd /tmp/ltsmin524340267691434601;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin524340267691434601;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16407659127534381549.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 585/585 places, 873/873 transitions.
Applied a total of 0 rules in 12 ms. Remains 585 /585 variables (removed 0) and now considering 873/873 (removed 0) transitions.
[2022-05-15 20:10:09] [INFO ] Flow matrix only has 843 transitions (discarded 30 similar events)
// Phase 1: matrix 843 rows 585 cols
[2022-05-15 20:10:09] [INFO ] Computed 18 place invariants in 11 ms
[2022-05-15 20:10:10] [INFO ] Implicit Places using invariants in 723 ms returned []
[2022-05-15 20:10:10] [INFO ] Flow matrix only has 843 transitions (discarded 30 similar events)
// Phase 1: matrix 843 rows 585 cols
[2022-05-15 20:10:10] [INFO ] Computed 18 place invariants in 15 ms
[2022-05-15 20:10:11] [INFO ] Implicit Places using invariants and state equation in 1228 ms returned []
Implicit Place search using SMT with State Equation took 1954 ms to find 0 implicit places.
[2022-05-15 20:10:11] [INFO ] Flow matrix only has 843 transitions (discarded 30 similar events)
// Phase 1: matrix 843 rows 585 cols
[2022-05-15 20:10:11] [INFO ] Computed 18 place invariants in 22 ms
[2022-05-15 20:10:12] [INFO ] Dead Transitions using invariants and state equation in 1019 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 585/585 places, 873/873 transitions.
Built C files in :
/tmp/ltsmin10571800335448423898
[2022-05-15 20:10:12] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10571800335448423898
Running compilation step : cd /tmp/ltsmin10571800335448423898;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2124 ms.
Running link step : cd /tmp/ltsmin10571800335448423898;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin10571800335448423898;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12049066994593963833.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 20:10:27] [INFO ] Flatten gal took : 31 ms
[2022-05-15 20:10:27] [INFO ] Flatten gal took : 30 ms
[2022-05-15 20:10:27] [INFO ] Time to serialize gal into /tmp/LTL328509516133835282.gal : 5 ms
[2022-05-15 20:10:27] [INFO ] Time to serialize properties into /tmp/LTL13193141241224236773.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL328509516133835282.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13193141241224236773.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3285095...266
Read 1 LTL properties
Checking formula 0 : !(((G(F("(p2104==1)")))U(X(G(X("((p2104!=1)||(p1049==1))"))))))
Formula 0 simplified : !(GF"(p2104==1)" U XGX"((p2104!=1)||(p1049==1))")
Detected timeout of ITS tools.
[2022-05-15 20:10:42] [INFO ] Flatten gal took : 27 ms
[2022-05-15 20:10:42] [INFO ] Applying decomposition
[2022-05-15 20:10:42] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14472065994481024942.txt' '-o' '/tmp/graph14472065994481024942.bin' '-w' '/tmp/graph14472065994481024942.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14472065994481024942.bin' '-l' '-1' '-v' '-w' '/tmp/graph14472065994481024942.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:10:43] [INFO ] Decomposing Gal with order
[2022-05-15 20:10:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:10:43] [INFO ] Removed a total of 353 redundant transitions.
[2022-05-15 20:10:43] [INFO ] Flatten gal took : 182 ms
[2022-05-15 20:10:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 18 ms.
[2022-05-15 20:10:43] [INFO ] Time to serialize gal into /tmp/LTL12336661263450921478.gal : 23 ms
[2022-05-15 20:10:43] [INFO ] Time to serialize properties into /tmp/LTL7260857142950560384.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12336661263450921478.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7260857142950560384.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1233666...246
Read 1 LTL properties
Checking formula 0 : !(((G(F("(i14.u42.p2104==1)")))U(X(G(X("((i14.u42.p2104!=1)||(i6.u18.p1049==1))"))))))
Formula 0 simplified : !(GF"(i14.u42.p2104==1)" U XGX"((i14.u42.p2104!=1)||(i6.u18.p1049==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12534160432381997451
[2022-05-15 20:10:58] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12534160432381997451
Running compilation step : cd /tmp/ltsmin12534160432381997451;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2535 ms.
Running link step : cd /tmp/ltsmin12534160432381997451;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin12534160432381997451;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>((LTLAPp0==true))) U X([](X((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-15 finished in 105621 ms.
[2022-05-15 20:11:13] [INFO ] Flatten gal took : 31 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15497787295165304390
[2022-05-15 20:11:13] [INFO ] Computing symmetric may disable matrix : 1279 transitions.
[2022-05-15 20:11:13] [INFO ] Applying decomposition
[2022-05-15 20:11:13] [INFO ] Computation of Complete disable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 20:11:13] [INFO ] Computing symmetric may enable matrix : 1279 transitions.
[2022-05-15 20:11:13] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 20:11:13] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4103057429539074129.txt' '-o' '/tmp/graph4103057429539074129.bin' '-w' '/tmp/graph4103057429539074129.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4103057429539074129.bin' '-l' '-1' '-v' '-w' '/tmp/graph4103057429539074129.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:11:13] [INFO ] Decomposing Gal with order
[2022-05-15 20:11:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:11:13] [INFO ] Computing Do-Not-Accords matrix : 1279 transitions.
[2022-05-15 20:11:13] [INFO ] Removed a total of 381 redundant transitions.
[2022-05-15 20:11:13] [INFO ] Flatten gal took : 170 ms
[2022-05-15 20:11:13] [INFO ] Computation of Completed DNA matrix. took 113 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 20:11:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 22 ms.
[2022-05-15 20:11:13] [INFO ] Built C files in 480ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15497787295165304390
Running compilation step : cd /tmp/ltsmin15497787295165304390;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-15 20:11:13] [INFO ] Time to serialize gal into /tmp/LTLFireability7990394195463474326.gal : 21 ms
[2022-05-15 20:11:13] [INFO ] Time to serialize properties into /tmp/LTLFireability9024840335918260377.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7990394195463474326.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9024840335918260377.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 3 LTL properties
Checking formula 0 : !(((!(("(i11.i1.i2.u105.p1385==1)")U(X("((i2.i0.i3.u65.p885==1)&&(i19.u188.p3457==1))"))))U((X(G(X("(i9.i0.i1.u91.p1192==1)"))))||(F(X...192
Formula 0 simplified : !(!("(i11.i1.i2.u105.p1385==1)" U X"((i2.i0.i3.u65.p885==1)&&(i19.u188.p3457==1))") U (XGX"(i9.i0.i1.u91.p1192==1)" | FXG"(i11.i1.i2...173
Compilation finished in 6713 ms.
Running link step : cd /tmp/ltsmin15497787295165304390;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin15497787295165304390;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!((LTLAPp0==true) U X((LTLAPp1==true))) U (X([](X((LTLAPp2==true))))||<>(X([]((LTLAPp0==true))))))' '--buchi-type=spotba'
LTSmin run took 1119 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin15497787295165304390;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((<>((LTLAPp3==true))||(LTLAPp4==true)))||[](X(<>((LTLAPp5==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin15497787295165304390;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((<>((LTLAPp3==true))||(LTLAPp4==true)))||[](X(<>((LTLAPp5==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15497787295165304390;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>((LTLAPp6==true))) U X([](X((LTLAPp7==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 20:34:19] [INFO ] Applying decomposition
[2022-05-15 20:34:19] [INFO ] Flatten gal took : 102 ms
[2022-05-15 20:34:19] [INFO ] Decomposing Gal with order
[2022-05-15 20:34:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:34:19] [INFO ] Removed a total of 337 redundant transitions.
[2022-05-15 20:34:19] [INFO ] Flatten gal took : 461 ms
[2022-05-15 20:34:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 1029 labels/synchronizations in 295 ms.
[2022-05-15 20:34:20] [INFO ] Time to serialize gal into /tmp/LTLFireability15570907806012332817.gal : 27 ms
[2022-05-15 20:34:20] [INFO ] Time to serialize properties into /tmp/LTLFireability11048516805396472662.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15570907806012332817.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11048516805396472662.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 2 LTL properties
Checking formula 0 : !((X((G((F("(i0.i0.i0.u29.p2076==1)"))||("(i1.u33.p2446==0)")))||(G(X(F("(i0.i0.i0.i0.i0.u27.p1726==0)")))))))
Formula 0 simplified : !X(G("(i1.u33.p2446==0)" | F"(i0.i0.i0.u29.p2076==1)") | GXF"(i0.i0.i0.i0.i0.u27.p1726==0)")
LTSmin run took 555486 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin15497787295165304390;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((<>((LTLAPp3==true))||(LTLAPp4==true)))||[](X(<>((LTLAPp5==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 20:57:26] [INFO ] Flatten gal took : 115 ms
[2022-05-15 20:57:26] [INFO ] Input system was already deterministic with 1279 transitions.
[2022-05-15 20:57:26] [INFO ] Transformed 959 places.
[2022-05-15 20:57:26] [INFO ] Transformed 1279 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-15 20:57:27] [INFO ] Time to serialize gal into /tmp/LTLFireability8441494286815111782.gal : 46 ms
[2022-05-15 20:57:27] [INFO ] Time to serialize properties into /tmp/LTLFireability684125511865097728.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8441494286815111782.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability684125511865097728.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...332
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((G((F("(p2076==1)"))||("(p2446==0)")))||(G(X(F("(p1726==0)")))))))
Formula 0 simplified : !X(G("(p2446==0)" | F"(p2076==1)") | GXF"(p1726==0)")

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-16b.tgz
mv FlexibleBarrier-PT-16b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;