fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r064-tall-162038397100365
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for DLCround-PT-08b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16247.716 3600000.00 2071764.00 890288.70 FFFFFFF?FFFFFF?F normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 120K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 15:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 08:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 08:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 15:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 15:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.1M May 5 16:51 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 DLCround-PT-08b-00
FORMULA_NAME DLCround-PT-08b-01
FORMULA_NAME DLCround-PT-08b-02
FORMULA_NAME DLCround-PT-08b-03
FORMULA_NAME DLCround-PT-08b-04
FORMULA_NAME DLCround-PT-08b-05
FORMULA_NAME DLCround-PT-08b-06
FORMULA_NAME DLCround-PT-08b-07
FORMULA_NAME DLCround-PT-08b-08
FORMULA_NAME DLCround-PT-08b-09
FORMULA_NAME DLCround-PT-08b-10
FORMULA_NAME DLCround-PT-08b-11
FORMULA_NAME DLCround-PT-08b-12
FORMULA_NAME DLCround-PT-08b-13
FORMULA_NAME DLCround-PT-08b-14
FORMULA_NAME DLCround-PT-08b-15

=== Now, execution of the tool begins

BK_START 1620516441743

Running Version 0
[2021-05-08 23:27:30] [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]
[2021-05-08 23:27:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 23:27:30] [INFO ] Load time of PNML (sax parser for PT used): 196 ms
[2021-05-08 23:27:30] [INFO ] Transformed 3088 places.
[2021-05-08 23:27:30] [INFO ] Transformed 4732 transitions.
[2021-05-08 23:27:30] [INFO ] Found NUPN structural information;
[2021-05-08 23:27:30] [INFO ] Parsed PT model containing 3088 places and 4732 transitions in 292 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-08 23:27:30] [INFO ] Initial state test concluded for 2 properties.
FORMULA DLCround-PT-08b-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-08b-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 3088 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3088/3088 places, 4732/4732 transitions.
Discarding 536 places :
Symmetric choice reduction at 0 with 536 rule applications. Total rules 536 place count 2552 transition count 4196
Iterating global reduction 0 with 536 rules applied. Total rules applied 1072 place count 2552 transition count 4196
Discarding 427 places :
Symmetric choice reduction at 0 with 427 rule applications. Total rules 1499 place count 2125 transition count 3769
Iterating global reduction 0 with 427 rules applied. Total rules applied 1926 place count 2125 transition count 3769
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 1935 place count 2125 transition count 3760
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 1996 place count 2064 transition count 3618
Iterating global reduction 1 with 61 rules applied. Total rules applied 2057 place count 2064 transition count 3618
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 2093 place count 2028 transition count 3582
Iterating global reduction 1 with 36 rules applied. Total rules applied 2129 place count 2028 transition count 3582
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 2133 place count 2028 transition count 3578
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 2151 place count 2010 transition count 3560
Iterating global reduction 2 with 18 rules applied. Total rules applied 2169 place count 2010 transition count 3560
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 2187 place count 1992 transition count 3542
Iterating global reduction 2 with 18 rules applied. Total rules applied 2205 place count 1992 transition count 3542
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 2223 place count 1974 transition count 3524
Iterating global reduction 2 with 18 rules applied. Total rules applied 2241 place count 1974 transition count 3524
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 2251 place count 1964 transition count 3514
Iterating global reduction 2 with 10 rules applied. Total rules applied 2261 place count 1964 transition count 3514
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 2267 place count 1958 transition count 3508
Iterating global reduction 2 with 6 rules applied. Total rules applied 2273 place count 1958 transition count 3508
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 2279 place count 1952 transition count 3502
Iterating global reduction 2 with 6 rules applied. Total rules applied 2285 place count 1952 transition count 3502
Applied a total of 2285 rules in 1505 ms. Remains 1952 /3088 variables (removed 1136) and now considering 3502/4732 (removed 1230) transitions.
// Phase 1: matrix 3502 rows 1952 cols
[2021-05-08 23:27:32] [INFO ] Computed 157 place invariants in 32 ms
[2021-05-08 23:27:33] [INFO ] Implicit Places using invariants in 744 ms returned []
// Phase 1: matrix 3502 rows 1952 cols
[2021-05-08 23:27:33] [INFO ] Computed 157 place invariants in 29 ms
[2021-05-08 23:27:35] [INFO ] Implicit Places using invariants and state equation in 1807 ms returned []
Implicit Place search using SMT with State Equation took 2575 ms to find 0 implicit places.
// Phase 1: matrix 3502 rows 1952 cols
[2021-05-08 23:27:35] [INFO ] Computed 157 place invariants in 13 ms
[2021-05-08 23:27:36] [INFO ] Dead Transitions using invariants and state equation in 1789 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1952/3088 places, 3502/4732 transitions.
[2021-05-08 23:27:37] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-08 23:27:37] [INFO ] Flatten gal took : 221 ms
FORMULA DLCround-PT-08b-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 23:27:37] [INFO ] Flatten gal took : 162 ms
[2021-05-08 23:27:37] [INFO ] Input system was already deterministic with 3502 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 876 ms. (steps per millisecond=114 ) properties (out of 34) seen :31
Running SMT prover for 3 properties.
// Phase 1: matrix 3502 rows 1952 cols
[2021-05-08 23:27:44] [INFO ] Computed 157 place invariants in 14 ms
[2021-05-08 23:27:45] [INFO ] [Real]Absence check using 157 positive place invariants in 82 ms returned sat
[2021-05-08 23:27:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:27:46] [INFO ] [Real]Absence check using state equation in 970 ms returned sat
[2021-05-08 23:27:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:27:46] [INFO ] [Nat]Absence check using 157 positive place invariants in 87 ms returned sat
[2021-05-08 23:27:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:27:47] [INFO ] [Nat]Absence check using state equation in 970 ms returned sat
[2021-05-08 23:27:47] [INFO ] Computed and/alt/rep : 3256/5444/3256 causal constraints (skipped 245 transitions) in 182 ms.
[2021-05-08 23:28:07] [INFO ] Deduced a trap composed of 8 places in 992 ms of which 13 ms to minimize.
[2021-05-08 23:28:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-08 23:28:07] [INFO ] [Real]Absence check using 157 positive place invariants in 85 ms returned sat
[2021-05-08 23:28:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:28:08] [INFO ] [Real]Absence check using state equation in 886 ms returned sat
[2021-05-08 23:28:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:28:08] [INFO ] [Nat]Absence check using 157 positive place invariants in 85 ms returned sat
[2021-05-08 23:28:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:28:09] [INFO ] [Nat]Absence check using state equation in 908 ms returned sat
[2021-05-08 23:28:09] [INFO ] Computed and/alt/rep : 3256/5444/3256 causal constraints (skipped 245 transitions) in 179 ms.
[2021-05-08 23:28:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-08 23:28:34] [INFO ] [Real]Absence check using 157 positive place invariants in 84 ms returned sat
[2021-05-08 23:28:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:28:34] [INFO ] [Real]Absence check using state equation in 899 ms returned sat
[2021-05-08 23:28:35] [INFO ] Computed and/alt/rep : 3256/5444/3256 causal constraints (skipped 245 transitions) in 163 ms.
[2021-05-08 23:28:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:28:36] [INFO ] [Nat]Absence check using 157 positive place invariants in 97 ms returned sat
[2021-05-08 23:28:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:28:37] [INFO ] [Nat]Absence check using state equation in 877 ms returned sat
[2021-05-08 23:28:37] [INFO ] Computed and/alt/rep : 3256/5444/3256 causal constraints (skipped 245 transitions) in 168 ms.
[2021-05-08 23:28:56] [INFO ] Added : 685 causal constraints over 137 iterations in 18756 ms. Result :unknown
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(X(X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1952 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1952/1952 places, 3502/3502 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1934 transition count 3462
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1934 transition count 3462
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 1924 transition count 3452
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 1924 transition count 3452
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 1921 transition count 3449
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 1921 transition count 3449
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 1918 transition count 3446
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 1918 transition count 3446
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 1915 transition count 3443
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 1915 transition count 3443
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 1913 transition count 3441
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 1913 transition count 3441
Applied a total of 78 rules in 450 ms. Remains 1913 /1952 variables (removed 39) and now considering 3441/3502 (removed 61) transitions.
// Phase 1: matrix 3441 rows 1913 cols
[2021-05-08 23:28:57] [INFO ] Computed 157 place invariants in 8 ms
[2021-05-08 23:28:57] [INFO ] Implicit Places using invariants in 555 ms returned []
// Phase 1: matrix 3441 rows 1913 cols
[2021-05-08 23:28:57] [INFO ] Computed 157 place invariants in 8 ms
[2021-05-08 23:28:59] [INFO ] Implicit Places using invariants and state equation in 1659 ms returned []
Implicit Place search using SMT with State Equation took 2216 ms to find 0 implicit places.
// Phase 1: matrix 3441 rows 1913 cols
[2021-05-08 23:28:59] [INFO ] Computed 157 place invariants in 15 ms
[2021-05-08 23:29:00] [INFO ] Dead Transitions using invariants and state equation in 1559 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1913/1952 places, 3441/3502 transitions.
Stuttering acceptance computed with spot in 6901 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : DLCround-PT-08b-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s1110 1), p1:(NEQ s1584 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 30051 steps with 2 reset in 299 ms.
FORMULA DLCround-PT-08b-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-08b-00 finished in 11486 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((F(p0)||X(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1952 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1952/1952 places, 3502/3502 transitions.
Graph (trivial) has 1735 edges and 1952 vertex of which 488 / 1952 are part of one of the 40 SCC in 7 ms
Free SCC test removed 448 places
Ensure Unique test removed 482 transitions
Reduce isomorphic transitions removed 482 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 311 transitions
Trivial Post-agglo rules discarded 311 transitions
Performed 311 trivial Post agglomeration. Transition count delta: 311
Iterating post reduction 0 with 311 rules applied. Total rules applied 312 place count 1503 transition count 2708
Reduce places removed 311 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 351 rules applied. Total rules applied 663 place count 1192 transition count 2668
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 689 place count 1166 transition count 2668
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 149 Pre rules applied. Total rules applied 689 place count 1166 transition count 2519
Deduced a syphon composed of 149 places in 8 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 298 rules applied. Total rules applied 987 place count 1017 transition count 2519
Discarding 77 places :
Symmetric choice reduction at 3 with 77 rule applications. Total rules 1064 place count 940 transition count 2014
Iterating global reduction 3 with 77 rules applied. Total rules applied 1141 place count 940 transition count 2014
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1145 place count 940 transition count 2010
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 1145 place count 940 transition count 1999
Deduced a syphon composed of 11 places in 7 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 1167 place count 929 transition count 1999
Performed 352 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 352 places in 1 ms
Reduce places removed 352 places and 0 transitions.
Iterating global reduction 4 with 704 rules applied. Total rules applied 1871 place count 577 transition count 1639
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1879 place count 577 transition count 1631
Renaming transitions due to excessive name length > 1024 char.
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 1902 place count 554 transition count 1367
Iterating global reduction 5 with 23 rules applied. Total rules applied 1925 place count 554 transition count 1367
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 1948 place count 554 transition count 1344
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1972 place count 542 transition count 1443
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1976 place count 542 transition count 1439
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1980 place count 538 transition count 1363
Iterating global reduction 7 with 4 rules applied. Total rules applied 1984 place count 538 transition count 1363
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1988 place count 538 transition count 1359
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1996 place count 534 transition count 1389
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 8 with 37 rules applied. Total rules applied 2033 place count 534 transition count 1352
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 2051 place count 516 transition count 1316
Iterating global reduction 8 with 18 rules applied. Total rules applied 2069 place count 516 transition count 1316
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 2087 place count 498 transition count 1096
Iterating global reduction 8 with 18 rules applied. Total rules applied 2105 place count 498 transition count 1096
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 2123 place count 498 transition count 1078
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2124 place count 497 transition count 1077
Applied a total of 2124 rules in 537 ms. Remains 497 /1952 variables (removed 1455) and now considering 1077/3502 (removed 2425) transitions.
[2021-05-08 23:29:08] [INFO ] Flow matrix only has 1051 transitions (discarded 26 similar events)
// Phase 1: matrix 1051 rows 497 cols
[2021-05-08 23:29:08] [INFO ] Computed 157 place invariants in 12 ms
[2021-05-08 23:29:08] [INFO ] Implicit Places using invariants in 197 ms returned []
[2021-05-08 23:29:08] [INFO ] Flow matrix only has 1051 transitions (discarded 26 similar events)
// Phase 1: matrix 1051 rows 497 cols
[2021-05-08 23:29:08] [INFO ] Computed 157 place invariants in 3 ms
[2021-05-08 23:29:09] [INFO ] State equation strengthened by 50 read => feed constraints.
[2021-05-08 23:29:09] [INFO ] Implicit Places using invariants and state equation in 627 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
[2021-05-08 23:29:09] [INFO ] Redundant transitions in 67 ms returned []
[2021-05-08 23:29:09] [INFO ] Flow matrix only has 1051 transitions (discarded 26 similar events)
// Phase 1: matrix 1051 rows 497 cols
[2021-05-08 23:29:09] [INFO ] Computed 157 place invariants in 2 ms
[2021-05-08 23:29:09] [INFO ] Dead Transitions using invariants and state equation in 397 ms returned []
Finished structural reductions, in 1 iterations. Remains : 497/1952 places, 1077/3502 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-08b-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s461 1), p0:(OR (NEQ s44 1) (NEQ s183 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6509 steps with 1 reset in 64 ms.
FORMULA DLCround-PT-08b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-08b-01 finished in 1988 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(((p0&&F(p1)) U ((G(p0)||(p0&&F(p1)))&&X(X(G(p0)))))) U (X(G(((p0&&F(p1)) U ((G(p0)||(p0&&F(p1)))&&X(X(G(p0)))))))||(p1&&X(((p0&&F(p1)) U ((G(p0)||(p0&&F(p1)))&&X(X(G(p0))))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1952 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1952/1952 places, 3502/3502 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1933 transition count 3461
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1933 transition count 3461
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 49 place count 1922 transition count 3450
Iterating global reduction 0 with 11 rules applied. Total rules applied 60 place count 1922 transition count 3450
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 1919 transition count 3447
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 1919 transition count 3447
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 1916 transition count 3444
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 1916 transition count 3444
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 75 place count 1913 transition count 3441
Iterating global reduction 0 with 3 rules applied. Total rules applied 78 place count 1913 transition count 3441
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 1911 transition count 3439
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 1911 transition count 3439
Applied a total of 82 rules in 433 ms. Remains 1911 /1952 variables (removed 41) and now considering 3439/3502 (removed 63) transitions.
// Phase 1: matrix 3439 rows 1911 cols
[2021-05-08 23:29:10] [INFO ] Computed 157 place invariants in 7 ms
[2021-05-08 23:29:11] [INFO ] Implicit Places using invariants in 514 ms returned []
// Phase 1: matrix 3439 rows 1911 cols
[2021-05-08 23:29:11] [INFO ] Computed 157 place invariants in 8 ms
[2021-05-08 23:29:12] [INFO ] Implicit Places using invariants and state equation in 1681 ms returned []
Implicit Place search using SMT with State Equation took 2197 ms to find 0 implicit places.
// Phase 1: matrix 3439 rows 1911 cols
[2021-05-08 23:29:12] [INFO ] Computed 157 place invariants in 6 ms
[2021-05-08 23:29:14] [INFO ] Dead Transitions using invariants and state equation in 1602 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1911/1952 places, 3439/3502 transitions.
Stuttering acceptance computed with spot in 9917 ms :[(NOT p0), (NOT p0), true, (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-08b-02 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 5}, { cond=p1, acceptance={} source=0 dest: 6}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 1}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}, { cond=(AND p1 p0), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 2}, { cond=(AND p1 p0), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 7}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND p1 p0), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(OR (NEQ s183 1) (NEQ s1230 1)), p0:(NEQ s1320 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4874 steps with 0 reset in 39 ms.
FORMULA DLCround-PT-08b-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-08b-02 finished in 14225 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||(p1&&G(F(p2))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1952 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1952/1952 places, 3502/3502 transitions.
Graph (trivial) has 1734 edges and 1952 vertex of which 482 / 1952 are part of one of the 39 SCC in 2 ms
Free SCC test removed 443 places
Ensure Unique test removed 477 transitions
Reduce isomorphic transitions removed 477 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 313 transitions
Trivial Post-agglo rules discarded 313 transitions
Performed 313 trivial Post agglomeration. Transition count delta: 313
Iterating post reduction 0 with 313 rules applied. Total rules applied 314 place count 1508 transition count 2711
Reduce places removed 313 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 353 rules applied. Total rules applied 667 place count 1195 transition count 2671
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 693 place count 1169 transition count 2671
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 150 Pre rules applied. Total rules applied 693 place count 1169 transition count 2521
Deduced a syphon composed of 150 places in 8 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 300 rules applied. Total rules applied 993 place count 1019 transition count 2521
Discarding 77 places :
Symmetric choice reduction at 3 with 77 rule applications. Total rules 1070 place count 942 transition count 2016
Iterating global reduction 3 with 77 rules applied. Total rules applied 1147 place count 942 transition count 2016
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1151 place count 942 transition count 2012
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 1151 place count 942 transition count 2001
Deduced a syphon composed of 11 places in 7 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 1173 place count 931 transition count 2001
Performed 353 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 353 places in 1 ms
Reduce places removed 353 places and 0 transitions.
Iterating global reduction 4 with 706 rules applied. Total rules applied 1879 place count 578 transition count 1639
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1887 place count 578 transition count 1631
Renaming transitions due to excessive name length > 1024 char.
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 1911 place count 554 transition count 1355
Iterating global reduction 5 with 24 rules applied. Total rules applied 1935 place count 554 transition count 1355
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 1958 place count 554 transition count 1332
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -111
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 1984 place count 541 transition count 1443
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1988 place count 541 transition count 1439
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1992 place count 537 transition count 1361
Iterating global reduction 7 with 4 rules applied. Total rules applied 1996 place count 537 transition count 1361
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2000 place count 537 transition count 1357
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2008 place count 533 transition count 1386
Drop transitions removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 8 with 35 rules applied. Total rules applied 2043 place count 533 transition count 1351
Discarding 17 places :
Symmetric choice reduction at 8 with 17 rule applications. Total rules 2060 place count 516 transition count 1317
Iterating global reduction 8 with 17 rules applied. Total rules applied 2077 place count 516 transition count 1317
Discarding 17 places :
Symmetric choice reduction at 8 with 17 rule applications. Total rules 2094 place count 499 transition count 1112
Iterating global reduction 8 with 17 rules applied. Total rules applied 2111 place count 499 transition count 1112
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 2128 place count 499 transition count 1095
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2129 place count 498 transition count 1094
Applied a total of 2129 rules in 309 ms. Remains 498 /1952 variables (removed 1454) and now considering 1094/3502 (removed 2408) transitions.
[2021-05-08 23:29:24] [INFO ] Flow matrix only has 1068 transitions (discarded 26 similar events)
// Phase 1: matrix 1068 rows 498 cols
[2021-05-08 23:29:24] [INFO ] Computed 157 place invariants in 2 ms
[2021-05-08 23:29:24] [INFO ] Implicit Places using invariants in 225 ms returned []
[2021-05-08 23:29:24] [INFO ] Flow matrix only has 1068 transitions (discarded 26 similar events)
// Phase 1: matrix 1068 rows 498 cols
[2021-05-08 23:29:24] [INFO ] Computed 157 place invariants in 6 ms
[2021-05-08 23:29:25] [INFO ] State equation strengthened by 51 read => feed constraints.
[2021-05-08 23:29:25] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 918 ms to find 0 implicit places.
[2021-05-08 23:29:25] [INFO ] Redundant transitions in 101 ms returned []
[2021-05-08 23:29:25] [INFO ] Flow matrix only has 1068 transitions (discarded 26 similar events)
// Phase 1: matrix 1068 rows 498 cols
[2021-05-08 23:29:25] [INFO ] Computed 157 place invariants in 2 ms
[2021-05-08 23:29:26] [INFO ] Dead Transitions using invariants and state equation in 428 ms returned []
Finished structural reductions, in 1 iterations. Remains : 498/1952 places, 1094/3502 transitions.
Stuttering acceptance computed with spot in 82 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Running random walk in product with property : DLCround-PT-08b-03 automaton TGBA [mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s23 0), p1:(EQ s111 0), p2:(NEQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 267 steps with 0 reset in 5 ms.
FORMULA DLCround-PT-08b-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-08b-03 finished in 1864 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0 U (p1||G(p0))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1952 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1952/1952 places, 3502/3502 transitions.
Graph (trivial) has 1735 edges and 1952 vertex of which 488 / 1952 are part of one of the 40 SCC in 2 ms
Free SCC test removed 448 places
Ensure Unique test removed 482 transitions
Reduce isomorphic transitions removed 482 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 311 transitions
Trivial Post-agglo rules discarded 311 transitions
Performed 311 trivial Post agglomeration. Transition count delta: 311
Iterating post reduction 0 with 311 rules applied. Total rules applied 312 place count 1503 transition count 2708
Reduce places removed 311 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 351 rules applied. Total rules applied 663 place count 1192 transition count 2668
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 689 place count 1166 transition count 2668
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 148 Pre rules applied. Total rules applied 689 place count 1166 transition count 2520
Deduced a syphon composed of 148 places in 8 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 3 with 296 rules applied. Total rules applied 985 place count 1018 transition count 2520
Discarding 77 places :
Symmetric choice reduction at 3 with 77 rule applications. Total rules 1062 place count 941 transition count 2004
Iterating global reduction 3 with 77 rules applied. Total rules applied 1139 place count 941 transition count 2004
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1143 place count 941 transition count 2000
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 1143 place count 941 transition count 1988
Deduced a syphon composed of 12 places in 6 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 1167 place count 929 transition count 1988
Performed 351 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 351 places in 1 ms
Reduce places removed 351 places and 0 transitions.
Iterating global reduction 4 with 702 rules applied. Total rules applied 1869 place count 578 transition count 1628
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1877 place count 578 transition count 1620
Renaming transitions due to excessive name length > 1024 char.
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 1900 place count 555 transition count 1356
Iterating global reduction 5 with 23 rules applied. Total rules applied 1923 place count 555 transition count 1356
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 1946 place count 555 transition count 1333
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -104
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 1972 place count 542 transition count 1437
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1976 place count 542 transition count 1433
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1980 place count 538 transition count 1357
Iterating global reduction 7 with 4 rules applied. Total rules applied 1984 place count 538 transition count 1357
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1988 place count 538 transition count 1353
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1996 place count 534 transition count 1383
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 8 with 39 rules applied. Total rules applied 2035 place count 534 transition count 1344
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 2053 place count 516 transition count 1308
Iterating global reduction 8 with 18 rules applied. Total rules applied 2071 place count 516 transition count 1308
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 2089 place count 498 transition count 1086
Iterating global reduction 8 with 18 rules applied. Total rules applied 2107 place count 498 transition count 1086
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 2125 place count 498 transition count 1068
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2126 place count 497 transition count 1067
Applied a total of 2126 rules in 290 ms. Remains 497 /1952 variables (removed 1455) and now considering 1067/3502 (removed 2435) transitions.
[2021-05-08 23:29:26] [INFO ] Flow matrix only has 1041 transitions (discarded 26 similar events)
// Phase 1: matrix 1041 rows 497 cols
[2021-05-08 23:29:26] [INFO ] Computed 157 place invariants in 2 ms
[2021-05-08 23:29:26] [INFO ] Implicit Places using invariants in 196 ms returned []
[2021-05-08 23:29:26] [INFO ] Flow matrix only has 1041 transitions (discarded 26 similar events)
// Phase 1: matrix 1041 rows 497 cols
[2021-05-08 23:29:26] [INFO ] Computed 157 place invariants in 3 ms
[2021-05-08 23:29:26] [INFO ] State equation strengthened by 173 read => feed constraints.
[2021-05-08 23:29:27] [INFO ] Implicit Places using invariants and state equation in 953 ms returned []
Implicit Place search using SMT with State Equation took 1151 ms to find 0 implicit places.
[2021-05-08 23:29:27] [INFO ] Redundant transitions in 14 ms returned []
[2021-05-08 23:29:27] [INFO ] Flow matrix only has 1041 transitions (discarded 26 similar events)
// Phase 1: matrix 1041 rows 497 cols
[2021-05-08 23:29:27] [INFO ] Computed 157 place invariants in 2 ms
[2021-05-08 23:29:28] [INFO ] Dead Transitions using invariants and state equation in 380 ms returned []
Finished structural reductions, in 1 iterations. Remains : 497/1952 places, 1067/3502 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-08b-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NEQ s51 0) (NEQ s406 1)), p0:(NEQ s406 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 65 steps with 0 reset in 2 ms.
FORMULA DLCround-PT-08b-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-08b-05 finished in 1909 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((X(G(p0))&&(X(X(p2))||p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1952 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1952/1952 places, 3502/3502 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1932 transition count 3460
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1932 transition count 3460
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 51 place count 1921 transition count 3449
Iterating global reduction 0 with 11 rules applied. Total rules applied 62 place count 1921 transition count 3449
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 1918 transition count 3446
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 1918 transition count 3446
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 1915 transition count 3443
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 1915 transition count 3443
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 77 place count 1912 transition count 3440
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 1912 transition count 3440
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 1910 transition count 3438
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 1910 transition count 3438
Applied a total of 84 rules in 388 ms. Remains 1910 /1952 variables (removed 42) and now considering 3438/3502 (removed 64) transitions.
// Phase 1: matrix 3438 rows 1910 cols
[2021-05-08 23:29:28] [INFO ] Computed 157 place invariants in 7 ms
[2021-05-08 23:29:28] [INFO ] Implicit Places using invariants in 507 ms returned []
// Phase 1: matrix 3438 rows 1910 cols
[2021-05-08 23:29:29] [INFO ] Computed 157 place invariants in 7 ms
[2021-05-08 23:29:30] [INFO ] Implicit Places using invariants and state equation in 1554 ms returned []
Implicit Place search using SMT with State Equation took 2061 ms to find 0 implicit places.
// Phase 1: matrix 3438 rows 1910 cols
[2021-05-08 23:29:30] [INFO ] Computed 157 place invariants in 6 ms
[2021-05-08 23:29:32] [INFO ] Dead Transitions using invariants and state equation in 1680 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1910/1952 places, 3438/3502 transitions.
Spot timed out Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autfilt, --hoaf=tv, --small, -F, /tmp/curaut8675923348463394650.hoa], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
Stuttering acceptance computed with spot in 11605 ms :[false, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND p0 (NOT p2)), true, (AND p0 (NOT p2))]
Running random walk in product with property : DLCround-PT-08b-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 4}]], initial=0, aps=[p1:(OR (EQ s528 0) (EQ s1547 0)), p0:(AND (EQ s528 1) (EQ s1547 1)), p2:(EQ s1849 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-08b-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-08b-06 finished in 15770 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(((X(p1)||p0)&&(F(p3)||p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1952 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1952/1952 places, 3502/3502 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1934 transition count 3473
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1934 transition count 3473
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 47 place count 1923 transition count 3462
Iterating global reduction 0 with 11 rules applied. Total rules applied 58 place count 1923 transition count 3462
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 1920 transition count 3459
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 1920 transition count 3459
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 1917 transition count 3456
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 1917 transition count 3456
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 1914 transition count 3453
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 1914 transition count 3453
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 1912 transition count 3451
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 1912 transition count 3451
Applied a total of 80 rules in 401 ms. Remains 1912 /1952 variables (removed 40) and now considering 3451/3502 (removed 51) transitions.
// Phase 1: matrix 3451 rows 1912 cols
[2021-05-08 23:29:44] [INFO ] Computed 157 place invariants in 6 ms
[2021-05-08 23:29:44] [INFO ] Implicit Places using invariants in 554 ms returned []
// Phase 1: matrix 3451 rows 1912 cols
[2021-05-08 23:29:44] [INFO ] Computed 157 place invariants in 7 ms
[2021-05-08 23:29:46] [INFO ] Implicit Places using invariants and state equation in 1534 ms returned []
Implicit Place search using SMT with State Equation took 2090 ms to find 0 implicit places.
// Phase 1: matrix 3451 rows 1912 cols
[2021-05-08 23:29:46] [INFO ] Computed 157 place invariants in 6 ms
[2021-05-08 23:29:47] [INFO ] Dead Transitions using invariants and state equation in 1592 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1912/1952 places, 3451/3502 transitions.
Spot timed out Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autfilt, --hoaf=tv, --small, -F, /tmp/curaut3276977249844265779.hoa], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
Stuttering acceptance computed with spot in 15083 ms :[false, (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Running random walk in product with property : DLCround-PT-08b-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s30 0) (EQ s1436 0) (EQ s488 0) (EQ s1652 0)), p2:(OR (EQ s30 0) (EQ s1436 0) (EQ s488 0) (EQ s1652 0)), p3:(AND (EQ s488 1) (EQ s1652 1)), p1:(OR (EQ s683 1) (AND (EQ s488 1) (EQ s1652 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 609 ms.
Product exploration explored 100000 steps with 0 reset in 947 ms.
Knowledge obtained : [p0, p2, (NOT p3), (NOT p1)]
Stuttering acceptance computed with spot in 124 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Product exploration explored 100000 steps with 0 reset in 584 ms.
Product exploration explored 100000 steps with 0 reset in 735 ms.
[2021-05-08 23:30:06] [INFO ] Flatten gal took : 100 ms
[2021-05-08 23:30:06] [INFO ] Flatten gal took : 96 ms
[2021-05-08 23:30:06] [INFO ] Time to serialize gal into /tmp/LTL11430732845081723388.gal : 52 ms
[2021-05-08 23:30:06] [INFO ] Time to serialize properties into /tmp/LTL13540496491623508016.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11430732845081723388.gal, -t, CGAL, -LTL, /tmp/LTL13540496491623508016.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11430732845081723388.gal -t CGAL -LTL /tmp/LTL13540496491623508016.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G((("((((p37==0)||(p2294==0))||(p863==0))||(p2654==0))")||(X("((p1161==1)||((p863==1)&&(p2654==1)))")))&&(("((((p37==0)||(p2294==0))||(p863==0))||(p2654==0))")||(F("((p863==1)&&(p2654==1))")))))))
Formula 0 simplified : !FG(("((((p37==0)||(p2294==0))||(p863==0))||(p2654==0))" | X"((p1161==1)||((p863==1)&&(p2654==1)))") & ("((((p37==0)||(p2294==0))||(p863==0))||(p2654==0))" | F"((p863==1)&&(p2654==1))"))
Detected timeout of ITS tools.
[2021-05-08 23:30:21] [INFO ] Flatten gal took : 88 ms
[2021-05-08 23:30:21] [INFO ] Applying decomposition
[2021-05-08 23:30:21] [INFO ] Flatten gal took : 85 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6783080047744481212.txt, -o, /tmp/graph6783080047744481212.bin, -w, /tmp/graph6783080047744481212.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6783080047744481212.bin, -l, -1, -v, -w, /tmp/graph6783080047744481212.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 23:30:22] [INFO ] Decomposing Gal with order
[2021-05-08 23:30:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 23:30:22] [INFO ] Removed a total of 3245 redundant transitions.
[2021-05-08 23:30:22] [INFO ] Flatten gal took : 266 ms
[2021-05-08 23:30:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 56 ms.
[2021-05-08 23:30:22] [INFO ] Time to serialize gal into /tmp/LTL8941362077288554837.gal : 28 ms
[2021-05-08 23:30:22] [INFO ] Time to serialize properties into /tmp/LTL12918078514010636643.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8941362077288554837.gal, -t, CGAL, -LTL, /tmp/LTL12918078514010636643.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8941362077288554837.gal -t CGAL -LTL /tmp/LTL12918078514010636643.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G((("((((i0.i1.i2.u12.p37==0)||(i16.u555.p2294==0))||(i8.u191.p863==0))||(i8.u623.p2654==0))")||(X("((i18.u284.p1161==1)||((i8.u191.p863==1)&&(i8.u623.p2654==1)))")))&&(("((((i0.i1.i2.u12.p37==0)||(i16.u555.p2294==0))||(i8.u191.p863==0))||(i8.u623.p2654==0))")||(F("((i8.u191.p863==1)&&(i8.u623.p2654==1))")))))))
Formula 0 simplified : !FG(("((((i0.i1.i2.u12.p37==0)||(i16.u555.p2294==0))||(i8.u191.p863==0))||(i8.u623.p2654==0))" | X"((i18.u284.p1161==1)||((i8.u191.p863==1)&&(i8.u623.p2654==1)))") & ("((((i0.i1.i2.u12.p37==0)||(i16.u555.p2294==0))||(i8.u191.p863==0))||(i8.u623.p2654==0))" | F"((i8.u191.p863==1)&&(i8.u623.p2654==1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10591744201654369803
[2021-05-08 23:30:38] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10591744201654369803
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10591744201654369803]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10591744201654369803] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10591744201654369803] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property DLCround-PT-08b-07 finished in 55233 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (X(p1)||F(p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1952 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1952/1952 places, 3502/3502 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1935 transition count 3463
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1935 transition count 3463
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 1927 transition count 3455
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 1927 transition count 3455
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 1924 transition count 3452
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 1924 transition count 3452
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 1921 transition count 3449
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 1921 transition count 3449
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 1918 transition count 3446
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 1918 transition count 3446
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 1916 transition count 3444
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 1916 transition count 3444
Applied a total of 72 rules in 409 ms. Remains 1916 /1952 variables (removed 36) and now considering 3444/3502 (removed 58) transitions.
// Phase 1: matrix 3444 rows 1916 cols
[2021-05-08 23:30:39] [INFO ] Computed 157 place invariants in 7 ms
[2021-05-08 23:30:40] [INFO ] Implicit Places using invariants in 672 ms returned []
// Phase 1: matrix 3444 rows 1916 cols
[2021-05-08 23:30:40] [INFO ] Computed 157 place invariants in 7 ms
[2021-05-08 23:30:41] [INFO ] Implicit Places using invariants and state equation in 1628 ms returned []
Implicit Place search using SMT with State Equation took 2301 ms to find 0 implicit places.
// Phase 1: matrix 3444 rows 1916 cols
[2021-05-08 23:30:41] [INFO ] Computed 157 place invariants in 7 ms
[2021-05-08 23:30:43] [INFO ] Dead Transitions using invariants and state equation in 1764 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1916/1952 places, 3444/3502 transitions.
Spot timed out Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autfilt, --hoaf=tv, --small, -F, /tmp/curaut11044935381541975869.hoa], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
Stuttering acceptance computed with spot in 17239 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DLCround-PT-08b-09 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}]], initial=0, aps=[p2:(EQ s1752 1), p0:(AND (EQ s1634 1) (EQ s1172 1)), p1:(AND (EQ s407 1) (EQ s1604 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 234 reset in 402 ms.
Product exploration explored 100000 steps with 234 reset in 433 ms.
Knowledge obtained : [(NOT p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 233 reset in 369 ms.
Product exploration explored 100000 steps with 230 reset in 383 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Support contains 5 out of 1916 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1916/1916 places, 3444/3444 transitions.
Graph (trivial) has 1696 edges and 1916 vertex of which 483 / 1916 are part of one of the 40 SCC in 1 ms
Free SCC test removed 443 places
Ensure Unique test removed 478 transitions
Reduce isomorphic transitions removed 478 transitions.
Performed 294 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 294 rules applied. Total rules applied 295 place count 1473 transition count 2966
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 26 rules applied. Total rules applied 321 place count 1473 transition count 2953
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 321 place count 1473 transition count 2957
Deduced a syphon composed of 317 places in 10 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 331 place count 1473 transition count 2957
Discarding 141 places :
Symmetric choice reduction at 2 with 141 rule applications. Total rules 472 place count 1332 transition count 2399
Deduced a syphon composed of 237 places in 8 ms
Iterating global reduction 2 with 141 rules applied. Total rules applied 613 place count 1332 transition count 2399
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 617 place count 1332 transition count 2395
Performed 497 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 734 places in 0 ms
Iterating global reduction 3 with 497 rules applied. Total rules applied 1114 place count 1332 transition count 2404
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1123 place count 1332 transition count 2395
Renaming transitions due to excessive name length > 1024 char.
Discarding 363 places :
Symmetric choice reduction at 4 with 363 rule applications. Total rules 1486 place count 969 transition count 1802
Deduced a syphon composed of 393 places in 0 ms
Iterating global reduction 4 with 363 rules applied. Total rules applied 1849 place count 969 transition count 1802
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1871 place count 969 transition count 1780
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1880 place count 960 transition count 1771
Deduced a syphon composed of 384 places in 0 ms
Iterating global reduction 5 with 9 rules applied. Total rules applied 1889 place count 960 transition count 1771
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -212
Deduced a syphon composed of 415 places in 1 ms
Iterating global reduction 5 with 31 rules applied. Total rules applied 1920 place count 960 transition count 1983
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 1937 place count 960 transition count 1966
Discarding 44 places :
Symmetric choice reduction at 6 with 44 rule applications. Total rules 1981 place count 916 transition count 1803
Deduced a syphon composed of 375 places in 0 ms
Iterating global reduction 6 with 44 rules applied. Total rules applied 2025 place count 916 transition count 1803
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2033 place count 916 transition count 1795
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 2041 place count 908 transition count 1779
Deduced a syphon composed of 367 places in 1 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 2049 place count 908 transition count 1779
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 371 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 2053 place count 908 transition count 1815
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2057 place count 904 transition count 1807
Deduced a syphon composed of 367 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 2061 place count 904 transition count 1807
Deduced a syphon composed of 367 places in 1 ms
Drop transitions removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 7 with 43 rules applied. Total rules applied 2104 place count 904 transition count 1764
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 2121 place count 887 transition count 1730
Deduced a syphon composed of 367 places in 0 ms
Iterating global reduction 7 with 17 rules applied. Total rules applied 2138 place count 887 transition count 1730
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 2155 place count 870 transition count 1518
Deduced a syphon composed of 367 places in 0 ms
Iterating global reduction 7 with 17 rules applied. Total rules applied 2172 place count 870 transition count 1518
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 7 with 25 rules applied. Total rules applied 2197 place count 870 transition count 1493
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 2213 place count 854 transition count 1469
Deduced a syphon composed of 351 places in 0 ms
Iterating global reduction 8 with 16 rules applied. Total rules applied 2229 place count 854 transition count 1469
Deduced a syphon composed of 351 places in 0 ms
Applied a total of 2229 rules in 1004 ms. Remains 854 /1916 variables (removed 1062) and now considering 1469/3444 (removed 1975) transitions.
[2021-05-08 23:31:03] [INFO ] Redundant transitions in 27 ms returned []
[2021-05-08 23:31:03] [INFO ] Flow matrix only has 1442 transitions (discarded 27 similar events)
// Phase 1: matrix 1442 rows 854 cols
[2021-05-08 23:31:03] [INFO ] Computed 157 place invariants in 29 ms
[2021-05-08 23:31:04] [INFO ] Dead Transitions using invariants and state equation in 666 ms returned []
Finished structural reductions, in 1 iterations. Remains : 854/1916 places, 1469/3444 transitions.
Stuttering criterion allowed to conclude after 121 steps with 0 reset in 8 ms.
FORMULA DLCround-PT-08b-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-08b-09 finished in 25464 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F((p0&&F(G(p1))))||X((p2 U p3)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1952 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1952/1952 places, 3502/3502 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1935 transition count 3463
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1935 transition count 3463
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 1927 transition count 3455
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 1927 transition count 3455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1926 transition count 3454
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1926 transition count 3454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1925 transition count 3453
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1925 transition count 3453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1924 transition count 3452
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1924 transition count 3452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1923 transition count 3451
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1923 transition count 3451
Applied a total of 58 rules in 497 ms. Remains 1923 /1952 variables (removed 29) and now considering 3451/3502 (removed 51) transitions.
// Phase 1: matrix 3451 rows 1923 cols
[2021-05-08 23:31:05] [INFO ] Computed 157 place invariants in 7 ms
[2021-05-08 23:31:05] [INFO ] Implicit Places using invariants in 469 ms returned []
// Phase 1: matrix 3451 rows 1923 cols
[2021-05-08 23:31:05] [INFO ] Computed 157 place invariants in 6 ms
[2021-05-08 23:31:07] [INFO ] Implicit Places using invariants and state equation in 1706 ms returned []
Implicit Place search using SMT with State Equation took 2176 ms to find 0 implicit places.
// Phase 1: matrix 3451 rows 1923 cols
[2021-05-08 23:31:07] [INFO ] Computed 157 place invariants in 7 ms
[2021-05-08 23:31:09] [INFO ] Dead Transitions using invariants and state equation in 1874 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1923/1952 places, 3451/3502 transitions.
Stuttering acceptance computed with spot in 929 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p1), (NOT p0)]
Running random walk in product with property : DLCround-PT-08b-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s1736 1), p1:(EQ s668 1), p3:(EQ s36 1), p2:(AND (EQ s1736 1) (EQ s1832 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 660 ms.
Product exploration explored 100000 steps with 0 reset in 807 ms.
Knowledge obtained : [(NOT p0), (NOT p1), (NOT p3), (NOT p2)]
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 566 ms.
Product exploration explored 100000 steps with 1 reset in 762 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p1), (NOT p0)]
Support contains 4 out of 1923 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1923/1923 places, 3451/3451 transitions.
Graph (trivial) has 1702 edges and 1923 vertex of which 483 / 1923 are part of one of the 40 SCC in 1 ms
Free SCC test removed 443 places
Ensure Unique test removed 477 transitions
Reduce isomorphic transitions removed 477 transitions.
Performed 300 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 300 rules applied. Total rules applied 301 place count 1480 transition count 2974
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 26 rules applied. Total rules applied 327 place count 1480 transition count 2961
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 327 place count 1480 transition count 2965
Deduced a syphon composed of 323 places in 10 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 337 place count 1480 transition count 2965
Discarding 148 places :
Symmetric choice reduction at 2 with 148 rule applications. Total rules 485 place count 1332 transition count 2389
Deduced a syphon composed of 237 places in 7 ms
Iterating global reduction 2 with 148 rules applied. Total rules applied 633 place count 1332 transition count 2389
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 637 place count 1332 transition count 2385
Performed 498 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 735 places in 0 ms
Iterating global reduction 3 with 498 rules applied. Total rules applied 1135 place count 1332 transition count 2394
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1144 place count 1332 transition count 2385
Renaming transitions due to excessive name length > 1024 char.
Discarding 362 places :
Symmetric choice reduction at 4 with 362 rule applications. Total rules 1506 place count 970 transition count 1801
Deduced a syphon composed of 394 places in 0 ms
Iterating global reduction 4 with 362 rules applied. Total rules applied 1868 place count 970 transition count 1801
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 1889 place count 970 transition count 1780
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1898 place count 961 transition count 1771
Deduced a syphon composed of 385 places in 1 ms
Iterating global reduction 5 with 9 rules applied. Total rules applied 1907 place count 961 transition count 1771
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -195
Deduced a syphon composed of 414 places in 0 ms
Iterating global reduction 5 with 29 rules applied. Total rules applied 1936 place count 961 transition count 1966
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 1953 place count 961 transition count 1949
Discarding 42 places :
Symmetric choice reduction at 6 with 42 rule applications. Total rules 1995 place count 919 transition count 1792
Deduced a syphon composed of 376 places in 1 ms
Iterating global reduction 6 with 42 rules applied. Total rules applied 2037 place count 919 transition count 1792
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2045 place count 919 transition count 1784
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 2053 place count 911 transition count 1768
Deduced a syphon composed of 368 places in 0 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 2061 place count 911 transition count 1768
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 372 places in 1 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 2065 place count 911 transition count 1804
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2069 place count 907 transition count 1796
Deduced a syphon composed of 368 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 2073 place count 907 transition count 1796
Deduced a syphon composed of 368 places in 0 ms
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 7 with 40 rules applied. Total rules applied 2113 place count 907 transition count 1756
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 2131 place count 889 transition count 1720
Deduced a syphon composed of 368 places in 0 ms
Iterating global reduction 7 with 18 rules applied. Total rules applied 2149 place count 889 transition count 1720
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 2167 place count 871 transition count 1498
Deduced a syphon composed of 368 places in 0 ms
Iterating global reduction 7 with 18 rules applied. Total rules applied 2185 place count 871 transition count 1498
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 7 with 27 rules applied. Total rules applied 2212 place count 871 transition count 1471
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 2230 place count 853 transition count 1444
Deduced a syphon composed of 350 places in 1 ms
Iterating global reduction 8 with 18 rules applied. Total rules applied 2248 place count 853 transition count 1444
Deduced a syphon composed of 350 places in 0 ms
Applied a total of 2248 rules in 915 ms. Remains 853 /1923 variables (removed 1070) and now considering 1444/3451 (removed 2007) transitions.
[2021-05-08 23:31:16] [INFO ] Redundant transitions in 26 ms returned []
[2021-05-08 23:31:16] [INFO ] Flow matrix only has 1419 transitions (discarded 25 similar events)
// Phase 1: matrix 1419 rows 853 cols
[2021-05-08 23:31:16] [INFO ] Computed 157 place invariants in 31 ms
[2021-05-08 23:31:16] [INFO ] Dead Transitions using invariants and state equation in 637 ms returned []
Finished structural reductions, in 1 iterations. Remains : 853/1923 places, 1444/3451 transitions.
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-08b-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-08b-10 finished in 12348 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((F(p1)&&p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1952 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1952/1952 places, 3502/3502 transitions.
Graph (trivial) has 1736 edges and 1952 vertex of which 488 / 1952 are part of one of the 40 SCC in 1 ms
Free SCC test removed 448 places
Ensure Unique test removed 482 transitions
Reduce isomorphic transitions removed 482 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 312 transitions
Trivial Post-agglo rules discarded 312 transitions
Performed 312 trivial Post agglomeration. Transition count delta: 312
Iterating post reduction 0 with 312 rules applied. Total rules applied 313 place count 1503 transition count 2707
Reduce places removed 312 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 352 rules applied. Total rules applied 665 place count 1191 transition count 2667
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 691 place count 1165 transition count 2667
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 149 Pre rules applied. Total rules applied 691 place count 1165 transition count 2518
Deduced a syphon composed of 149 places in 9 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 298 rules applied. Total rules applied 989 place count 1016 transition count 2518
Discarding 78 places :
Symmetric choice reduction at 3 with 78 rule applications. Total rules 1067 place count 938 transition count 2012
Iterating global reduction 3 with 78 rules applied. Total rules applied 1145 place count 938 transition count 2012
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1149 place count 938 transition count 2008
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 1149 place count 938 transition count 1996
Deduced a syphon composed of 12 places in 7 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 1173 place count 926 transition count 1996
Performed 351 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 351 places in 0 ms
Reduce places removed 351 places and 0 transitions.
Iterating global reduction 4 with 702 rules applied. Total rules applied 1875 place count 575 transition count 1636
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1883 place count 575 transition count 1628
Renaming transitions due to excessive name length > 1024 char.
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 1906 place count 552 transition count 1364
Iterating global reduction 5 with 23 rules applied. Total rules applied 1929 place count 552 transition count 1364
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 1952 place count 552 transition count 1341
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1976 place count 540 transition count 1440
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1980 place count 540 transition count 1436
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1984 place count 536 transition count 1360
Iterating global reduction 7 with 4 rules applied. Total rules applied 1988 place count 536 transition count 1360
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1992 place count 536 transition count 1356
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2000 place count 532 transition count 1386
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 8 with 36 rules applied. Total rules applied 2036 place count 532 transition count 1350
Discarding 17 places :
Symmetric choice reduction at 8 with 17 rule applications. Total rules 2053 place count 515 transition count 1316
Iterating global reduction 8 with 17 rules applied. Total rules applied 2070 place count 515 transition count 1316
Discarding 17 places :
Symmetric choice reduction at 8 with 17 rule applications. Total rules 2087 place count 498 transition count 1108
Iterating global reduction 8 with 17 rules applied. Total rules applied 2104 place count 498 transition count 1108
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 2121 place count 498 transition count 1091
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2122 place count 497 transition count 1090
Applied a total of 2122 rules in 267 ms. Remains 497 /1952 variables (removed 1455) and now considering 1090/3502 (removed 2412) transitions.
[2021-05-08 23:31:17] [INFO ] Flow matrix only has 1063 transitions (discarded 27 similar events)
// Phase 1: matrix 1063 rows 497 cols
[2021-05-08 23:31:17] [INFO ] Computed 157 place invariants in 6 ms
[2021-05-08 23:31:17] [INFO ] Implicit Places using invariants in 225 ms returned []
[2021-05-08 23:31:17] [INFO ] Flow matrix only has 1063 transitions (discarded 27 similar events)
// Phase 1: matrix 1063 rows 497 cols
[2021-05-08 23:31:17] [INFO ] Computed 157 place invariants in 3 ms
[2021-05-08 23:31:17] [INFO ] State equation strengthened by 50 read => feed constraints.
[2021-05-08 23:31:18] [INFO ] Implicit Places using invariants and state equation in 674 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
[2021-05-08 23:31:18] [INFO ] Redundant transitions in 15 ms returned []
[2021-05-08 23:31:18] [INFO ] Flow matrix only has 1063 transitions (discarded 27 similar events)
// Phase 1: matrix 1063 rows 497 cols
[2021-05-08 23:31:18] [INFO ] Computed 157 place invariants in 2 ms
[2021-05-08 23:31:18] [INFO ] Dead Transitions using invariants and state equation in 450 ms returned []
Finished structural reductions, in 1 iterations. Remains : 497/1952 places, 1090/3502 transitions.
Stuttering acceptance computed with spot in 3188 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-08b-11 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s39 1) (EQ s142 1)), p0:(AND (EQ s39 1) (EQ s142 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, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-08b-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-08b-11 finished in 4851 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&X(X(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1952 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1952/1952 places, 3502/3502 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1932 transition count 3460
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1932 transition count 3460
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 51 place count 1921 transition count 3449
Iterating global reduction 0 with 11 rules applied. Total rules applied 62 place count 1921 transition count 3449
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 1918 transition count 3446
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 1918 transition count 3446
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 1915 transition count 3443
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 1915 transition count 3443
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 77 place count 1912 transition count 3440
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 1912 transition count 3440
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 1910 transition count 3438
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 1910 transition count 3438
Applied a total of 84 rules in 396 ms. Remains 1910 /1952 variables (removed 42) and now considering 3438/3502 (removed 64) transitions.
// Phase 1: matrix 3438 rows 1910 cols
[2021-05-08 23:31:22] [INFO ] Computed 157 place invariants in 7 ms
[2021-05-08 23:31:22] [INFO ] Implicit Places using invariants in 516 ms returned []
// Phase 1: matrix 3438 rows 1910 cols
[2021-05-08 23:31:22] [INFO ] Computed 157 place invariants in 7 ms
[2021-05-08 23:31:24] [INFO ] Implicit Places using invariants and state equation in 1607 ms returned []
Implicit Place search using SMT with State Equation took 2135 ms to find 0 implicit places.
// Phase 1: matrix 3438 rows 1910 cols
[2021-05-08 23:31:24] [INFO ] Computed 157 place invariants in 7 ms
[2021-05-08 23:31:25] [INFO ] Dead Transitions using invariants and state equation in 1656 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1910/1952 places, 3438/3502 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : DLCround-PT-08b-12 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (EQ s136 1) (EQ s1170 1)), p0:(OR (NEQ s576 1) (NEQ s1253 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 5 reset in 589 ms.
Product exploration explored 100000 steps with 3 reset in 722 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 8 reset in 592 ms.
Product exploration explored 100000 steps with 8 reset in 705 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Support contains 4 out of 1910 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1910/1910 places, 3438/3438 transitions.
Graph (trivial) has 1690 edges and 1910 vertex of which 469 / 1910 are part of one of the 41 SCC in 1 ms
Free SCC test removed 428 places
Ensure Unique test removed 460 transitions
Reduce isomorphic transitions removed 460 transitions.
Performed 299 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 299 rules applied. Total rules applied 300 place count 1482 transition count 2978
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 26 rules applied. Total rules applied 326 place count 1482 transition count 2965
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 326 place count 1482 transition count 2970
Deduced a syphon composed of 322 places in 10 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 336 place count 1482 transition count 2970
Discarding 141 places :
Symmetric choice reduction at 2 with 141 rule applications. Total rules 477 place count 1341 transition count 2420
Deduced a syphon composed of 239 places in 9 ms
Iterating global reduction 2 with 141 rules applied. Total rules applied 618 place count 1341 transition count 2420
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 621 place count 1341 transition count 2417
Performed 504 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 743 places in 0 ms
Iterating global reduction 3 with 504 rules applied. Total rules applied 1125 place count 1341 transition count 2426
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1135 place count 1341 transition count 2416
Renaming transitions due to excessive name length > 1024 char.
Discarding 369 places :
Symmetric choice reduction at 4 with 369 rule applications. Total rules 1504 place count 972 transition count 1828
Deduced a syphon composed of 395 places in 1 ms
Iterating global reduction 4 with 369 rules applied. Total rules applied 1873 place count 972 transition count 1828
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 1893 place count 972 transition count 1808
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1902 place count 963 transition count 1799
Deduced a syphon composed of 386 places in 0 ms
Iterating global reduction 5 with 9 rules applied. Total rules applied 1911 place count 963 transition count 1799
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 387 places in 1 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1912 place count 963 transition count 1799
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1913 place count 962 transition count 1798
Deduced a syphon composed of 386 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1914 place count 962 transition count 1798
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -197
Deduced a syphon composed of 416 places in 1 ms
Iterating global reduction 5 with 30 rules applied. Total rules applied 1944 place count 962 transition count 1995
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 1960 place count 962 transition count 1979
Discarding 43 places :
Symmetric choice reduction at 6 with 43 rule applications. Total rules 2003 place count 919 transition count 1820
Deduced a syphon composed of 377 places in 0 ms
Iterating global reduction 6 with 43 rules applied. Total rules applied 2046 place count 919 transition count 1820
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2054 place count 919 transition count 1812
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 2062 place count 911 transition count 1796
Deduced a syphon composed of 369 places in 0 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 2070 place count 911 transition count 1796
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 373 places in 1 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 2074 place count 911 transition count 1832
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2078 place count 907 transition count 1824
Deduced a syphon composed of 369 places in 1 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 2082 place count 907 transition count 1824
Deduced a syphon composed of 369 places in 0 ms
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 7 with 38 rules applied. Total rules applied 2120 place count 907 transition count 1786
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 2136 place count 891 transition count 1754
Deduced a syphon composed of 369 places in 1 ms
Iterating global reduction 7 with 16 rules applied. Total rules applied 2152 place count 891 transition count 1754
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 2168 place count 875 transition count 1556
Deduced a syphon composed of 369 places in 0 ms
Iterating global reduction 7 with 16 rules applied. Total rules applied 2184 place count 875 transition count 1556
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 24 rules applied. Total rules applied 2208 place count 875 transition count 1532
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 2224 place count 859 transition count 1508
Deduced a syphon composed of 353 places in 0 ms
Iterating global reduction 8 with 16 rules applied. Total rules applied 2240 place count 859 transition count 1508
Deduced a syphon composed of 353 places in 1 ms
Applied a total of 2240 rules in 852 ms. Remains 859 /1910 variables (removed 1051) and now considering 1508/3438 (removed 1930) transitions.
[2021-05-08 23:31:29] [INFO ] Redundant transitions in 29 ms returned []
[2021-05-08 23:31:29] [INFO ] Flow matrix only has 1480 transitions (discarded 28 similar events)
// Phase 1: matrix 1480 rows 859 cols
[2021-05-08 23:31:29] [INFO ] Computed 157 place invariants in 33 ms
[2021-05-08 23:31:30] [INFO ] Dead Transitions using invariants and state equation in 665 ms returned []
Finished structural reductions, in 1 iterations. Remains : 859/1910 places, 1508/3438 transitions.
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-08b-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-08b-12 finished in 8845 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((F(p0)&&G(p1)&&(p2||X(p3))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1952 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1952/1952 places, 3502/3502 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1935 transition count 3463
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1935 transition count 3463
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 1927 transition count 3455
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 1927 transition count 3455
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 1925 transition count 3453
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 1925 transition count 3453
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 1923 transition count 3451
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 1923 transition count 3451
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 1921 transition count 3449
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 1921 transition count 3449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1920 transition count 3448
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1920 transition count 3448
Applied a total of 64 rules in 392 ms. Remains 1920 /1952 variables (removed 32) and now considering 3448/3502 (removed 54) transitions.
// Phase 1: matrix 3448 rows 1920 cols
[2021-05-08 23:31:31] [INFO ] Computed 157 place invariants in 7 ms
[2021-05-08 23:31:31] [INFO ] Implicit Places using invariants in 493 ms returned []
// Phase 1: matrix 3448 rows 1920 cols
[2021-05-08 23:31:31] [INFO ] Computed 157 place invariants in 7 ms
[2021-05-08 23:31:33] [INFO ] Implicit Places using invariants and state equation in 1722 ms returned []
Implicit Place search using SMT with State Equation took 2222 ms to find 0 implicit places.
// Phase 1: matrix 3448 rows 1920 cols
[2021-05-08 23:31:33] [INFO ] Computed 157 place invariants in 9 ms
[2021-05-08 23:31:34] [INFO ] Dead Transitions using invariants and state equation in 1596 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1920/1952 places, 3448/3502 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : DLCround-PT-08b-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s644 1), p0:(EQ s1826 0), p2:(EQ s1485 1), p3:(OR (EQ s202 1) (EQ s243 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 601 ms.
Product exploration explored 100000 steps with 0 reset in 770 ms.
Knowledge obtained : [(NOT p1), p0, (NOT p2), (NOT p3)]
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Product exploration explored 100000 steps with 0 reset in 604 ms.
Product exploration explored 100000 steps with 0 reset in 733 ms.
Applying partial POR strategy [false, false, false, true, false]
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Support contains 5 out of 1920 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1920/1920 places, 3448/3448 transitions.
Graph (trivial) has 1696 edges and 1920 vertex of which 471 / 1920 are part of one of the 38 SCC in 1 ms
Free SCC test removed 433 places
Ensure Unique test removed 468 transitions
Reduce isomorphic transitions removed 468 transitions.
Performed 300 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 300 rules applied. Total rules applied 301 place count 1487 transition count 2980
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 26 rules applied. Total rules applied 327 place count 1487 transition count 2967
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 327 place count 1487 transition count 2971
Deduced a syphon composed of 322 places in 10 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 336 place count 1487 transition count 2971
Discarding 144 places :
Symmetric choice reduction at 2 with 144 rule applications. Total rules 480 place count 1343 transition count 2421
Deduced a syphon composed of 238 places in 8 ms
Iterating global reduction 2 with 144 rules applied. Total rules applied 624 place count 1343 transition count 2421
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 628 place count 1343 transition count 2417
Performed 503 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 741 places in 1 ms
Iterating global reduction 3 with 503 rules applied. Total rules applied 1131 place count 1343 transition count 2426
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1140 place count 1343 transition count 2417
Renaming transitions due to excessive name length > 1024 char.
Discarding 371 places :
Symmetric choice reduction at 4 with 371 rule applications. Total rules 1511 place count 972 transition count 1794
Deduced a syphon composed of 394 places in 0 ms
Iterating global reduction 4 with 371 rules applied. Total rules applied 1882 place count 972 transition count 1794
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1904 place count 972 transition count 1772
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1913 place count 963 transition count 1763
Deduced a syphon composed of 385 places in 1 ms
Iterating global reduction 5 with 9 rules applied. Total rules applied 1922 place count 963 transition count 1763
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -223
Deduced a syphon composed of 416 places in 1 ms
Iterating global reduction 5 with 31 rules applied. Total rules applied 1953 place count 963 transition count 1986
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 1970 place count 963 transition count 1969
Discarding 44 places :
Symmetric choice reduction at 6 with 44 rule applications. Total rules 2014 place count 919 transition count 1808
Deduced a syphon composed of 376 places in 0 ms
Iterating global reduction 6 with 44 rules applied. Total rules applied 2058 place count 919 transition count 1808
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2066 place count 919 transition count 1800
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 2074 place count 911 transition count 1784
Deduced a syphon composed of 368 places in 0 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 2082 place count 911 transition count 1784
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 372 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 2086 place count 911 transition count 1820
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2090 place count 907 transition count 1812
Deduced a syphon composed of 368 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 2094 place count 907 transition count 1812
Deduced a syphon composed of 368 places in 0 ms
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 7 with 38 rules applied. Total rules applied 2132 place count 907 transition count 1774
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 2148 place count 891 transition count 1742
Deduced a syphon composed of 368 places in 0 ms
Iterating global reduction 7 with 16 rules applied. Total rules applied 2164 place count 891 transition count 1742
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 2180 place count 875 transition count 1544
Deduced a syphon composed of 368 places in 0 ms
Iterating global reduction 7 with 16 rules applied. Total rules applied 2196 place count 875 transition count 1544
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 24 rules applied. Total rules applied 2220 place count 875 transition count 1520
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 2235 place count 860 transition count 1497
Deduced a syphon composed of 353 places in 0 ms
Iterating global reduction 8 with 15 rules applied. Total rules applied 2250 place count 860 transition count 1497
Deduced a syphon composed of 353 places in 0 ms
Applied a total of 2250 rules in 775 ms. Remains 860 /1920 variables (removed 1060) and now considering 1497/3448 (removed 1951) transitions.
[2021-05-08 23:31:39] [INFO ] Redundant transitions in 29 ms returned []
[2021-05-08 23:31:39] [INFO ] Flow matrix only has 1472 transitions (discarded 25 similar events)
// Phase 1: matrix 1472 rows 860 cols
[2021-05-08 23:31:39] [INFO ] Computed 157 place invariants in 32 ms
[2021-05-08 23:31:39] [INFO ] Dead Transitions using invariants and state equation in 763 ms returned []
Finished structural reductions, in 1 iterations. Remains : 860/1920 places, 1497/3448 transitions.
Product exploration explored 100000 steps with 0 reset in 636 ms.
Product exploration explored 100000 steps with 0 reset in 825 ms.
[2021-05-08 23:31:41] [INFO ] Flatten gal took : 82 ms
[2021-05-08 23:31:41] [INFO ] Flatten gal took : 82 ms
[2021-05-08 23:31:41] [INFO ] Time to serialize gal into /tmp/LTL4842153249239108115.gal : 12 ms
[2021-05-08 23:31:41] [INFO ] Time to serialize properties into /tmp/LTL182290504027610960.ltl : 99 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4842153249239108115.gal, -t, CGAL, -LTL, /tmp/LTL182290504027610960.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4842153249239108115.gal -t CGAL -LTL /tmp/LTL182290504027610960.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(((F("(p2932==0)"))&&(G("(p1093==1)")))&&(("(p2369==1)")||(X("((p420==1)||(p476==1))")))))))
Formula 0 simplified : !XF(F"(p2932==0)" & G"(p1093==1)" & ("(p2369==1)" | X"((p420==1)||(p476==1))"))
Detected timeout of ITS tools.
[2021-05-08 23:31:56] [INFO ] Flatten gal took : 88 ms
[2021-05-08 23:31:56] [INFO ] Applying decomposition
[2021-05-08 23:31:56] [INFO ] Flatten gal took : 80 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8662044982592480611.txt, -o, /tmp/graph8662044982592480611.bin, -w, /tmp/graph8662044982592480611.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8662044982592480611.bin, -l, -1, -v, -w, /tmp/graph8662044982592480611.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 23:31:57] [INFO ] Decomposing Gal with order
[2021-05-08 23:31:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 23:31:57] [INFO ] Removed a total of 3201 redundant transitions.
[2021-05-08 23:31:57] [INFO ] Flatten gal took : 147 ms
[2021-05-08 23:31:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 45 ms.
[2021-05-08 23:32:02] [INFO ] Time to serialize gal into /tmp/LTL13920441967107294662.gal : 5274 ms
[2021-05-08 23:32:02] [INFO ] Time to serialize properties into /tmp/LTL7826203334957361312.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13920441967107294662.gal, -t, CGAL, -LTL, /tmp/LTL7826203334957361312.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13920441967107294662.gal -t CGAL -LTL /tmp/LTL7826203334957361312.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F(((F("(i15.i1.i11.u682.p2932==0)"))&&(G("(i12.i0.i2.u270.p1093==1)")))&&(("(i5.i1.i12.u568.p2369==1)")||(X("((i3.i1.i4.u86.p420==1)||(i5.i1.i3.u103.p476==1))")))))))
Formula 0 simplified : !XF(F"(i15.i1.i11.u682.p2932==0)" & G"(i12.i0.i2.u270.p1093==1)" & ("(i5.i1.i12.u568.p2369==1)" | X"((i3.i1.i4.u86.p420==1)||(i5.i1.i3.u103.p476==1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10835929553633708602
[2021-05-08 23:32:17] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10835929553633708602
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10835929553633708602]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10835929553633708602] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10835929553633708602] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property DLCround-PT-08b-14 finished in 48201 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 1952 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1952/1952 places, 3502/3502 transitions.
Graph (trivial) has 1738 edges and 1952 vertex of which 488 / 1952 are part of one of the 40 SCC in 1 ms
Free SCC test removed 448 places
Ensure Unique test removed 482 transitions
Reduce isomorphic transitions removed 482 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 312 transitions
Trivial Post-agglo rules discarded 312 transitions
Performed 312 trivial Post agglomeration. Transition count delta: 312
Iterating post reduction 0 with 312 rules applied. Total rules applied 313 place count 1503 transition count 2707
Reduce places removed 312 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 352 rules applied. Total rules applied 665 place count 1191 transition count 2667
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 691 place count 1165 transition count 2667
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 149 Pre rules applied. Total rules applied 691 place count 1165 transition count 2518
Deduced a syphon composed of 149 places in 8 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 298 rules applied. Total rules applied 989 place count 1016 transition count 2518
Discarding 79 places :
Symmetric choice reduction at 3 with 79 rule applications. Total rules 1068 place count 937 transition count 2000
Iterating global reduction 3 with 79 rules applied. Total rules applied 1147 place count 937 transition count 2000
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1151 place count 937 transition count 1996
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 1151 place count 937 transition count 1984
Deduced a syphon composed of 12 places in 7 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 1175 place count 925 transition count 1984
Performed 349 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 349 places in 0 ms
Reduce places removed 349 places and 0 transitions.
Iterating global reduction 4 with 698 rules applied. Total rules applied 1873 place count 576 transition count 1626
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1881 place count 576 transition count 1618
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 1904 place count 553 transition count 1354
Iterating global reduction 5 with 23 rules applied. Total rules applied 1927 place count 553 transition count 1354
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 1950 place count 553 transition count 1331
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -135
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 1984 place count 536 transition count 1466
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1988 place count 536 transition count 1462
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1992 place count 532 transition count 1386
Iterating global reduction 7 with 4 rules applied. Total rules applied 1996 place count 532 transition count 1386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2000 place count 532 transition count 1382
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2008 place count 528 transition count 1412
Drop transitions removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 8 with 47 rules applied. Total rules applied 2055 place count 528 transition count 1365
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 2073 place count 510 transition count 1329
Iterating global reduction 8 with 18 rules applied. Total rules applied 2091 place count 510 transition count 1329
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 2109 place count 492 transition count 1099
Iterating global reduction 8 with 18 rules applied. Total rules applied 2127 place count 492 transition count 1099
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 2145 place count 492 transition count 1081
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2146 place count 491 transition count 1080
Applied a total of 2146 rules in 238 ms. Remains 491 /1952 variables (removed 1461) and now considering 1080/3502 (removed 2422) transitions.
[2021-05-08 23:32:19] [INFO ] Flow matrix only has 1046 transitions (discarded 34 similar events)
// Phase 1: matrix 1046 rows 491 cols
[2021-05-08 23:32:19] [INFO ] Computed 157 place invariants in 2 ms
[2021-05-08 23:32:19] [INFO ] Implicit Places using invariants in 224 ms returned []
[2021-05-08 23:32:19] [INFO ] Flow matrix only has 1046 transitions (discarded 34 similar events)
// Phase 1: matrix 1046 rows 491 cols
[2021-05-08 23:32:19] [INFO ] Computed 157 place invariants in 2 ms
[2021-05-08 23:32:19] [INFO ] State equation strengthened by 57 read => feed constraints.
[2021-05-08 23:32:20] [INFO ] Implicit Places using invariants and state equation in 760 ms returned []
Implicit Place search using SMT with State Equation took 986 ms to find 0 implicit places.
[2021-05-08 23:32:20] [INFO ] Redundant transitions in 14 ms returned []
[2021-05-08 23:32:20] [INFO ] Flow matrix only has 1046 transitions (discarded 34 similar events)
// Phase 1: matrix 1046 rows 491 cols
[2021-05-08 23:32:20] [INFO ] Computed 157 place invariants in 7 ms
[2021-05-08 23:32:20] [INFO ] Dead Transitions using invariants and state equation in 452 ms returned []
Finished structural reductions, in 1 iterations. Remains : 491/1952 places, 1080/3502 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-08b-15 automaton TGBA [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 s67 0)], 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 16 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-08b-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-08b-15 finished in 1765 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9905580754582261417
[2021-05-08 23:32:20] [INFO ] Too many transitions (3502) to apply POR reductions. Disabling POR matrices.
[2021-05-08 23:32:20] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9905580754582261417
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9905580754582261417]
[2021-05-08 23:32:20] [INFO ] Applying decomposition
[2021-05-08 23:32:20] [INFO ] Flatten gal took : 76 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6080714753770143165.txt, -o, /tmp/graph6080714753770143165.bin, -w, /tmp/graph6080714753770143165.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6080714753770143165.bin, -l, -1, -v, -w, /tmp/graph6080714753770143165.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 23:32:20] [INFO ] Decomposing Gal with order
[2021-05-08 23:32:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 23:32:21] [INFO ] Removed a total of 3286 redundant transitions.
[2021-05-08 23:32:21] [INFO ] Flatten gal took : 168 ms
[2021-05-08 23:32:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 83 ms.
[2021-05-08 23:32:21] [INFO ] Time to serialize gal into /tmp/LTLFireability6113195587534901593.gal : 38 ms
[2021-05-08 23:32:21] [INFO ] Time to serialize properties into /tmp/LTLFireability16891542828168935290.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability6113195587534901593.gal, -t, CGAL, -LTL, /tmp/LTLFireability16891542828168935290.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability6113195587534901593.gal -t CGAL -LTL /tmp/LTLFireability16891542828168935290.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((F(G((("((((i0.i0.i2.u13.p37==0)||(i0.i1.i6.u577.p2294==0))||(i9.u191.p863==0))||(i9.u652.p2654==0))")||(X("((i16.u297.p1161==1)||((i9.u191.p863==1)&&(i9.u652.p2654==1)))")))&&(("((((i0.i0.i2.u13.p37==0)||(i0.i1.i6.u577.p2294==0))||(i9.u191.p863==0))||(i9.u652.p2654==0))")||(F("((i9.u191.p863==1)&&(i9.u652.p2654==1))")))))))
Formula 0 simplified : !FG(("((((i0.i0.i2.u13.p37==0)||(i0.i1.i6.u577.p2294==0))||(i9.u191.p863==0))||(i9.u652.p2654==0))" | X"((i16.u297.p1161==1)||((i9.u191.p863==1)&&(i9.u652.p2654==1)))") & ("((((i0.i0.i2.u13.p37==0)||(i0.i1.i6.u577.p2294==0))||(i9.u191.p863==0))||(i9.u652.p2654==0))" | F"((i9.u191.p863==1)&&(i9.u652.p2654==1))"))
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9905580754582261417] killed by timeout after 27 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9905580754582261417] killed by timeout after 27 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-08 23:54:35] [INFO ] Applying decomposition
[2021-05-08 23:54:35] [INFO ] Flatten gal took : 354 ms
[2021-05-08 23:54:35] [INFO ] Decomposing Gal with order
[2021-05-08 23:54:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 23:54:37] [INFO ] Removed a total of 2786 redundant transitions.
[2021-05-08 23:54:38] [INFO ] Flatten gal took : 472 ms
[2021-05-08 23:54:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 21276 labels/synchronizations in 3261 ms.
[2021-05-08 23:54:57] [INFO ] Time to serialize gal into /tmp/LTLFireability9567141421735465391.gal : 44 ms
[2021-05-08 23:54:57] [INFO ] Time to serialize properties into /tmp/LTLFireability9423557225193118853.ltl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability9567141421735465391.gal, -t, CGAL, -LTL, /tmp/LTLFireability9423557225193118853.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability9567141421735465391.gal -t CGAL -LTL /tmp/LTLFireability9423557225193118853.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((F(G((("((((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u13.p37==0)||(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u233.p2294==0))||(i0.i0.i0.i0.i0.i0.u20.p863==0))||(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u269.p2654==0))")||(X("((i0.i0.i0.u23.p1161==1)||((i0.i0.i0.i0.i0.i0.u20.p863==1)&&(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u269.p2654==1)))")))&&(("((((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u13.p37==0)||(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u233.p2294==0))||(i0.i0.i0.i0.i0.i0.u20.p863==0))||(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u269.p2654==0))")||(F("((i0.i0.i0.i0.i0.i0.u20.p863==1)&&(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u269.p2654==1))")))))))
Formula 0 simplified : !FG(("((((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u13.p37==0)||(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u233.p2294==0))||(i0.i0.i0.i0.i0.i0.u20.p863==0))||(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u269.p2654==0))" | X"((i0.i0.i0.u23.p1161==1)||((i0.i0.i0.i0.i0.i0.u20.p863==1)&&(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u269.p2654==1)))") & ("((((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u13.p37==0)||(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u233.p2294==0))||(i0.i0.i0.i0.i0.i0.u20.p863==0))||(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u269.p2654==0))" | F"((i0.i0.i0.i0.i0.i0.u20.p863==1)&&(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u269.p2654==1))"))
Detected timeout of ITS tools.
[2021-05-09 00:16:38] [INFO ] Flatten gal took : 316 ms
[2021-05-09 00:16:42] [INFO ] Input system was already deterministic with 3502 transitions.
[2021-05-09 00:16:42] [INFO ] Transformed 1952 places.
[2021-05-09 00:16:42] [INFO ] Transformed 3502 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-09 00:16:43] [INFO ] Time to serialize gal into /tmp/LTLFireability14622291003793672249.gal : 24 ms
[2021-05-09 00:16:43] [INFO ] Time to serialize properties into /tmp/LTLFireability14111003924056597197.ltl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability14622291003793672249.gal, -t, CGAL, -LTL, /tmp/LTLFireability14111003924056597197.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability14622291003793672249.gal -t CGAL -LTL /tmp/LTLFireability14111003924056597197.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G((("((((p37==0)||(p2294==0))||(p863==0))||(p2654==0))")||(X("((p1161==1)||((p863==1)&&(p2654==1)))")))&&(("((((p37==0)||(p2294==0))||(p863==0))||(p2654==0))")||(F("((p863==1)&&(p2654==1))")))))))
Formula 0 simplified : !FG(("((((p37==0)||(p2294==0))||(p863==0))||(p2654==0))" | X"((p1161==1)||((p863==1)&&(p2654==1)))") & ("((((p37==0)||(p2294==0))||(p863==0))||(p2654==0))" | F"((p863==1)&&(p2654==1))"))

BK_TIME_CONFINEMENT_REACHED

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="DLCround-PT-08b"
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 DLCround-PT-08b, 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 r064-tall-162038397100365"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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