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-165260575800140.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-20b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-165260575800140
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 6.2K Apr 29 13:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 29 13:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 13:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 13:13 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:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:52 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 1.5M 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-20b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652663927618

Running Version 202205111006
[2022-05-16 01:18:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 01:18:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 01:18:51] [INFO ] Load time of PNML (sax parser for PT used): 720 ms
[2022-05-16 01:18:51] [INFO ] Transformed 5372 places.
[2022-05-16 01:18:51] [INFO ] Transformed 6193 transitions.
[2022-05-16 01:18:51] [INFO ] Found NUPN structural information;
[2022-05-16 01:18:51] [INFO ] Parsed PT model containing 5372 places and 6193 transitions in 1063 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 5372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5372/5372 places, 6193/6193 transitions.
Discarding 2259 places :
Symmetric choice reduction at 0 with 2259 rule applications. Total rules 2259 place count 3113 transition count 3934
Iterating global reduction 0 with 2259 rules applied. Total rules applied 4518 place count 3113 transition count 3934
Discarding 1076 places :
Symmetric choice reduction at 0 with 1076 rule applications. Total rules 5594 place count 2037 transition count 2858
Iterating global reduction 0 with 1076 rules applied. Total rules applied 6670 place count 2037 transition count 2858
Discarding 700 places :
Symmetric choice reduction at 0 with 700 rule applications. Total rules 7370 place count 1337 transition count 2158
Iterating global reduction 0 with 700 rules applied. Total rules applied 8070 place count 1337 transition count 2158
Ensure Unique test removed 344 transitions
Reduce isomorphic transitions removed 344 transitions.
Iterating post reduction 0 with 344 rules applied. Total rules applied 8414 place count 1337 transition count 1814
Applied a total of 8414 rules in 1815 ms. Remains 1337 /5372 variables (removed 4035) and now considering 1814/6193 (removed 4379) transitions.
// Phase 1: matrix 1814 rows 1337 cols
[2022-05-16 01:18:53] [INFO ] Computed 22 place invariants in 89 ms
[2022-05-16 01:18:54] [INFO ] Implicit Places using invariants in 1271 ms returned []
// Phase 1: matrix 1814 rows 1337 cols
[2022-05-16 01:18:54] [INFO ] Computed 22 place invariants in 56 ms
[2022-05-16 01:18:57] [INFO ] Implicit Places using invariants and state equation in 2654 ms returned []
Implicit Place search using SMT with State Equation took 3993 ms to find 0 implicit places.
// Phase 1: matrix 1814 rows 1337 cols
[2022-05-16 01:18:57] [INFO ] Computed 22 place invariants in 52 ms
[2022-05-16 01:18:59] [INFO ] Dead Transitions using invariants and state equation in 1931 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1337/5372 places, 1814/6193 transitions.
Finished structural reductions, in 1 iterations. Remains : 1337/5372 places, 1814/6193 transitions.
Support contains 39 out of 1337 places after structural reductions.
[2022-05-16 01:18:59] [INFO ] Flatten gal took : 245 ms
[2022-05-16 01:19:00] [INFO ] Flatten gal took : 227 ms
[2022-05-16 01:19:00] [INFO ] Input system was already deterministic with 1814 transitions.
Support contains 38 out of 1337 places (down from 39) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 73 resets, run finished after 1169 ms. (steps per millisecond=8 ) properties (out of 31) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 1 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 1 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) 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 23) 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 23) 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 23) seen :0
Running SMT prover for 23 properties.
// Phase 1: matrix 1814 rows 1337 cols
[2022-05-16 01:19:01] [INFO ] Computed 22 place invariants in 30 ms
[2022-05-16 01:19:02] [INFO ] [Real]Absence check using 22 positive place invariants in 29 ms returned sat
[2022-05-16 01:19:03] [INFO ] After 1228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2022-05-16 01:19:04] [INFO ] [Nat]Absence check using 22 positive place invariants in 23 ms returned sat
[2022-05-16 01:19:07] [INFO ] After 2771ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :22
[2022-05-16 01:19:09] [INFO ] Deduced a trap composed of 415 places in 838 ms of which 9 ms to minimize.
[2022-05-16 01:19:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 978 ms
[2022-05-16 01:19:11] [INFO ] Deduced a trap composed of 431 places in 986 ms of which 3 ms to minimize.
[2022-05-16 01:19:12] [INFO ] Deduced a trap composed of 420 places in 887 ms of which 3 ms to minimize.
[2022-05-16 01:19:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2169 ms
[2022-05-16 01:19:13] [INFO ] After 8918ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :22
Attempting to minimize the solution found.
Minimization took 1692 ms.
[2022-05-16 01:19:15] [INFO ] After 12036ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :22
Fused 23 Parikh solutions to 21 different solutions.
Parikh walk visited 17 properties in 1406 ms.
Support contains 8 out of 1337 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1337/1337 places, 1814/1814 transitions.
Graph (trivial) has 1264 edges and 1337 vertex of which 121 / 1337 are part of one of the 20 SCC in 152 ms
Free SCC test removed 101 places
Drop transitions removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 1236 transition count 1595
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 1139 transition count 1595
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 195 place count 1139 transition count 1550
Deduced a syphon composed of 45 places in 3 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 285 place count 1094 transition count 1550
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 343 place count 1036 transition count 1492
Iterating global reduction 2 with 58 rules applied. Total rules applied 401 place count 1036 transition count 1492
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 403 place count 1036 transition count 1490
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 403 place count 1036 transition count 1488
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 407 place count 1034 transition count 1488
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 414 place count 1027 transition count 1481
Iterating global reduction 3 with 7 rules applied. Total rules applied 421 place count 1027 transition count 1481
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 426 place count 1027 transition count 1476
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 7 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 4 with 248 rules applied. Total rules applied 674 place count 903 transition count 1352
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 4 with 40 rules applied. Total rules applied 714 place count 903 transition count 1312
Discarding 27 places :
Symmetric choice reduction at 5 with 27 rule applications. Total rules 741 place count 876 transition count 1285
Iterating global reduction 5 with 27 rules applied. Total rules applied 768 place count 876 transition count 1285
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 775 place count 876 transition count 1278
Free-agglomeration rule applied 762 times.
Iterating global reduction 6 with 762 rules applied. Total rules applied 1537 place count 876 transition count 516
Reduce places removed 762 places and 0 transitions.
Drop transitions removed 339 transitions
Reduce isomorphic transitions removed 339 transitions.
Iterating post reduction 6 with 1101 rules applied. Total rules applied 2638 place count 114 transition count 177
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 2639 place count 113 transition count 176
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 100 edges and 112 vertex of which 40 / 112 are part of one of the 20 SCC in 0 ms
Free SCC test removed 20 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 2641 place count 92 transition count 176
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 8 with 40 rules applied. Total rules applied 2681 place count 92 transition count 136
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 20 Pre rules applied. Total rules applied 2681 place count 92 transition count 116
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 9 with 40 rules applied. Total rules applied 2721 place count 72 transition count 116
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 2741 place count 72 transition count 96
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 10 with 40 rules applied. Total rules applied 2781 place count 52 transition count 76
Free-agglomeration rule applied 20 times.
Iterating global reduction 10 with 20 rules applied. Total rules applied 2801 place count 52 transition count 56
Reduce places removed 36 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 10 with 71 rules applied. Total rules applied 2872 place count 16 transition count 21
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 2874 place count 16 transition count 19
Free-agglomeration rule applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 2877 place count 16 transition count 16
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 2880 place count 13 transition count 16
Applied a total of 2880 rules in 1548 ms. Remains 13 /1337 variables (removed 1324) and now considering 16/1814 (removed 1798) transitions.
Finished structural reductions, in 1 iterations. Remains : 13/1337 places, 16/1814 transitions.
Finished random walk after 32 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=16 )
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 22 stabilizing places and 22 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))||((X(p1)||G(p2)||p3) U p4)))'
Support contains 6 out of 1337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1337/1337 places, 1814/1814 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1315 transition count 1792
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1315 transition count 1792
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 1315 transition count 1790
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 63 place count 1298 transition count 1773
Iterating global reduction 1 with 17 rules applied. Total rules applied 80 place count 1298 transition count 1773
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 91 place count 1298 transition count 1762
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 95 place count 1294 transition count 1758
Iterating global reduction 2 with 4 rules applied. Total rules applied 99 place count 1294 transition count 1758
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 1294 transition count 1757
Applied a total of 100 rules in 232 ms. Remains 1294 /1337 variables (removed 43) and now considering 1757/1814 (removed 57) transitions.
// Phase 1: matrix 1757 rows 1294 cols
[2022-05-16 01:19:18] [INFO ] Computed 22 place invariants in 45 ms
[2022-05-16 01:19:19] [INFO ] Implicit Places using invariants in 911 ms returned []
// Phase 1: matrix 1757 rows 1294 cols
[2022-05-16 01:19:19] [INFO ] Computed 22 place invariants in 36 ms
[2022-05-16 01:19:21] [INFO ] Implicit Places using invariants and state equation in 2214 ms returned []
Implicit Place search using SMT with State Equation took 3127 ms to find 0 implicit places.
// Phase 1: matrix 1757 rows 1294 cols
[2022-05-16 01:19:22] [INFO ] Computed 22 place invariants in 31 ms
[2022-05-16 01:19:23] [INFO ] Dead Transitions using invariants and state equation in 1843 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1294/1337 places, 1757/1814 transitions.
Finished structural reductions, in 1 iterations. Remains : 1294/1337 places, 1757/1814 transitions.
Stuttering acceptance computed with spot in 860 ms :[(AND (NOT p0) (NOT p4)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p4)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p4)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p4) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p4), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p4) (NOT p3) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p4) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(NOT p4), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p4) (NOT p3) p2), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p4) (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p4) (NOT p0)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p4) (NOT p3) p2 (NOT p0)), acceptance={0} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=8 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p4:(EQ s995 1), p3:(AND (EQ s379 1) (EQ s889 1) (EQ s1276 1)), p2:(EQ s395 1), p1:(EQ s559 1), p0:(OR (EQ s379 0) (EQ s889 0) (EQ s1276 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, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1611 ms.
Product exploration explored 100000 steps with 33333 reset in 1307 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p4) (NOT p3) (NOT p2) (NOT p1) p0), (X (AND (NOT p4) (NOT p3) (NOT p2))), (X (NOT p1)), (X (NOT (AND (NOT p4) (NOT p3) p2))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p4)), (X (X (NOT (AND (NOT p4) (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p4) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 16 factoid took 622 ms. Reduced automaton from 9 states, 18 edges and 5 AP to 1 states, 0 edges and 0 AP.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-00 finished in 9729 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(X(p0)))||G(F(p1))))'
Support contains 1 out of 1337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1337/1337 places, 1814/1814 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1313 transition count 1790
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1313 transition count 1790
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 1313 transition count 1787
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 69 place count 1295 transition count 1769
Iterating global reduction 1 with 18 rules applied. Total rules applied 87 place count 1295 transition count 1769
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 100 place count 1295 transition count 1756
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 103 place count 1292 transition count 1753
Iterating global reduction 2 with 3 rules applied. Total rules applied 106 place count 1292 transition count 1753
Applied a total of 106 rules in 344 ms. Remains 1292 /1337 variables (removed 45) and now considering 1753/1814 (removed 61) transitions.
// Phase 1: matrix 1753 rows 1292 cols
[2022-05-16 01:19:28] [INFO ] Computed 22 place invariants in 55 ms
[2022-05-16 01:19:29] [INFO ] Implicit Places using invariants in 1045 ms returned []
// Phase 1: matrix 1753 rows 1292 cols
[2022-05-16 01:19:29] [INFO ] Computed 22 place invariants in 28 ms
[2022-05-16 01:19:32] [INFO ] Implicit Places using invariants and state equation in 2422 ms returned []
Implicit Place search using SMT with State Equation took 3471 ms to find 0 implicit places.
// Phase 1: matrix 1753 rows 1292 cols
[2022-05-16 01:19:32] [INFO ] Computed 22 place invariants in 42 ms
[2022-05-16 01:19:33] [INFO ] Dead Transitions using invariants and state equation in 1829 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1292/1337 places, 1753/1814 transitions.
Finished structural reductions, in 1 iterations. Remains : 1292/1337 places, 1753/1814 transitions.
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s520 0), p1:(EQ s520 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1411 ms.
Product exploration explored 100000 steps with 33333 reset in 1085 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-02 finished in 8476 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((p0||(F(p1)&&p2))))))'
Support contains 3 out of 1337 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1337/1337 places, 1814/1814 transitions.
Graph (trivial) has 1249 edges and 1337 vertex of which 115 / 1337 are part of one of the 19 SCC in 4 ms
Free SCC test removed 96 places
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 102 place count 1240 transition count 1615
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 203 place count 1139 transition count 1615
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 203 place count 1139 transition count 1571
Deduced a syphon composed of 44 places in 3 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 291 place count 1095 transition count 1571
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 351 place count 1035 transition count 1511
Iterating global reduction 2 with 60 rules applied. Total rules applied 411 place count 1035 transition count 1511
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 414 place count 1035 transition count 1508
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 414 place count 1035 transition count 1505
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 420 place count 1032 transition count 1505
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 429 place count 1023 transition count 1496
Iterating global reduction 3 with 9 rules applied. Total rules applied 438 place count 1023 transition count 1496
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 446 place count 1023 transition count 1488
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 4 with 250 rules applied. Total rules applied 696 place count 898 transition count 1363
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 701 place count 893 transition count 1358
Iterating global reduction 4 with 5 rules applied. Total rules applied 706 place count 893 transition count 1358
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 711 place count 893 transition count 1353
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 713 place count 892 transition count 1353
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 5 with 21 rules applied. Total rules applied 734 place count 892 transition count 1332
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 736 place count 890 transition count 1330
Applied a total of 736 rules in 1168 ms. Remains 890 /1337 variables (removed 447) and now considering 1330/1814 (removed 484) transitions.
[2022-05-16 01:19:37] [INFO ] Flow matrix only has 1292 transitions (discarded 38 similar events)
// Phase 1: matrix 1292 rows 890 cols
[2022-05-16 01:19:37] [INFO ] Computed 22 place invariants in 32 ms
[2022-05-16 01:19:38] [INFO ] Implicit Places using invariants in 675 ms returned []
[2022-05-16 01:19:38] [INFO ] Flow matrix only has 1292 transitions (discarded 38 similar events)
// Phase 1: matrix 1292 rows 890 cols
[2022-05-16 01:19:38] [INFO ] Computed 22 place invariants in 29 ms
[2022-05-16 01:19:40] [INFO ] Implicit Places using invariants and state equation in 2361 ms returned []
Implicit Place search using SMT with State Equation took 3038 ms to find 0 implicit places.
[2022-05-16 01:19:41] [INFO ] Redundant transitions in 180 ms returned []
[2022-05-16 01:19:41] [INFO ] Flow matrix only has 1292 transitions (discarded 38 similar events)
// Phase 1: matrix 1292 rows 890 cols
[2022-05-16 01:19:41] [INFO ] Computed 22 place invariants in 46 ms
[2022-05-16 01:19:42] [INFO ] Dead Transitions using invariants and state equation in 1631 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 890/1337 places, 1330/1814 transitions.
Finished structural reductions, in 1 iterations. Remains : 890/1337 places, 1330/1814 transitions.
Stuttering acceptance computed with spot in 74 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(EQ s235 0), p0:(EQ s104 0), p1:(EQ s799 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3655 reset in 1510 ms.
Product exploration explored 100000 steps with 3655 reset in 1532 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 p2 p0 p1), (X (OR p2 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (OR p2 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 529 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 80 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 374 resets, run finished after 613 ms. (steps per millisecond=16 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 245781 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 245781 steps, saw 66432 distinct states, run finished after 3003 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 5 properties.
[2022-05-16 01:19:50] [INFO ] Flow matrix only has 1292 transitions (discarded 38 similar events)
// Phase 1: matrix 1292 rows 890 cols
[2022-05-16 01:19:50] [INFO ] Computed 22 place invariants in 30 ms
[2022-05-16 01:19:50] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-16 01:19:51] [INFO ] [Nat]Absence check using 22 positive place invariants in 13 ms returned sat
[2022-05-16 01:19:51] [INFO ] After 747ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-16 01:19:52] [INFO ] After 1147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 232 ms.
[2022-05-16 01:19:52] [INFO ] After 1679ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 890 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 890/890 places, 1330/1330 transitions.
Drop transitions removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 890 transition count 1291
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 59 place count 870 transition count 1271
Iterating global reduction 1 with 20 rules applied. Total rules applied 79 place count 870 transition count 1271
Free-agglomeration rule applied 744 times.
Iterating global reduction 1 with 744 rules applied. Total rules applied 823 place count 870 transition count 527
Reduce places removed 745 places and 0 transitions.
Drop transitions removed 323 transitions
Reduce isomorphic transitions removed 323 transitions.
Graph (trivial) has 101 edges and 125 vertex of which 38 / 125 are part of one of the 19 SCC in 0 ms
Free SCC test removed 19 places
Iterating post reduction 1 with 1069 rules applied. Total rules applied 1892 place count 106 transition count 204
Drop transitions removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 2 with 38 rules applied. Total rules applied 1930 place count 106 transition count 166
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 1930 place count 106 transition count 146
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 1970 place count 86 transition count 146
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 1990 place count 86 transition count 126
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 2034 place count 64 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2035 place count 64 transition count 103
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 5 with 19 rules applied. Total rules applied 2054 place count 64 transition count 84
Graph (complete) has 126 edges and 64 vertex of which 62 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 5 with 1 rules applied. Total rules applied 2055 place count 62 transition count 83
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2056 place count 62 transition count 82
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2056 place count 62 transition count 81
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 2058 place count 61 transition count 81
Free-agglomeration rule applied 18 times.
Iterating global reduction 7 with 18 rules applied. Total rules applied 2076 place count 61 transition count 63
Reduce places removed 35 places and 0 transitions.
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 53 rules applied. Total rules applied 2129 place count 26 transition count 45
Discarding 17 places :
Symmetric choice reduction at 8 with 17 rule applications. Total rules 2146 place count 9 transition count 28
Iterating global reduction 8 with 17 rules applied. Total rules applied 2163 place count 9 transition count 28
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 2180 place count 9 transition count 11
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2181 place count 9 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2182 place count 8 transition count 10
Applied a total of 2182 rules in 311 ms. Remains 8 /890 variables (removed 882) and now considering 10/1330 (removed 1320) transitions.
Finished structural reductions, in 1 iterations. Remains : 8/890 places, 10/1330 transitions.
Finished random walk after 9 steps, including 0 resets, run visited all 5 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND p2 p0 p1), (X (OR p2 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (OR p2 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0)), (F (NOT (OR p0 p2))), (F (AND (NOT p1) (NOT p0) p2)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 11 factoid took 560 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 88 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 890 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 890/890 places, 1330/1330 transitions.
Applied a total of 0 rules in 109 ms. Remains 890 /890 variables (removed 0) and now considering 1330/1330 (removed 0) transitions.
[2022-05-16 01:19:53] [INFO ] Flow matrix only has 1292 transitions (discarded 38 similar events)
// Phase 1: matrix 1292 rows 890 cols
[2022-05-16 01:19:53] [INFO ] Computed 22 place invariants in 54 ms
[2022-05-16 01:19:54] [INFO ] Implicit Places using invariants in 721 ms returned []
[2022-05-16 01:19:54] [INFO ] Flow matrix only has 1292 transitions (discarded 38 similar events)
// Phase 1: matrix 1292 rows 890 cols
[2022-05-16 01:19:54] [INFO ] Computed 22 place invariants in 30 ms
[2022-05-16 01:19:56] [INFO ] Implicit Places using invariants and state equation in 1854 ms returned []
Implicit Place search using SMT with State Equation took 2583 ms to find 0 implicit places.
[2022-05-16 01:19:56] [INFO ] Redundant transitions in 29 ms returned []
[2022-05-16 01:19:56] [INFO ] Flow matrix only has 1292 transitions (discarded 38 similar events)
// Phase 1: matrix 1292 rows 890 cols
[2022-05-16 01:19:56] [INFO ] Computed 22 place invariants in 29 ms
[2022-05-16 01:19:57] [INFO ] Dead Transitions using invariants and state equation in 1295 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 890/890 places, 1330/1330 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 p0 p2 p1), (X (NOT (AND (NOT p1) p0))), (X (OR p0 p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 418 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 109 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 374 resets, run finished after 658 ms. (steps per millisecond=15 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 197834 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 197834 steps, saw 58163 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 5 properties.
[2022-05-16 01:20:02] [INFO ] Flow matrix only has 1292 transitions (discarded 38 similar events)
// Phase 1: matrix 1292 rows 890 cols
[2022-05-16 01:20:02] [INFO ] Computed 22 place invariants in 29 ms
[2022-05-16 01:20:02] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-16 01:20:03] [INFO ] [Nat]Absence check using 22 positive place invariants in 17 ms returned sat
[2022-05-16 01:20:04] [INFO ] After 1122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-16 01:20:05] [INFO ] After 1708ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 329 ms.
[2022-05-16 01:20:05] [INFO ] After 2419ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 890 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 890/890 places, 1330/1330 transitions.
Drop transitions removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 890 transition count 1291
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 59 place count 870 transition count 1271
Iterating global reduction 1 with 20 rules applied. Total rules applied 79 place count 870 transition count 1271
Free-agglomeration rule applied 744 times.
Iterating global reduction 1 with 744 rules applied. Total rules applied 823 place count 870 transition count 527
Reduce places removed 745 places and 0 transitions.
Drop transitions removed 323 transitions
Reduce isomorphic transitions removed 323 transitions.
Graph (trivial) has 101 edges and 125 vertex of which 38 / 125 are part of one of the 19 SCC in 0 ms
Free SCC test removed 19 places
Iterating post reduction 1 with 1069 rules applied. Total rules applied 1892 place count 106 transition count 204
Drop transitions removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 2 with 38 rules applied. Total rules applied 1930 place count 106 transition count 166
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 1930 place count 106 transition count 146
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 1970 place count 86 transition count 146
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 1990 place count 86 transition count 126
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 2034 place count 64 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2035 place count 64 transition count 103
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 5 with 19 rules applied. Total rules applied 2054 place count 64 transition count 84
Graph (complete) has 126 edges and 64 vertex of which 62 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 5 with 1 rules applied. Total rules applied 2055 place count 62 transition count 83
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2056 place count 62 transition count 82
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2056 place count 62 transition count 81
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2058 place count 61 transition count 81
Free-agglomeration rule applied 18 times.
Iterating global reduction 7 with 18 rules applied. Total rules applied 2076 place count 61 transition count 63
Reduce places removed 35 places and 0 transitions.
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 53 rules applied. Total rules applied 2129 place count 26 transition count 45
Discarding 17 places :
Symmetric choice reduction at 8 with 17 rule applications. Total rules 2146 place count 9 transition count 28
Iterating global reduction 8 with 17 rules applied. Total rules applied 2163 place count 9 transition count 28
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 2180 place count 9 transition count 11
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2181 place count 9 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2182 place count 8 transition count 10
Applied a total of 2182 rules in 198 ms. Remains 8 /890 variables (removed 882) and now considering 10/1330 (removed 1320) transitions.
Finished structural reductions, in 1 iterations. Remains : 8/890 places, 10/1330 transitions.
Finished random walk after 24 steps, including 0 resets, run visited all 5 properties in 1 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p1) p0))), (X (OR p0 p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0)), (F (NOT (OR p0 p2))), (F (AND (NOT p1) (NOT p0) p2)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 11 factoid took 504 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 68 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3643 reset in 1939 ms.
Product exploration explored 100000 steps with 3649 reset in 1333 ms.
Built C files in :
/tmp/ltsmin16345935503741918593
[2022-05-16 01:20:09] [INFO ] Computing symmetric may disable matrix : 1330 transitions.
[2022-05-16 01:20:09] [INFO ] Computation of Complete disable matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:20:09] [INFO ] Computing symmetric may enable matrix : 1330 transitions.
[2022-05-16 01:20:09] [INFO ] Computation of Complete enable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:20:10] [INFO ] Computing Do-Not-Accords matrix : 1330 transitions.
[2022-05-16 01:20:10] [INFO ] Computation of Completed DNA matrix. took 114 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:20:10] [INFO ] Built C files in 670ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16345935503741918593
Running compilation step : cd /tmp/ltsmin16345935503741918593;'/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/ltsmin16345935503741918593;'/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/ltsmin16345935503741918593;'/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 890 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 890/890 places, 1330/1330 transitions.
Applied a total of 0 rules in 152 ms. Remains 890 /890 variables (removed 0) and now considering 1330/1330 (removed 0) transitions.
[2022-05-16 01:20:13] [INFO ] Flow matrix only has 1292 transitions (discarded 38 similar events)
// Phase 1: matrix 1292 rows 890 cols
[2022-05-16 01:20:13] [INFO ] Computed 22 place invariants in 31 ms
[2022-05-16 01:20:14] [INFO ] Implicit Places using invariants in 711 ms returned []
[2022-05-16 01:20:14] [INFO ] Flow matrix only has 1292 transitions (discarded 38 similar events)
// Phase 1: matrix 1292 rows 890 cols
[2022-05-16 01:20:14] [INFO ] Computed 22 place invariants in 29 ms
[2022-05-16 01:20:15] [INFO ] Implicit Places using invariants and state equation in 1699 ms returned []
Implicit Place search using SMT with State Equation took 2413 ms to find 0 implicit places.
[2022-05-16 01:20:15] [INFO ] Redundant transitions in 19 ms returned []
[2022-05-16 01:20:15] [INFO ] Flow matrix only has 1292 transitions (discarded 38 similar events)
// Phase 1: matrix 1292 rows 890 cols
[2022-05-16 01:20:15] [INFO ] Computed 22 place invariants in 29 ms
[2022-05-16 01:20:16] [INFO ] Dead Transitions using invariants and state equation in 1076 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 890/890 places, 1330/1330 transitions.
Built C files in :
/tmp/ltsmin16716650326178340901
[2022-05-16 01:20:16] [INFO ] Computing symmetric may disable matrix : 1330 transitions.
[2022-05-16 01:20:16] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:20:16] [INFO ] Computing symmetric may enable matrix : 1330 transitions.
[2022-05-16 01:20:17] [INFO ] Computation of Complete enable matrix. took 50 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:20:17] [INFO ] Computing Do-Not-Accords matrix : 1330 transitions.
[2022-05-16 01:20:17] [INFO ] Computation of Completed DNA matrix. took 49 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:20:17] [INFO ] Built C files in 346ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16716650326178340901
Running compilation step : cd /tmp/ltsmin16716650326178340901;'/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/ltsmin16716650326178340901;'/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/ltsmin16716650326178340901;'/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-16 01:20:20] [INFO ] Flatten gal took : 125 ms
[2022-05-16 01:20:20] [INFO ] Flatten gal took : 80 ms
[2022-05-16 01:20:20] [INFO ] Time to serialize gal into /tmp/LTL15892051784559371540.gal : 29 ms
[2022-05-16 01:20:20] [INFO ] Time to serialize properties into /tmp/LTL17567252941568982862.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/LTL15892051784559371540.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17567252941568982862.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/LTL1589205...268
Read 1 LTL properties
Checking formula 0 : !((F(G(X(("(p779==0)")||((F("(p4916==0)"))&&("(p1631==0)")))))))
Formula 0 simplified : !FGX("(p779==0)" | ("(p1631==0)" & F"(p4916==0)"))
Detected timeout of ITS tools.
[2022-05-16 01:20:35] [INFO ] Flatten gal took : 66 ms
[2022-05-16 01:20:35] [INFO ] Applying decomposition
[2022-05-16 01:20:35] [INFO ] Flatten gal took : 65 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/graph15308506655824338076.txt' '-o' '/tmp/graph15308506655824338076.bin' '-w' '/tmp/graph15308506655824338076.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15308506655824338076.bin' '-l' '-1' '-v' '-w' '/tmp/graph15308506655824338076.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:20:36] [INFO ] Decomposing Gal with order
[2022-05-16 01:20:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:20:37] [INFO ] Removed a total of 521 redundant transitions.
[2022-05-16 01:20:37] [INFO ] Flatten gal took : 878 ms
[2022-05-16 01:20:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 93 labels/synchronizations in 36 ms.
[2022-05-16 01:20:37] [INFO ] Time to serialize gal into /tmp/LTL14000099047225562210.gal : 18 ms
[2022-05-16 01:20:37] [INFO ] Time to serialize properties into /tmp/LTL3788662059803008481.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/LTL14000099047225562210.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3788662059803008481.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/LTL1400009...246
Read 1 LTL properties
Checking formula 0 : !((F(G(X(("(u14.p779==0)")||((F("(i3.u62.p4916==0)"))&&("(i8.u26.p1631==0)")))))))
Formula 0 simplified : !FGX("(u14.p779==0)" | ("(i8.u26.p1631==0)" & F"(i3.u62.p4916==0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1364569229469597624
[2022-05-16 01:20:52] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1364569229469597624
Running compilation step : cd /tmp/ltsmin1364569229469597624;'/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/ltsmin1364569229469597624;'/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/ltsmin1364569229469597624;'/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-20b-LTLFireability-03 finished in 78568 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1337 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1337/1337 places, 1814/1814 transitions.
Graph (trivial) has 1271 edges and 1337 vertex of which 121 / 1337 are part of one of the 20 SCC in 1 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 103 place count 1235 transition count 1609
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 1 with 102 rules applied. Total rules applied 205 place count 1133 transition count 1609
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 205 place count 1133 transition count 1565
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 293 place count 1089 transition count 1565
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 357 place count 1025 transition count 1501
Iterating global reduction 2 with 64 rules applied. Total rules applied 421 place count 1025 transition count 1501
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 424 place count 1025 transition count 1498
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 424 place count 1025 transition count 1497
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 426 place count 1024 transition count 1497
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 433 place count 1017 transition count 1490
Iterating global reduction 3 with 7 rules applied. Total rules applied 440 place count 1017 transition count 1490
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 447 place count 1017 transition count 1483
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 1 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 4 with 244 rules applied. Total rules applied 691 place count 895 transition count 1361
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 698 place count 888 transition count 1354
Iterating global reduction 4 with 7 rules applied. Total rules applied 705 place count 888 transition count 1354
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 712 place count 888 transition count 1347
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 732 place count 888 transition count 1327
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 734 place count 886 transition count 1325
Applied a total of 734 rules in 630 ms. Remains 886 /1337 variables (removed 451) and now considering 1325/1814 (removed 489) transitions.
[2022-05-16 01:20:55] [INFO ] Flow matrix only has 1288 transitions (discarded 37 similar events)
// Phase 1: matrix 1288 rows 886 cols
[2022-05-16 01:20:55] [INFO ] Computed 22 place invariants in 32 ms
[2022-05-16 01:20:56] [INFO ] Implicit Places using invariants in 886 ms returned []
[2022-05-16 01:20:56] [INFO ] Flow matrix only has 1288 transitions (discarded 37 similar events)
// Phase 1: matrix 1288 rows 886 cols
[2022-05-16 01:20:56] [INFO ] Computed 22 place invariants in 49 ms
[2022-05-16 01:20:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 01:20:59] [INFO ] Implicit Places using invariants and state equation in 2812 ms returned []
Implicit Place search using SMT with State Equation took 3700 ms to find 0 implicit places.
[2022-05-16 01:20:59] [INFO ] Redundant transitions in 33 ms returned []
[2022-05-16 01:20:59] [INFO ] Flow matrix only has 1288 transitions (discarded 37 similar events)
// Phase 1: matrix 1288 rows 886 cols
[2022-05-16 01:20:59] [INFO ] Computed 22 place invariants in 50 ms
[2022-05-16 01:21:01] [INFO ] Dead Transitions using invariants and state equation in 1438 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 886/1337 places, 1325/1814 transitions.
Finished structural reductions, in 1 iterations. Remains : 886/1337 places, 1325/1814 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s123 1) (EQ s885 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 0 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-04 finished in 5871 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1) U X(p2)))'
Support contains 3 out of 1337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1337/1337 places, 1814/1814 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1314 transition count 1791
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1314 transition count 1791
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 1314 transition count 1788
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 67 place count 1296 transition count 1770
Iterating global reduction 1 with 18 rules applied. Total rules applied 85 place count 1296 transition count 1770
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 97 place count 1296 transition count 1758
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 101 place count 1292 transition count 1754
Iterating global reduction 2 with 4 rules applied. Total rules applied 105 place count 1292 transition count 1754
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 1292 transition count 1753
Applied a total of 106 rules in 310 ms. Remains 1292 /1337 variables (removed 45) and now considering 1753/1814 (removed 61) transitions.
// Phase 1: matrix 1753 rows 1292 cols
[2022-05-16 01:21:01] [INFO ] Computed 22 place invariants in 48 ms
[2022-05-16 01:21:03] [INFO ] Implicit Places using invariants in 1640 ms returned []
// Phase 1: matrix 1753 rows 1292 cols
[2022-05-16 01:21:03] [INFO ] Computed 22 place invariants in 49 ms
[2022-05-16 01:21:05] [INFO ] Implicit Places using invariants and state equation in 2492 ms returned []
Implicit Place search using SMT with State Equation took 4135 ms to find 0 implicit places.
// Phase 1: matrix 1753 rows 1292 cols
[2022-05-16 01:21:05] [INFO ] Computed 22 place invariants in 31 ms
[2022-05-16 01:21:07] [INFO ] Dead Transitions using invariants and state equation in 1997 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1292/1337 places, 1753/1814 transitions.
Finished structural reductions, in 1 iterations. Remains : 1292/1337 places, 1753/1814 transitions.
Stuttering acceptance computed with spot in 274 ms :[(NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), true, (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s829 1) (EQ s524 1)), p0:(EQ s829 1), p2:(NEQ s380 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1737 ms.
Product exploration explored 100000 steps with 50000 reset in 1403 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))
Knowledge based reduction with 17 factoid took 326 ms. Reduced automaton from 7 states, 16 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-05 finished in 10226 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((X(G((F(G(p0))||p1)))||F(X(p2)))))))'
Support contains 3 out of 1337 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1337/1337 places, 1814/1814 transitions.
Graph (trivial) has 1253 edges and 1337 vertex of which 115 / 1337 are part of one of the 19 SCC in 2 ms
Free SCC test removed 96 places
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 1240 transition count 1613
Reduce places removed 103 places and 0 transitions.
Iterating post reduction 1 with 103 rules applied. Total rules applied 207 place count 1137 transition count 1613
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 207 place count 1137 transition count 1570
Deduced a syphon composed of 43 places in 2 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 293 place count 1094 transition count 1570
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 353 place count 1034 transition count 1510
Iterating global reduction 2 with 60 rules applied. Total rules applied 413 place count 1034 transition count 1510
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 416 place count 1034 transition count 1507
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 416 place count 1034 transition count 1504
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 422 place count 1031 transition count 1504
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 429 place count 1024 transition count 1497
Iterating global reduction 3 with 7 rules applied. Total rules applied 436 place count 1024 transition count 1497
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 441 place count 1024 transition count 1492
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 1 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 4 with 248 rules applied. Total rules applied 689 place count 900 transition count 1368
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 696 place count 893 transition count 1361
Iterating global reduction 4 with 7 rules applied. Total rules applied 703 place count 893 transition count 1361
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 710 place count 893 transition count 1354
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 712 place count 892 transition count 1354
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 5 with 21 rules applied. Total rules applied 733 place count 892 transition count 1333
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 735 place count 890 transition count 1331
Applied a total of 735 rules in 915 ms. Remains 890 /1337 variables (removed 447) and now considering 1331/1814 (removed 483) transitions.
[2022-05-16 01:21:12] [INFO ] Flow matrix only has 1293 transitions (discarded 38 similar events)
// Phase 1: matrix 1293 rows 890 cols
[2022-05-16 01:21:12] [INFO ] Computed 22 place invariants in 31 ms
[2022-05-16 01:21:13] [INFO ] Implicit Places using invariants in 1283 ms returned []
[2022-05-16 01:21:13] [INFO ] Flow matrix only has 1293 transitions (discarded 38 similar events)
// Phase 1: matrix 1293 rows 890 cols
[2022-05-16 01:21:13] [INFO ] Computed 22 place invariants in 52 ms
[2022-05-16 01:21:16] [INFO ] Implicit Places using invariants and state equation in 2445 ms returned []
Implicit Place search using SMT with State Equation took 3732 ms to find 0 implicit places.
[2022-05-16 01:21:16] [INFO ] Redundant transitions in 26 ms returned []
[2022-05-16 01:21:16] [INFO ] Flow matrix only has 1293 transitions (discarded 38 similar events)
// Phase 1: matrix 1293 rows 890 cols
[2022-05-16 01:21:16] [INFO ] Computed 22 place invariants in 42 ms
[2022-05-16 01:21:17] [INFO ] Dead Transitions using invariants and state equation in 1094 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 890/1337 places, 1331/1814 transitions.
Finished structural reductions, in 1 iterations. Remains : 890/1337 places, 1331/1814 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s105 0), p2:(EQ s132 1), p1:(EQ s211 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3643 reset in 1526 ms.
Product exploration explored 100000 steps with 3639 reset in 1679 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 p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
Knowledge based reduction with 7 factoid took 367 ms. Reduced automaton from 2 states, 6 edges and 3 AP to 2 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 369 resets, run finished after 444 ms. (steps per millisecond=22 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2022-05-16 01:21:21] [INFO ] Flow matrix only has 1293 transitions (discarded 38 similar events)
// Phase 1: matrix 1293 rows 890 cols
[2022-05-16 01:21:21] [INFO ] Computed 22 place invariants in 50 ms
[2022-05-16 01:21:22] [INFO ] After 255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 01:21:22] [INFO ] [Nat]Absence check using 22 positive place invariants in 13 ms returned sat
[2022-05-16 01:21:23] [INFO ] After 821ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 01:21:23] [INFO ] After 1077ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 153 ms.
[2022-05-16 01:21:23] [INFO ] After 1464ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 890 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 890/890 places, 1331/1331 transitions.
Drop transitions removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 890 transition count 1292
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 59 place count 870 transition count 1272
Iterating global reduction 1 with 20 rules applied. Total rules applied 79 place count 870 transition count 1272
Free-agglomeration rule applied 745 times.
Iterating global reduction 1 with 745 rules applied. Total rules applied 824 place count 870 transition count 527
Reduce places removed 747 places and 0 transitions.
Drop transitions removed 324 transitions
Reduce isomorphic transitions removed 324 transitions.
Graph (trivial) has 141 edges and 123 vertex of which 97 / 123 are part of one of the 20 SCC in 0 ms
Free SCC test removed 77 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 1073 rules applied. Total rules applied 1897 place count 46 transition count 202
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 135 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 152 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 171 rules applied. Total rules applied 2068 place count 28 transition count 49
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 2071 place count 27 transition count 47
Reduce places removed 1 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 4 with 18 rules applied. Total rules applied 2089 place count 26 transition count 30
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 2123 place count 9 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 2125 place count 9 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2125 place count 9 transition count 10
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 2127 place count 8 transition count 10
Applied a total of 2127 rules in 301 ms. Remains 8 /890 variables (removed 882) and now considering 10/1331 (removed 1321) transitions.
Finished structural reductions, in 1 iterations. Remains : 8/890 places, 10/1331 transitions.
Finished random walk after 18 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND p0 p1 (NOT p2))))]
Knowledge based reduction with 7 factoid took 702 ms. Reduced automaton from 2 states, 6 edges and 3 AP to 2 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 3 out of 890 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 890/890 places, 1331/1331 transitions.
Applied a total of 0 rules in 175 ms. Remains 890 /890 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2022-05-16 01:21:25] [INFO ] Flow matrix only has 1293 transitions (discarded 38 similar events)
// Phase 1: matrix 1293 rows 890 cols
[2022-05-16 01:21:25] [INFO ] Computed 22 place invariants in 50 ms
[2022-05-16 01:21:26] [INFO ] Implicit Places using invariants in 1283 ms returned []
[2022-05-16 01:21:26] [INFO ] Flow matrix only has 1293 transitions (discarded 38 similar events)
// Phase 1: matrix 1293 rows 890 cols
[2022-05-16 01:21:26] [INFO ] Computed 22 place invariants in 45 ms
[2022-05-16 01:21:28] [INFO ] Implicit Places using invariants and state equation in 2206 ms returned []
Implicit Place search using SMT with State Equation took 3493 ms to find 0 implicit places.
[2022-05-16 01:21:28] [INFO ] Redundant transitions in 31 ms returned []
[2022-05-16 01:21:28] [INFO ] Flow matrix only has 1293 transitions (discarded 38 similar events)
// Phase 1: matrix 1293 rows 890 cols
[2022-05-16 01:21:28] [INFO ] Computed 22 place invariants in 51 ms
[2022-05-16 01:21:29] [INFO ] Dead Transitions using invariants and state equation in 1202 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 890/890 places, 1331/1331 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 p0 (NOT p2) p1), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
Knowledge based reduction with 7 factoid took 481 ms. Reduced automaton from 2 states, 6 edges and 3 AP to 2 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 372 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-16 01:21:31] [INFO ] Flow matrix only has 1293 transitions (discarded 38 similar events)
// Phase 1: matrix 1293 rows 890 cols
[2022-05-16 01:21:31] [INFO ] Computed 22 place invariants in 49 ms
[2022-05-16 01:21:31] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 01:21:31] [INFO ] [Nat]Absence check using 22 positive place invariants in 19 ms returned sat
[2022-05-16 01:21:32] [INFO ] After 976ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 01:21:33] [INFO ] After 1227ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 148 ms.
[2022-05-16 01:21:33] [INFO ] After 1680ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 890 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 890/890 places, 1331/1331 transitions.
Drop transitions removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 890 transition count 1292
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 59 place count 870 transition count 1272
Iterating global reduction 1 with 20 rules applied. Total rules applied 79 place count 870 transition count 1272
Free-agglomeration rule applied 745 times.
Iterating global reduction 1 with 745 rules applied. Total rules applied 824 place count 870 transition count 527
Reduce places removed 747 places and 0 transitions.
Drop transitions removed 324 transitions
Reduce isomorphic transitions removed 324 transitions.
Graph (trivial) has 141 edges and 123 vertex of which 97 / 123 are part of one of the 20 SCC in 1 ms
Free SCC test removed 77 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 1073 rules applied. Total rules applied 1897 place count 46 transition count 202
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 135 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 152 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 171 rules applied. Total rules applied 2068 place count 28 transition count 49
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 2071 place count 27 transition count 47
Reduce places removed 1 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 4 with 18 rules applied. Total rules applied 2089 place count 26 transition count 30
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 2123 place count 9 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 2125 place count 9 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2125 place count 9 transition count 10
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 2127 place count 8 transition count 10
Applied a total of 2127 rules in 295 ms. Remains 8 /890 variables (removed 882) and now considering 10/1331 (removed 1321) transitions.
Finished structural reductions, in 1 iterations. Remains : 8/890 places, 10/1331 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND p0 p1 (NOT p2))))]
Knowledge based reduction with 7 factoid took 657 ms. Reduced automaton from 2 states, 6 edges and 3 AP to 2 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 3647 reset in 1620 ms.
Product exploration explored 100000 steps with 3643 reset in 1526 ms.
Built C files in :
/tmp/ltsmin12854451460250011818
[2022-05-16 01:21:37] [INFO ] Computing symmetric may disable matrix : 1331 transitions.
[2022-05-16 01:21:37] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:21:37] [INFO ] Computing symmetric may enable matrix : 1331 transitions.
[2022-05-16 01:21:37] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:21:37] [INFO ] Computing Do-Not-Accords matrix : 1331 transitions.
[2022-05-16 01:21:38] [INFO ] Computation of Completed DNA matrix. took 74 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:21:38] [INFO ] Built C files in 406ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12854451460250011818
Running compilation step : cd /tmp/ltsmin12854451460250011818;'/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/ltsmin12854451460250011818;'/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/ltsmin12854451460250011818;'/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 890 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 890/890 places, 1331/1331 transitions.
Applied a total of 0 rules in 100 ms. Remains 890 /890 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2022-05-16 01:21:41] [INFO ] Flow matrix only has 1293 transitions (discarded 38 similar events)
// Phase 1: matrix 1293 rows 890 cols
[2022-05-16 01:21:41] [INFO ] Computed 22 place invariants in 30 ms
[2022-05-16 01:21:42] [INFO ] Implicit Places using invariants in 1161 ms returned []
[2022-05-16 01:21:42] [INFO ] Flow matrix only has 1293 transitions (discarded 38 similar events)
// Phase 1: matrix 1293 rows 890 cols
[2022-05-16 01:21:42] [INFO ] Computed 22 place invariants in 29 ms
[2022-05-16 01:21:44] [INFO ] Implicit Places using invariants and state equation in 1708 ms returned []
Implicit Place search using SMT with State Equation took 2870 ms to find 0 implicit places.
[2022-05-16 01:21:44] [INFO ] Redundant transitions in 19 ms returned []
[2022-05-16 01:21:44] [INFO ] Flow matrix only has 1293 transitions (discarded 38 similar events)
// Phase 1: matrix 1293 rows 890 cols
[2022-05-16 01:21:44] [INFO ] Computed 22 place invariants in 29 ms
[2022-05-16 01:21:45] [INFO ] Dead Transitions using invariants and state equation in 1145 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 890/890 places, 1331/1331 transitions.
Built C files in :
/tmp/ltsmin2940233708948041012
[2022-05-16 01:21:45] [INFO ] Computing symmetric may disable matrix : 1331 transitions.
[2022-05-16 01:21:45] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:21:45] [INFO ] Computing symmetric may enable matrix : 1331 transitions.
[2022-05-16 01:21:45] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:21:45] [INFO ] Computing Do-Not-Accords matrix : 1331 transitions.
[2022-05-16 01:21:45] [INFO ] Computation of Completed DNA matrix. took 70 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:21:45] [INFO ] Built C files in 312ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2940233708948041012
Running compilation step : cd /tmp/ltsmin2940233708948041012;'/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/ltsmin2940233708948041012;'/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/ltsmin2940233708948041012;'/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-16 01:21:48] [INFO ] Flatten gal took : 56 ms
[2022-05-16 01:21:48] [INFO ] Flatten gal took : 56 ms
[2022-05-16 01:21:48] [INFO ] Time to serialize gal into /tmp/LTL1894457175832055113.gal : 15 ms
[2022-05-16 01:21:48] [INFO ] Time to serialize properties into /tmp/LTL8294200814840205504.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/LTL1894457175832055113.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8294200814840205504.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/LTL1894457...266
Read 1 LTL properties
Checking formula 0 : !((X(F(G((X(G((F(G("(p755==0)")))||("(p1451==0)"))))||(F(X("(p979==1)"))))))))
Formula 0 simplified : !XFG(XG("(p1451==0)" | FG"(p755==0)") | FX"(p979==1)")
Detected timeout of ITS tools.
[2022-05-16 01:22:03] [INFO ] Flatten gal took : 55 ms
[2022-05-16 01:22:03] [INFO ] Applying decomposition
[2022-05-16 01:22:03] [INFO ] Flatten gal took : 55 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/graph8665233637009012877.txt' '-o' '/tmp/graph8665233637009012877.bin' '-w' '/tmp/graph8665233637009012877.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8665233637009012877.bin' '-l' '-1' '-v' '-w' '/tmp/graph8665233637009012877.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:22:04] [INFO ] Decomposing Gal with order
[2022-05-16 01:22:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:22:04] [INFO ] Removed a total of 522 redundant transitions.
[2022-05-16 01:22:04] [INFO ] Flatten gal took : 294 ms
[2022-05-16 01:22:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 83 labels/synchronizations in 33 ms.
[2022-05-16 01:22:04] [INFO ] Time to serialize gal into /tmp/LTL13832647800522884089.gal : 19 ms
[2022-05-16 01:22:04] [INFO ] Time to serialize properties into /tmp/LTL3934783954097089086.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/LTL13832647800522884089.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3934783954097089086.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/LTL1383264...246
Read 1 LTL properties
Checking formula 0 : !((X(F(G((X(G((F(G("(i4.u14.p755==0)")))||("(i7.u24.p1451==0)"))))||(F(X("(u17.p979==1)"))))))))
Formula 0 simplified : !XFG(XG("(i7.u24.p1451==0)" | FG"(i4.u14.p755==0)") | FX"(u17.p979==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11910362632467375923
[2022-05-16 01:22:19] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11910362632467375923
Running compilation step : cd /tmp/ltsmin11910362632467375923;'/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/ltsmin11910362632467375923;'/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/ltsmin11910362632467375923;'/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-20b-LTLFireability-06 finished in 71123 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!((p0 U p1) U X(((p1 U p2)&&p3))))'
Support contains 5 out of 1337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1337/1337 places, 1814/1814 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1315 transition count 1792
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1315 transition count 1792
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 1315 transition count 1789
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 63 place count 1299 transition count 1773
Iterating global reduction 1 with 16 rules applied. Total rules applied 79 place count 1299 transition count 1773
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 89 place count 1299 transition count 1763
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 93 place count 1295 transition count 1759
Iterating global reduction 2 with 4 rules applied. Total rules applied 97 place count 1295 transition count 1759
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 1295 transition count 1758
Applied a total of 98 rules in 227 ms. Remains 1295 /1337 variables (removed 42) and now considering 1758/1814 (removed 56) transitions.
// Phase 1: matrix 1758 rows 1295 cols
[2022-05-16 01:22:22] [INFO ] Computed 22 place invariants in 29 ms
[2022-05-16 01:22:23] [INFO ] Implicit Places using invariants in 882 ms returned []
// Phase 1: matrix 1758 rows 1295 cols
[2022-05-16 01:22:23] [INFO ] Computed 22 place invariants in 27 ms
[2022-05-16 01:22:26] [INFO ] Implicit Places using invariants and state equation in 2662 ms returned []
Implicit Place search using SMT with State Equation took 3546 ms to find 0 implicit places.
// Phase 1: matrix 1758 rows 1295 cols
[2022-05-16 01:22:26] [INFO ] Computed 22 place invariants in 52 ms
[2022-05-16 01:22:28] [INFO ] Dead Transitions using invariants and state equation in 2046 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1295/1337 places, 1758/1814 transitions.
Finished structural reductions, in 1 iterations. Remains : 1295/1337 places, 1758/1814 transitions.
Stuttering acceptance computed with spot in 238 ms :[(AND p2 p3), (AND p2 p3), (AND p1 p2 p3), true, p2, (AND p1 p2 p3), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p3 p2), acceptance={} source=1 dest: 3}, { cond=(AND p1 p3 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 p3 p2), acceptance={} source=5 dest: 3}, { cond=(AND p1 p3 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1) p3 p2), acceptance={} source=5 dest: 6}], [{ cond=(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), acceptance={} source=6 dest: 3}, { cond=(OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s697 1), p0:(EQ s565 1), p3:(OR (EQ s676 1) (EQ s629 1)), p2:(EQ s1289 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1768 ms.
Product exploration explored 100000 steps with 50000 reset in 1364 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (X (NOT (AND p1 p3 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT (AND p3 p2))), (X (X (NOT p2))), true, (X (X (NOT (AND p0 (NOT p1) p3 p2)))), (X (X (NOT (AND p1 p3 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 p3 p2)))), (X (X (NOT p1))), (X (X (NOT (AND p3 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p3 p2)))
Knowledge based reduction with 14 factoid took 350 ms. Reduced automaton from 7 states, 17 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-07 finished in 9587 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((F(G(p0))&&(G(X(X(G(p1))))||p2))))))'
Support contains 6 out of 1337 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1337/1337 places, 1814/1814 transitions.
Graph (trivial) has 1268 edges and 1337 vertex of which 121 / 1337 are part of one of the 20 SCC in 1 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 103 place count 1235 transition count 1609
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 1 with 102 rules applied. Total rules applied 205 place count 1133 transition count 1609
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 205 place count 1133 transition count 1564
Deduced a syphon composed of 45 places in 2 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 295 place count 1088 transition count 1564
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 357 place count 1026 transition count 1502
Iterating global reduction 2 with 62 rules applied. Total rules applied 419 place count 1026 transition count 1502
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 421 place count 1026 transition count 1500
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 421 place count 1026 transition count 1499
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 423 place count 1025 transition count 1499
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 430 place count 1018 transition count 1492
Iterating global reduction 3 with 7 rules applied. Total rules applied 437 place count 1018 transition count 1492
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 444 place count 1018 transition count 1485
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 4 with 244 rules applied. Total rules applied 688 place count 896 transition count 1363
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 694 place count 890 transition count 1357
Iterating global reduction 4 with 6 rules applied. Total rules applied 700 place count 890 transition count 1357
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 706 place count 890 transition count 1351
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 726 place count 890 transition count 1331
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 728 place count 888 transition count 1329
Applied a total of 728 rules in 857 ms. Remains 888 /1337 variables (removed 449) and now considering 1329/1814 (removed 485) transitions.
[2022-05-16 01:22:33] [INFO ] Flow matrix only has 1291 transitions (discarded 38 similar events)
// Phase 1: matrix 1291 rows 888 cols
[2022-05-16 01:22:33] [INFO ] Computed 22 place invariants in 45 ms
[2022-05-16 01:22:34] [INFO ] Implicit Places using invariants in 1381 ms returned []
[2022-05-16 01:22:34] [INFO ] Flow matrix only has 1291 transitions (discarded 38 similar events)
// Phase 1: matrix 1291 rows 888 cols
[2022-05-16 01:22:34] [INFO ] Computed 22 place invariants in 42 ms
[2022-05-16 01:22:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 01:22:36] [INFO ] Implicit Places using invariants and state equation in 2298 ms returned []
Implicit Place search using SMT with State Equation took 3684 ms to find 0 implicit places.
[2022-05-16 01:22:36] [INFO ] Redundant transitions in 30 ms returned []
[2022-05-16 01:22:36] [INFO ] Flow matrix only has 1291 transitions (discarded 38 similar events)
// Phase 1: matrix 1291 rows 888 cols
[2022-05-16 01:22:36] [INFO ] Computed 22 place invariants in 45 ms
[2022-05-16 01:22:38] [INFO ] Dead Transitions using invariants and state equation in 1283 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 888/1337 places, 1329/1814 transitions.
Finished structural reductions, in 1 iterations. Remains : 888/1337 places, 1329/1814 transitions.
Stuttering acceptance computed with spot in 350 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={0, 1} source=0 dest: 2}], [{ cond=p0, acceptance={1} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0, 1} source=2 dest: 3}, { cond=true, acceptance={1} source=2 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={1} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={1} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s459 1), p2:(AND (EQ s162 1) (EQ s207 1) (EQ s638 1)), p1:(AND (EQ s229 1) (EQ s887 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-08 finished in 6248 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 1337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1337/1337 places, 1814/1814 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1314 transition count 1791
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1314 transition count 1791
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 1314 transition count 1789
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 66 place count 1296 transition count 1771
Iterating global reduction 1 with 18 rules applied. Total rules applied 84 place count 1296 transition count 1771
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 97 place count 1296 transition count 1758
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 100 place count 1293 transition count 1755
Iterating global reduction 2 with 3 rules applied. Total rules applied 103 place count 1293 transition count 1755
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 1293 transition count 1754
Applied a total of 104 rules in 366 ms. Remains 1293 /1337 variables (removed 44) and now considering 1754/1814 (removed 60) transitions.
// Phase 1: matrix 1754 rows 1293 cols
[2022-05-16 01:22:38] [INFO ] Computed 22 place invariants in 48 ms
[2022-05-16 01:22:40] [INFO ] Implicit Places using invariants in 1632 ms returned []
// Phase 1: matrix 1754 rows 1293 cols
[2022-05-16 01:22:40] [INFO ] Computed 22 place invariants in 44 ms
[2022-05-16 01:22:42] [INFO ] Implicit Places using invariants and state equation in 2305 ms returned []
Implicit Place search using SMT with State Equation took 3941 ms to find 0 implicit places.
// Phase 1: matrix 1754 rows 1293 cols
[2022-05-16 01:22:42] [INFO ] Computed 22 place invariants in 28 ms
[2022-05-16 01:22:44] [INFO ] Dead Transitions using invariants and state equation in 2091 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1293/1337 places, 1754/1814 transitions.
Finished structural reductions, in 1 iterations. Remains : 1293/1337 places, 1754/1814 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-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:(OR (EQ s1265 1) (AND (EQ s400 1) (EQ s784 1) (EQ s1082 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 126 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-09 finished in 6484 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(G(F(G((X(p0)&&F(p0)&&p1))))))) U p0))'
Support contains 2 out of 1337 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1337/1337 places, 1814/1814 transitions.
Graph (trivial) has 909 edges and 1337 vertex of which 121 / 1337 are part of one of the 20 SCC in 0 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 1235 transition count 1613
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 1137 transition count 1613
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 197 place count 1137 transition count 1565
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 293 place count 1089 transition count 1565
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 356 place count 1026 transition count 1502
Iterating global reduction 2 with 63 rules applied. Total rules applied 419 place count 1026 transition count 1502
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 422 place count 1026 transition count 1499
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 422 place count 1026 transition count 1498
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 424 place count 1025 transition count 1498
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 431 place count 1018 transition count 1491
Iterating global reduction 3 with 7 rules applied. Total rules applied 438 place count 1018 transition count 1491
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 445 place count 1018 transition count 1484
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 1 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 4 with 244 rules applied. Total rules applied 689 place count 896 transition count 1362
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 696 place count 889 transition count 1355
Iterating global reduction 4 with 7 rules applied. Total rules applied 703 place count 889 transition count 1355
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 710 place count 889 transition count 1348
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 712 place count 887 transition count 1346
Applied a total of 712 rules in 315 ms. Remains 887 /1337 variables (removed 450) and now considering 1346/1814 (removed 468) transitions.
[2022-05-16 01:22:45] [INFO ] Flow matrix only has 1288 transitions (discarded 58 similar events)
// Phase 1: matrix 1288 rows 887 cols
[2022-05-16 01:22:45] [INFO ] Computed 22 place invariants in 26 ms
[2022-05-16 01:22:46] [INFO ] Implicit Places using invariants in 1461 ms returned []
[2022-05-16 01:22:46] [INFO ] Flow matrix only has 1288 transitions (discarded 58 similar events)
// Phase 1: matrix 1288 rows 887 cols
[2022-05-16 01:22:46] [INFO ] Computed 22 place invariants in 44 ms
[2022-05-16 01:22:48] [INFO ] Implicit Places using invariants and state equation in 1658 ms returned []
Implicit Place search using SMT with State Equation took 3122 ms to find 0 implicit places.
[2022-05-16 01:22:48] [INFO ] Redundant transitions in 59 ms returned []
[2022-05-16 01:22:48] [INFO ] Flow matrix only has 1288 transitions (discarded 58 similar events)
// Phase 1: matrix 1288 rows 887 cols
[2022-05-16 01:22:48] [INFO ] Computed 22 place invariants in 27 ms
[2022-05-16 01:22:49] [INFO ] Dead Transitions using invariants and state equation in 1328 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 887/1337 places, 1346/1814 transitions.
Finished structural reductions, in 1 iterations. Remains : 887/1337 places, 1346/1814 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s809 1), p1:(EQ s884 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-10 finished in 4909 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(F(X(F(X(X(p0)))))))))'
Support contains 1 out of 1337 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1337/1337 places, 1814/1814 transitions.
Graph (trivial) has 1274 edges and 1337 vertex of which 121 / 1337 are part of one of the 20 SCC in 1 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 103 place count 1235 transition count 1609
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 1 with 102 rules applied. Total rules applied 205 place count 1133 transition count 1609
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 205 place count 1133 transition count 1565
Deduced a syphon composed of 44 places in 2 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 293 place count 1089 transition count 1565
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 356 place count 1026 transition count 1502
Iterating global reduction 2 with 63 rules applied. Total rules applied 419 place count 1026 transition count 1502
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 422 place count 1026 transition count 1499
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 422 place count 1026 transition count 1497
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 426 place count 1024 transition count 1497
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 433 place count 1017 transition count 1490
Iterating global reduction 3 with 7 rules applied. Total rules applied 440 place count 1017 transition count 1490
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 446 place count 1017 transition count 1484
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 1 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 4 with 244 rules applied. Total rules applied 690 place count 895 transition count 1362
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 697 place count 888 transition count 1355
Iterating global reduction 4 with 7 rules applied. Total rules applied 704 place count 888 transition count 1355
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 711 place count 888 transition count 1348
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 731 place count 888 transition count 1328
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 733 place count 886 transition count 1326
Applied a total of 733 rules in 821 ms. Remains 886 /1337 variables (removed 451) and now considering 1326/1814 (removed 488) transitions.
[2022-05-16 01:22:50] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
// Phase 1: matrix 1287 rows 886 cols
[2022-05-16 01:22:50] [INFO ] Computed 22 place invariants in 45 ms
[2022-05-16 01:22:51] [INFO ] Implicit Places using invariants in 1188 ms returned []
[2022-05-16 01:22:51] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
// Phase 1: matrix 1287 rows 886 cols
[2022-05-16 01:22:51] [INFO ] Computed 22 place invariants in 43 ms
[2022-05-16 01:22:53] [INFO ] Implicit Places using invariants and state equation in 1764 ms returned []
Implicit Place search using SMT with State Equation took 2954 ms to find 0 implicit places.
[2022-05-16 01:22:53] [INFO ] Redundant transitions in 32 ms returned []
[2022-05-16 01:22:53] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
// Phase 1: matrix 1287 rows 886 cols
[2022-05-16 01:22:53] [INFO ] Computed 22 place invariants in 29 ms
[2022-05-16 01:22:54] [INFO ] Dead Transitions using invariants and state equation in 1104 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 886/1337 places, 1326/1814 transitions.
Finished structural reductions, in 1 iterations. Remains : 886/1337 places, 1326/1814 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s183 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-12 finished in 5018 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(X(p0)))||G(p1))))'
Support contains 2 out of 1337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1337/1337 places, 1814/1814 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1314 transition count 1791
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1314 transition count 1791
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 1314 transition count 1788
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 67 place count 1296 transition count 1770
Iterating global reduction 1 with 18 rules applied. Total rules applied 85 place count 1296 transition count 1770
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 97 place count 1296 transition count 1758
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 101 place count 1292 transition count 1754
Iterating global reduction 2 with 4 rules applied. Total rules applied 105 place count 1292 transition count 1754
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 1292 transition count 1753
Applied a total of 106 rules in 359 ms. Remains 1292 /1337 variables (removed 45) and now considering 1753/1814 (removed 61) transitions.
// Phase 1: matrix 1753 rows 1292 cols
[2022-05-16 01:22:55] [INFO ] Computed 22 place invariants in 46 ms
[2022-05-16 01:22:56] [INFO ] Implicit Places using invariants in 1685 ms returned []
// Phase 1: matrix 1753 rows 1292 cols
[2022-05-16 01:22:56] [INFO ] Computed 22 place invariants in 43 ms
[2022-05-16 01:22:59] [INFO ] Implicit Places using invariants and state equation in 2820 ms returned []
Implicit Place search using SMT with State Equation took 4507 ms to find 0 implicit places.
// Phase 1: matrix 1753 rows 1292 cols
[2022-05-16 01:22:59] [INFO ] Computed 22 place invariants in 44 ms
[2022-05-16 01:23:01] [INFO ] Dead Transitions using invariants and state equation in 1807 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1292/1337 places, 1753/1814 transitions.
Finished structural reductions, in 1 iterations. Remains : 1292/1337 places, 1753/1814 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(EQ s393 0), p1:(EQ s1287 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, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 952 ms.
Product exploration explored 100000 steps with 25000 reset in 800 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 73 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 154684 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 154684 steps, saw 78569 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1753 rows 1292 cols
[2022-05-16 01:23:07] [INFO ] Computed 22 place invariants in 27 ms
[2022-05-16 01:23:07] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-16 01:23:07] [INFO ] [Nat]Absence check using 22 positive place invariants in 18 ms returned sat
[2022-05-16 01:23:08] [INFO ] After 1148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-16 01:23:09] [INFO ] After 1475ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 279 ms.
[2022-05-16 01:23:09] [INFO ] After 2086ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 735 steps, including 2 resets, run visited all 1 properties in 6 ms. (steps per millisecond=122 )
Parikh walk visited 3 properties in 16 ms.
Knowledge obtained : [(AND p0 p1), (X p1), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 297 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1292/1292 places, 1753/1753 transitions.
Applied a total of 0 rules in 84 ms. Remains 1292 /1292 variables (removed 0) and now considering 1753/1753 (removed 0) transitions.
// Phase 1: matrix 1753 rows 1292 cols
[2022-05-16 01:23:10] [INFO ] Computed 22 place invariants in 52 ms
[2022-05-16 01:23:11] [INFO ] Implicit Places using invariants in 1576 ms returned []
// Phase 1: matrix 1753 rows 1292 cols
[2022-05-16 01:23:12] [INFO ] Computed 22 place invariants in 40 ms
[2022-05-16 01:23:14] [INFO ] Implicit Places using invariants and state equation in 2222 ms returned []
Implicit Place search using SMT with State Equation took 3800 ms to find 0 implicit places.
// Phase 1: matrix 1753 rows 1292 cols
[2022-05-16 01:23:14] [INFO ] Computed 22 place invariants in 29 ms
[2022-05-16 01:23:15] [INFO ] Dead Transitions using invariants and state equation in 1631 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1292/1292 places, 1753/1753 transitions.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 74 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 129675 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 129675 steps, saw 69728 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1753 rows 1292 cols
[2022-05-16 01:23:19] [INFO ] Computed 22 place invariants in 39 ms
[2022-05-16 01:23:19] [INFO ] After 353ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-16 01:23:20] [INFO ] [Nat]Absence check using 22 positive place invariants in 28 ms returned sat
[2022-05-16 01:23:21] [INFO ] After 1240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-16 01:23:22] [INFO ] After 1698ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 303 ms.
[2022-05-16 01:23:22] [INFO ] After 2543ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 664 steps, including 2 resets, run visited all 3 properties in 30 ms. (steps per millisecond=22 )
Parikh walk visited 3 properties in 45 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 202 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 1089 ms.
Product exploration explored 100000 steps with 25000 reset in 1095 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1292 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1292/1292 places, 1753/1753 transitions.
Graph (trivial) has 1228 edges and 1292 vertex of which 121 / 1292 are part of one of the 20 SCC in 1 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 1191 transition count 1651
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 59 Pre rules applied. Total rules applied 80 place count 1191 transition count 1651
Deduced a syphon composed of 138 places in 2 ms
Iterating global reduction 1 with 59 rules applied. Total rules applied 139 place count 1191 transition count 1651
Discarding 97 places :
Symmetric choice reduction at 1 with 97 rule applications. Total rules 236 place count 1094 transition count 1554
Deduced a syphon composed of 80 places in 2 ms
Iterating global reduction 1 with 97 rules applied. Total rules applied 333 place count 1094 transition count 1554
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 186 places in 0 ms
Iterating global reduction 1 with 106 rules applied. Total rules applied 439 place count 1094 transition count 1594
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 483 place count 1050 transition count 1550
Deduced a syphon composed of 142 places in 1 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 527 place count 1050 transition count 1550
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 162 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 547 place count 1050 transition count 1590
Deduced a syphon composed of 162 places in 0 ms
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 1 with 40 rules applied. Total rules applied 587 place count 1050 transition count 1550
Deduced a syphon composed of 162 places in 0 ms
Applied a total of 587 rules in 1234 ms. Remains 1050 /1292 variables (removed 242) and now considering 1550/1753 (removed 203) transitions.
[2022-05-16 01:23:27] [INFO ] Redundant transitions in 39 ms returned []
[2022-05-16 01:23:27] [INFO ] Flow matrix only has 1511 transitions (discarded 39 similar events)
// Phase 1: matrix 1511 rows 1050 cols
[2022-05-16 01:23:27] [INFO ] Computed 22 place invariants in 32 ms
[2022-05-16 01:23:29] [INFO ] Dead Transitions using invariants and state equation in 1493 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1050/1292 places, 1550/1753 transitions.
Finished structural reductions, in 1 iterations. Remains : 1050/1292 places, 1550/1753 transitions.
Product exploration explored 100000 steps with 25000 reset in 3585 ms.
Product exploration explored 100000 steps with 25000 reset in 3245 ms.
Built C files in :
/tmp/ltsmin10975688762594013157
[2022-05-16 01:23:35] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10975688762594013157
Running compilation step : cd /tmp/ltsmin10975688762594013157;'/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/ltsmin10975688762594013157;'/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/ltsmin10975688762594013157;'/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 1292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1292/1292 places, 1753/1753 transitions.
Applied a total of 0 rules in 47 ms. Remains 1292 /1292 variables (removed 0) and now considering 1753/1753 (removed 0) transitions.
// Phase 1: matrix 1753 rows 1292 cols
[2022-05-16 01:23:38] [INFO ] Computed 22 place invariants in 38 ms
[2022-05-16 01:23:40] [INFO ] Implicit Places using invariants in 1068 ms returned []
// Phase 1: matrix 1753 rows 1292 cols
[2022-05-16 01:23:40] [INFO ] Computed 22 place invariants in 28 ms
[2022-05-16 01:23:41] [INFO ] Implicit Places using invariants and state equation in 1983 ms returned []
Implicit Place search using SMT with State Equation took 3054 ms to find 0 implicit places.
// Phase 1: matrix 1753 rows 1292 cols
[2022-05-16 01:23:42] [INFO ] Computed 22 place invariants in 27 ms
[2022-05-16 01:23:43] [INFO ] Dead Transitions using invariants and state equation in 1917 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1292/1292 places, 1753/1753 transitions.
Built C files in :
/tmp/ltsmin6922374398961896454
[2022-05-16 01:23:43] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6922374398961896454
Running compilation step : cd /tmp/ltsmin6922374398961896454;'/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/ltsmin6922374398961896454;'/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/ltsmin6922374398961896454;'/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-16 01:23:47] [INFO ] Flatten gal took : 57 ms
[2022-05-16 01:23:47] [INFO ] Flatten gal took : 59 ms
[2022-05-16 01:23:47] [INFO ] Time to serialize gal into /tmp/LTL1546718550557338762.gal : 12 ms
[2022-05-16 01:23:47] [INFO ] Time to serialize properties into /tmp/LTL7484573219214103058.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/LTL1546718550557338762.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7484573219214103058.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/LTL1546718...266
Read 1 LTL properties
Checking formula 0 : !((X((F(X(X("(p1566==0)"))))||(G("(p5361==0)")))))
Formula 0 simplified : !X(FXX"(p1566==0)" | G"(p5361==0)")
Detected timeout of ITS tools.
[2022-05-16 01:24:02] [INFO ] Flatten gal took : 47 ms
[2022-05-16 01:24:02] [INFO ] Applying decomposition
[2022-05-16 01:24:02] [INFO ] Flatten gal took : 65 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/graph11299779811860277640.txt' '-o' '/tmp/graph11299779811860277640.bin' '-w' '/tmp/graph11299779811860277640.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11299779811860277640.bin' '-l' '-1' '-v' '-w' '/tmp/graph11299779811860277640.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:24:02] [INFO ] Decomposing Gal with order
[2022-05-16 01:24:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:24:02] [INFO ] Removed a total of 520 redundant transitions.
[2022-05-16 01:24:02] [INFO ] Flatten gal took : 262 ms
[2022-05-16 01:24:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 26 ms.
[2022-05-16 01:24:03] [INFO ] Time to serialize gal into /tmp/LTL3274012226132238207.gal : 20 ms
[2022-05-16 01:24:03] [INFO ] Time to serialize properties into /tmp/LTL17194572759799284717.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/LTL3274012226132238207.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17194572759799284717.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/LTL3274012...246
Read 1 LTL properties
Checking formula 0 : !((X((F(X(X("(i9.u100.p1566==0)"))))||(G("(i21.i3.i5.u211.p5361==0)")))))
Formula 0 simplified : !X(FXX"(i9.u100.p1566==0)" | G"(i21.i3.i5.u211.p5361==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17094231148195625081
[2022-05-16 01:24:18] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17094231148195625081
Running compilation step : cd /tmp/ltsmin17094231148195625081;'/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/ltsmin17094231148195625081;'/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/ltsmin17094231148195625081;'/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-20b-LTLFireability-14 finished in 86349 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1337 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1337/1337 places, 1814/1814 transitions.
Graph (trivial) has 1274 edges and 1337 vertex of which 121 / 1337 are part of one of the 20 SCC in 2 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 103 place count 1235 transition count 1609
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 1 with 102 rules applied. Total rules applied 205 place count 1133 transition count 1609
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 205 place count 1133 transition count 1564
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 295 place count 1088 transition count 1564
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 358 place count 1025 transition count 1501
Iterating global reduction 2 with 63 rules applied. Total rules applied 421 place count 1025 transition count 1501
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 424 place count 1025 transition count 1498
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 424 place count 1025 transition count 1496
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 428 place count 1023 transition count 1496
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 435 place count 1016 transition count 1489
Iterating global reduction 3 with 7 rules applied. Total rules applied 442 place count 1016 transition count 1489
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 449 place count 1016 transition count 1482
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 4 with 244 rules applied. Total rules applied 693 place count 894 transition count 1360
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 699 place count 888 transition count 1354
Iterating global reduction 4 with 6 rules applied. Total rules applied 705 place count 888 transition count 1354
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 711 place count 888 transition count 1348
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 731 place count 888 transition count 1328
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 733 place count 886 transition count 1326
Applied a total of 733 rules in 542 ms. Remains 886 /1337 variables (removed 451) and now considering 1326/1814 (removed 488) transitions.
[2022-05-16 01:24:21] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
// Phase 1: matrix 1287 rows 886 cols
[2022-05-16 01:24:21] [INFO ] Computed 22 place invariants in 30 ms
[2022-05-16 01:24:22] [INFO ] Implicit Places using invariants in 702 ms returned []
[2022-05-16 01:24:22] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
// Phase 1: matrix 1287 rows 886 cols
[2022-05-16 01:24:22] [INFO ] Computed 22 place invariants in 30 ms
[2022-05-16 01:24:23] [INFO ] Implicit Places using invariants and state equation in 1477 ms returned []
Implicit Place search using SMT with State Equation took 2185 ms to find 0 implicit places.
[2022-05-16 01:24:23] [INFO ] Redundant transitions in 46 ms returned []
[2022-05-16 01:24:23] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
// Phase 1: matrix 1287 rows 886 cols
[2022-05-16 01:24:23] [INFO ] Computed 22 place invariants in 48 ms
[2022-05-16 01:24:25] [INFO ] Dead Transitions using invariants and state equation in 1458 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 886/1337 places, 1326/1814 transitions.
Finished structural reductions, in 1 iterations. Remains : 886/1337 places, 1326/1814 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s340 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-15 finished in 4301 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((p0||(F(p1)&&p2))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((X(G((F(G(p0))||p1)))||F(X(p2)))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(X(p0)))||G(p1))))'
[2022-05-16 01:24:25] [INFO ] Flatten gal took : 75 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10237821011819802865
[2022-05-16 01:24:26] [INFO ] Too many transitions (1814) to apply POR reductions. Disabling POR matrices.
[2022-05-16 01:24:26] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10237821011819802865
Running compilation step : cd /tmp/ltsmin10237821011819802865;'/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-16 01:24:26] [INFO ] Applying decomposition
[2022-05-16 01:24:26] [INFO ] Flatten gal took : 77 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/graph13293038344917851531.txt' '-o' '/tmp/graph13293038344917851531.bin' '-w' '/tmp/graph13293038344917851531.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13293038344917851531.bin' '-l' '-1' '-v' '-w' '/tmp/graph13293038344917851531.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:24:26] [INFO ] Decomposing Gal with order
[2022-05-16 01:24:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:24:26] [INFO ] Removed a total of 552 redundant transitions.
[2022-05-16 01:24:26] [INFO ] Flatten gal took : 327 ms
[2022-05-16 01:24:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 22 ms.
[2022-05-16 01:24:26] [INFO ] Time to serialize gal into /tmp/LTLFireability5841195350041879074.gal : 15 ms
[2022-05-16 01:24:26] [INFO ] Time to serialize properties into /tmp/LTLFireability4327383301732321995.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/LTLFireability5841195350041879074.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4327383301732321995.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 : !((F(G(X(("(i4.u48.p779==0)")||((F("(i21.u206.p4916==0)"))&&("(i8.u95.p1631==0)")))))))
Formula 0 simplified : !FGX("(i4.u48.p779==0)" | ("(i8.u95.p1631==0)" & F"(i21.u206.p4916==0)"))
Compilation finished in 5857 ms.
Running link step : cd /tmp/ltsmin10237821011819802865;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 174 ms.
Running LTSmin : cd /tmp/ltsmin10237821011819802865;'/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))&&(LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin10237821011819802865;'/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))&&(LTLAPp2==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10237821011819802865;'/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(<>([]((X([]((<>([]((LTLAPp3==true)))||(LTLAPp4==true))))||<>(X((LTLAPp5==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-16 01:46:19] [INFO ] Applying decomposition
[2022-05-16 01:46:19] [INFO ] Flatten gal took : 136 ms
[2022-05-16 01:46:19] [INFO ] Decomposing Gal with order
[2022-05-16 01:46:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:46:20] [INFO ] Removed a total of 502 redundant transitions.
[2022-05-16 01:46:20] [INFO ] Flatten gal took : 725 ms
[2022-05-16 01:46:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 1664 labels/synchronizations in 735 ms.
[2022-05-16 01:46:21] [INFO ] Time to serialize gal into /tmp/LTLFireability375581309128848824.gal : 37 ms
[2022-05-16 01:46:21] [INFO ] Time to serialize properties into /tmp/LTLFireability4183764171243122831.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/LTLFireability375581309128848824.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4183764171243122831.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...266
Read 3 LTL properties
Checking formula 0 : !((F(G(X(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u24.p779==0)")||((F("(i1.u41.p4916==0)"))&&("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i...184
Formula 0 simplified : !FGX("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u24.p779==0)" | ("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u28.p1631==0)" & F"(i1...172
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin10237821011819802865;'/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(<>([]((X([]((<>([]((LTLAPp3==true)))||(LTLAPp4==true))))||<>(X((LTLAPp5==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10237821011819802865;'/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((<>(X(X((LTLAPp6==true))))||[]((LTLAPp7==true))))' '--buchi-type=spotba'
LTSmin run took 829 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin10237821011819802865;'/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))&&(LTLAPp2==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-16 02:08:16] [INFO ] Flatten gal took : 651 ms
[2022-05-16 02:08:20] [INFO ] Input system was already deterministic with 1814 transitions.
[2022-05-16 02:08:20] [INFO ] Transformed 1337 places.
[2022-05-16 02:08:20] [INFO ] Transformed 1814 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-16 02:08:21] [INFO ] Time to serialize gal into /tmp/LTLFireability10592493052674758321.gal : 53 ms
[2022-05-16 02:08:21] [INFO ] Time to serialize properties into /tmp/LTLFireability4248427821349639014.ltl : 3 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/LTLFireability10592493052674758321.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4248427821349639014.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(X(("(p779==0)")||((F("(p4916==0)"))&&("(p1631==0)")))))))
Formula 0 simplified : !FGX("(p779==0)" | ("(p1631==0)" & F"(p4916==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-20b"
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-20b, 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-165260575800140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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