Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 320K
-rw-r--r-- 1 mcc users 7.6K Apr 29 15:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 29 15:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 29 15:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 15:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 07:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 79K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652734316320

Running Version 202205111006
[2022-05-16 20:51:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 20:51:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 20:51:58] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2022-05-16 20:51:58] [INFO ] Transformed 320 places.
[2022-05-16 20:51:58] [INFO ] Transformed 271 transitions.
[2022-05-16 20:51:58] [INFO ] Found NUPN structural information;
[2022-05-16 20:51:58] [INFO ] Parsed PT model containing 320 places and 271 transitions in 416 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DES-PT-10b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 271/271 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 317 transition count 271
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 296 transition count 250
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 296 transition count 250
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 56 place count 285 transition count 239
Iterating global reduction 1 with 11 rules applied. Total rules applied 67 place count 285 transition count 239
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 77 place count 285 transition count 229
Applied a total of 77 rules in 144 ms. Remains 285 /320 variables (removed 35) and now considering 229/271 (removed 42) transitions.
// Phase 1: matrix 229 rows 285 cols
[2022-05-16 20:51:59] [INFO ] Computed 62 place invariants in 35 ms
[2022-05-16 20:51:59] [INFO ] Implicit Places using invariants in 648 ms returned []
// Phase 1: matrix 229 rows 285 cols
[2022-05-16 20:51:59] [INFO ] Computed 62 place invariants in 17 ms
[2022-05-16 20:52:00] [INFO ] Implicit Places using invariants and state equation in 654 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1376 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 284/320 places, 229/271 transitions.
Applied a total of 0 rules in 13 ms. Remains 284 /284 variables (removed 0) and now considering 229/229 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 284/320 places, 229/271 transitions.
Support contains 52 out of 284 places after structural reductions.
[2022-05-16 20:52:01] [INFO ] Flatten gal took : 113 ms
[2022-05-16 20:52:01] [INFO ] Flatten gal took : 47 ms
[2022-05-16 20:52:01] [INFO ] Input system was already deterministic with 229 transitions.
Support contains 50 out of 284 places (down from 52) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 87 resets, run finished after 834 ms. (steps per millisecond=11 ) properties (out of 32) seen :29
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 229 rows 284 cols
[2022-05-16 20:52:02] [INFO ] Computed 61 place invariants in 9 ms
[2022-05-16 20:52:02] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 20:52:02] [INFO ] [Nat]Absence check using 32 positive place invariants in 12 ms returned sat
[2022-05-16 20:52:02] [INFO ] [Nat]Absence check using 32 positive and 29 generalized place invariants in 18 ms returned sat
[2022-05-16 20:52:02] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-16 20:52:02] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 7 ms to minimize.
[2022-05-16 20:52:02] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2022-05-16 20:52:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 226 ms
[2022-05-16 20:52:02] [INFO ] After 411ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2022-05-16 20:52:03] [INFO ] After 616ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 284 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 284/284 places, 229/229 transitions.
Graph (complete) has 546 edges and 284 vertex of which 277 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.7 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 277 transition count 203
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 41 place count 258 transition count 203
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 41 place count 258 transition count 193
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 61 place count 248 transition count 193
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 65 place count 244 transition count 189
Iterating global reduction 2 with 4 rules applied. Total rules applied 69 place count 244 transition count 189
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 244 transition count 186
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 243 transition count 185
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 74 place count 243 transition count 184
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 76 place count 242 transition count 184
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 77 place count 241 transition count 183
Iterating global reduction 4 with 1 rules applied. Total rules applied 78 place count 241 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 79 place count 241 transition count 182
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 79 place count 241 transition count 181
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 81 place count 240 transition count 181
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 229 place count 166 transition count 107
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 235 place count 163 transition count 115
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 236 place count 163 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 237 place count 162 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 238 place count 161 transition count 113
Applied a total of 238 rules in 200 ms. Remains 161 /284 variables (removed 123) and now considering 113/229 (removed 116) transitions.
Finished structural reductions, in 1 iterations. Remains : 161/284 places, 113/229 transitions.
Incomplete random walk after 10000 steps, including 460 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1385356 steps, run timeout after 3001 ms. (steps per millisecond=461 ) properties seen :{}
Probabilistic random walk after 1385356 steps, saw 187587 distinct states, run finished after 3003 ms. (steps per millisecond=461 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 113 rows 161 cols
[2022-05-16 20:52:06] [INFO ] Computed 61 place invariants in 3 ms
[2022-05-16 20:52:06] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 20:52:06] [INFO ] [Nat]Absence check using 37 positive place invariants in 12 ms returned sat
[2022-05-16 20:52:06] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 76 ms returned sat
[2022-05-16 20:52:06] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 20:52:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 20:52:06] [INFO ] After 12ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 20:52:06] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-05-16 20:52:06] [INFO ] After 328ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 161/161 places, 113/113 transitions.
Applied a total of 0 rules in 10 ms. Remains 161 /161 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 161/161 places, 113/113 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 161/161 places, 113/113 transitions.
Applied a total of 0 rules in 10 ms. Remains 161 /161 variables (removed 0) and now considering 113/113 (removed 0) transitions.
// Phase 1: matrix 113 rows 161 cols
[2022-05-16 20:52:06] [INFO ] Computed 61 place invariants in 4 ms
[2022-05-16 20:52:07] [INFO ] Implicit Places using invariants in 193 ms returned []
// Phase 1: matrix 113 rows 161 cols
[2022-05-16 20:52:07] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 20:52:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 20:52:07] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2022-05-16 20:52:07] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 113 rows 161 cols
[2022-05-16 20:52:07] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 20:52:07] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 161/161 places, 113/113 transitions.
Graph (complete) has 519 edges and 161 vertex of which 160 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 160 /161 variables (removed 1) and now considering 113/113 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 113 rows 160 cols
[2022-05-16 20:52:07] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-16 20:52:07] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 20:52:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2022-05-16 20:52:07] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2022-05-16 20:52:07] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 20:52:07] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-05-16 20:52:07] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-16 20:52:07] [INFO ] Flatten gal took : 25 ms
[2022-05-16 20:52:07] [INFO ] Flatten gal took : 23 ms
[2022-05-16 20:52:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5409234552868246434.gal : 13 ms
[2022-05-16 20:52:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2249348829570924350.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms7744466297650494766;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5409234552868246434.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2249348829570924350.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality2249348829570924350.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 18
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :18 after 26
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :26 after 138
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :138 after 798
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :798 after 2766
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2766 after 5214
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5214 after 13374
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :13374 after 325764
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :557676 after 1.92404e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.38201e+06 after 5.36846e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5.36846e+07 after 5.97299e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.97299e+08 after 2.65952e+09
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.65952e+09 after 5.08134e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :5.08134e+09 after 5.56426e+09
Detected timeout of ITS tools.
[2022-05-16 20:52:22] [INFO ] Flatten gal took : 16 ms
[2022-05-16 20:52:22] [INFO ] Applying decomposition
[2022-05-16 20:52:22] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15838314945087488503.txt' '-o' '/tmp/graph15838314945087488503.bin' '-w' '/tmp/graph15838314945087488503.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15838314945087488503.bin' '-l' '-1' '-v' '-w' '/tmp/graph15838314945087488503.weights' '-q' '0' '-e' '0.001'
[2022-05-16 20:52:23] [INFO ] Decomposing Gal with order
[2022-05-16 20:52:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 20:52:23] [INFO ] Removed a total of 74 redundant transitions.
[2022-05-16 20:52:23] [INFO ] Flatten gal took : 74 ms
[2022-05-16 20:52:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 12 ms.
[2022-05-16 20:52:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13064972553215962825.gal : 7 ms
[2022-05-16 20:52:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15803100068497740911.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms7744466297650494766;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13064972553215962825.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15803100068497740911.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityCardinality15803100068497740911.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 158
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :158 after 30978
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :141972 after 5.80486e+08
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :5.80486e+08 after 7.35768e+08
Reachability property AtomicPropp20 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.83771e+09,0.863325,28828,3389,308,54159,958,343,117550,148,2387,0
Total reachable state count : 2837708892

Verifying 1 reachability properties.
Reachability property AtomicPropp20 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp20,144,0.86755,29092,61,63,54159,958,351,117550,155,2387,0
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 99 stabilizing places and 92 stable transitions
Graph (complete) has 546 edges and 284 vertex of which 277 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.11 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U X(p1))||G(p2)))'
Support contains 5 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 229/229 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 277 transition count 222
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 277 transition count 222
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 277 transition count 220
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 274 transition count 217
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 274 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 274 transition count 216
Applied a total of 23 rules in 36 ms. Remains 274 /284 variables (removed 10) and now considering 216/229 (removed 13) transitions.
// Phase 1: matrix 216 rows 274 cols
[2022-05-16 20:52:24] [INFO ] Computed 61 place invariants in 3 ms
[2022-05-16 20:52:24] [INFO ] Implicit Places using invariants in 313 ms returned []
// Phase 1: matrix 216 rows 274 cols
[2022-05-16 20:52:24] [INFO ] Computed 61 place invariants in 13 ms
[2022-05-16 20:52:25] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 830 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 274 cols
[2022-05-16 20:52:25] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 20:52:25] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 274/284 places, 216/229 transitions.
Finished structural reductions, in 1 iterations. Remains : 274/284 places, 216/229 transitions.
Stuttering acceptance computed with spot in 512 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : DES-PT-10b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}]], initial=1, aps=[p0:(AND (EQ s72 1) (EQ s237 1)), p2:(EQ s97 0), p1:(AND (EQ s35 1) (EQ s123 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 62 steps with 0 reset in 4 ms.
FORMULA DES-PT-10b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-00 finished in 1692 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(p0 U p1)||p2)))'
Support contains 2 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 229/229 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 277 transition count 222
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 277 transition count 222
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 277 transition count 220
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 20 place count 273 transition count 216
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 273 transition count 216
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 273 transition count 214
Applied a total of 26 rules in 27 ms. Remains 273 /284 variables (removed 11) and now considering 214/229 (removed 15) transitions.
// Phase 1: matrix 214 rows 273 cols
[2022-05-16 20:52:26] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 20:52:26] [INFO ] Implicit Places using invariants in 199 ms returned []
// Phase 1: matrix 214 rows 273 cols
[2022-05-16 20:52:26] [INFO ] Computed 61 place invariants in 6 ms
[2022-05-16 20:52:26] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
// Phase 1: matrix 214 rows 273 cols
[2022-05-16 20:52:26] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 20:52:27] [INFO ] Dead Transitions using invariants and state equation in 309 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 273/284 places, 214/229 transitions.
Finished structural reductions, in 1 iterations. Remains : 273/284 places, 214/229 transitions.
Stuttering acceptance computed with spot in 171 ms :[true, (AND p1 (NOT p2)), p1, (AND p1 (NOT p2))]
Running random walk in product with property : DES-PT-10b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(NEQ s242 1), p0:(EQ s175 1), p2:(EQ s242 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 428 ms.
Product exploration explored 100000 steps with 50000 reset in 372 ms.
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 527 edges and 273 vertex of which 268 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Computed a total of 96 stabilizing places and 89 stable transitions
Detected a total of 96/273 stabilizing places and 89/214 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) p0 (NOT p1))))
Knowledge based reduction with 9 factoid took 220 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA DES-PT-10b-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-10b-LTLFireability-01 finished in 2198 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(!(X(p1)||p1)&&G(p2)&&p0) U X(X(p3))))'
Support contains 5 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 229/229 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 278 transition count 223
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 278 transition count 223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 278 transition count 221
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 274 transition count 217
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 274 transition count 217
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 274 transition count 215
Applied a total of 24 rules in 21 ms. Remains 274 /284 variables (removed 10) and now considering 215/229 (removed 14) transitions.
// Phase 1: matrix 215 rows 274 cols
[2022-05-16 20:52:28] [INFO ] Computed 61 place invariants in 1 ms
[2022-05-16 20:52:28] [INFO ] Implicit Places using invariants in 198 ms returned []
// Phase 1: matrix 215 rows 274 cols
[2022-05-16 20:52:28] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 20:52:29] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
// Phase 1: matrix 215 rows 274 cols
[2022-05-16 20:52:29] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 20:52:29] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 274/284 places, 215/229 transitions.
Finished structural reductions, in 1 iterations. Remains : 274/284 places, 215/229 transitions.
Stuttering acceptance computed with spot in 353 ms :[(NOT p3), (NOT p3), (AND p2 (NOT p1) (NOT p3)), (NOT p3), (AND p2 (NOT p1) (NOT p3)), (AND p2 (NOT p3)), p2]
Running random walk in product with property : DES-PT-10b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p3), acceptance={} source=3 dest: 3}, { cond=(AND p2 p0 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 6}], [{ cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s102 1), p0:(AND (EQ s249 1) (EQ s251 1)), p1:(AND (EQ s250 1) (EQ s261 1)), p3:(AND (EQ s249 1) (EQ s251 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 1 ms.
FORMULA DES-PT-10b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-02 finished in 1274 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 229/229 transitions.
Graph (complete) has 546 edges and 284 vertex of which 279 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 278 transition count 208
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 261 transition count 208
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 35 place count 261 transition count 198
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 55 place count 251 transition count 198
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 247 transition count 194
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 247 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 66 place count 247 transition count 191
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 68 place count 246 transition count 190
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 68 place count 246 transition count 189
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 70 place count 245 transition count 189
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 244 transition count 188
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 244 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 244 transition count 187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 73 place count 244 transition count 186
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 75 place count 243 transition count 186
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 227 place count 167 transition count 110
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 233 place count 164 transition count 118
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 162 transition count 116
Applied a total of 235 rules in 138 ms. Remains 162 /284 variables (removed 122) and now considering 116/229 (removed 113) transitions.
// Phase 1: matrix 116 rows 162 cols
[2022-05-16 20:52:29] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 20:52:30] [INFO ] Implicit Places using invariants in 258 ms returned []
// Phase 1: matrix 116 rows 162 cols
[2022-05-16 20:52:30] [INFO ] Computed 59 place invariants in 9 ms
[2022-05-16 20:52:30] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 20:52:30] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
[2022-05-16 20:52:30] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 116 rows 162 cols
[2022-05-16 20:52:30] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 20:52:30] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/284 places, 116/229 transitions.
Finished structural reductions, in 1 iterations. Remains : 162/284 places, 116/229 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s59 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA DES-PT-10b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-03 finished in 1091 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(p0))))'
Support contains 1 out of 284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 229/229 transitions.
Graph (complete) has 546 edges and 284 vertex of which 277 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 277 transition count 207
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 260 transition count 207
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 35 place count 260 transition count 197
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 55 place count 250 transition count 197
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 246 transition count 193
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 246 transition count 193
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 66 place count 246 transition count 190
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 68 place count 245 transition count 189
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 68 place count 245 transition count 188
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 70 place count 244 transition count 188
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 243 transition count 187
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 243 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 243 transition count 186
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 73 place count 243 transition count 185
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 75 place count 242 transition count 185
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 5 with 154 rules applied. Total rules applied 229 place count 165 transition count 108
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 235 place count 162 transition count 116
Applied a total of 235 rules in 101 ms. Remains 162 /284 variables (removed 122) and now considering 116/229 (removed 113) transitions.
// Phase 1: matrix 116 rows 162 cols
[2022-05-16 20:52:30] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 20:52:31] [INFO ] Implicit Places using invariants in 229 ms returned []
// Phase 1: matrix 116 rows 162 cols
[2022-05-16 20:52:31] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-16 20:52:31] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 20:52:31] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
[2022-05-16 20:52:31] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 116 rows 162 cols
[2022-05-16 20:52:31] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 20:52:31] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/284 places, 116/229 transitions.
Finished structural reductions, in 1 iterations. Remains : 162/284 places, 116/229 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4869 reset in 736 ms.
Product exploration explored 100000 steps with 4909 reset in 845 ms.
Computed a total of 59 stabilizing places and 60 stable transitions
Computed a total of 59 stabilizing places and 60 stable transitions
Detected a total of 59/162 stabilizing places and 60/116 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 227 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 247 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 116/116 transitions.
Applied a total of 0 rules in 10 ms. Remains 162 /162 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 162 cols
[2022-05-16 20:52:33] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 20:52:34] [INFO ] Implicit Places using invariants in 289 ms returned []
// Phase 1: matrix 116 rows 162 cols
[2022-05-16 20:52:34] [INFO ] Computed 59 place invariants in 6 ms
[2022-05-16 20:52:34] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 20:52:34] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
[2022-05-16 20:52:34] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 116 rows 162 cols
[2022-05-16 20:52:34] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 20:52:34] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 162/162 places, 116/116 transitions.
Computed a total of 59 stabilizing places and 60 stable transitions
Computed a total of 59 stabilizing places and 60 stable transitions
Detected a total of 59/162 stabilizing places and 60/116 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 202 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 199 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4937 reset in 552 ms.
Product exploration explored 100000 steps with 4906 reset in 371 ms.
Built C files in :
/tmp/ltsmin13792588854956571900
[2022-05-16 20:52:36] [INFO ] Computing symmetric may disable matrix : 116 transitions.
[2022-05-16 20:52:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:52:36] [INFO ] Computing symmetric may enable matrix : 116 transitions.
[2022-05-16 20:52:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:52:36] [INFO ] Computing Do-Not-Accords matrix : 116 transitions.
[2022-05-16 20:52:36] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:52:36] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13792588854956571900
Running compilation step : cd /tmp/ltsmin13792588854956571900;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 530 ms.
Running link step : cd /tmp/ltsmin13792588854956571900;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin13792588854956571900;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17187601116274400978.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 116/116 transitions.
Applied a total of 0 rules in 20 ms. Remains 162 /162 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 162 cols
[2022-05-16 20:52:51] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 20:52:51] [INFO ] Implicit Places using invariants in 196 ms returned []
// Phase 1: matrix 116 rows 162 cols
[2022-05-16 20:52:51] [INFO ] Computed 59 place invariants in 4 ms
[2022-05-16 20:52:51] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 20:52:52] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
[2022-05-16 20:52:52] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 116 rows 162 cols
[2022-05-16 20:52:52] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 20:52:52] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 162/162 places, 116/116 transitions.
Built C files in :
/tmp/ltsmin5538404636744599253
[2022-05-16 20:52:52] [INFO ] Computing symmetric may disable matrix : 116 transitions.
[2022-05-16 20:52:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:52:52] [INFO ] Computing symmetric may enable matrix : 116 transitions.
[2022-05-16 20:52:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:52:52] [INFO ] Computing Do-Not-Accords matrix : 116 transitions.
[2022-05-16 20:52:52] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:52:52] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5538404636744599253
Running compilation step : cd /tmp/ltsmin5538404636744599253;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 619 ms.
Running link step : cd /tmp/ltsmin5538404636744599253;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin5538404636744599253;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16294025608231283987.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 20:53:07] [INFO ] Flatten gal took : 15 ms
[2022-05-16 20:53:07] [INFO ] Flatten gal took : 14 ms
[2022-05-16 20:53:07] [INFO ] Time to serialize gal into /tmp/LTL638329127080193711.gal : 3 ms
[2022-05-16 20:53:07] [INFO ] Time to serialize properties into /tmp/LTL16357656577806099940.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL638329127080193711.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16357656577806099940.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6383291...266
Read 1 LTL properties
Checking formula 0 : !((G(F(G("(p1!=1)")))))
Formula 0 simplified : !GFG"(p1!=1)"
Detected timeout of ITS tools.
[2022-05-16 20:53:22] [INFO ] Flatten gal took : 13 ms
[2022-05-16 20:53:22] [INFO ] Applying decomposition
[2022-05-16 20:53:22] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph531294141662144572.txt' '-o' '/tmp/graph531294141662144572.bin' '-w' '/tmp/graph531294141662144572.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph531294141662144572.bin' '-l' '-1' '-v' '-w' '/tmp/graph531294141662144572.weights' '-q' '0' '-e' '0.001'
[2022-05-16 20:53:22] [INFO ] Decomposing Gal with order
[2022-05-16 20:53:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 20:53:22] [INFO ] Removed a total of 62 redundant transitions.
[2022-05-16 20:53:22] [INFO ] Flatten gal took : 44 ms
[2022-05-16 20:53:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 28 ms.
[2022-05-16 20:53:22] [INFO ] Time to serialize gal into /tmp/LTL16046178510854567528.gal : 6 ms
[2022-05-16 20:53:22] [INFO ] Time to serialize properties into /tmp/LTL5589001113603188118.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16046178510854567528.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5589001113603188118.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1604617...246
Read 1 LTL properties
Checking formula 0 : !((G(F(G("(u9.p1!=1)")))))
Formula 0 simplified : !GFG"(u9.p1!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18226665607545405459
[2022-05-16 20:53:37] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18226665607545405459
Running compilation step : cd /tmp/ltsmin18226665607545405459;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 357 ms.
Running link step : cd /tmp/ltsmin18226665607545405459;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin18226665607545405459;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>([]((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-10b-LTLFireability-04 finished in 82066 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(X(X(G(p1))))||p0))||G(p2)))'
Support contains 4 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 229/229 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 278 transition count 223
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 278 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 278 transition count 222
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 274 transition count 218
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 274 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 274 transition count 216
Applied a total of 23 rules in 16 ms. Remains 274 /284 variables (removed 10) and now considering 216/229 (removed 13) transitions.
// Phase 1: matrix 216 rows 274 cols
[2022-05-16 20:53:52] [INFO ] Computed 61 place invariants in 9 ms
[2022-05-16 20:53:53] [INFO ] Implicit Places using invariants in 265 ms returned []
// Phase 1: matrix 216 rows 274 cols
[2022-05-16 20:53:53] [INFO ] Computed 61 place invariants in 3 ms
[2022-05-16 20:53:53] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 846 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 274 cols
[2022-05-16 20:53:53] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 20:53:54] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 274/284 places, 216/229 transitions.
Finished structural reductions, in 1 iterations. Remains : 274/284 places, 216/229 transitions.
Stuttering acceptance computed with spot in 421 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : DES-PT-10b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={} source=2 dest: 5}, { cond=p2, acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 7}], [{ cond=(NOT p2), acceptance={} source=6 dest: 7}, { cond=p2, acceptance={} source=6 dest: 8}], [{ cond=(NOT p1), acceptance={} source=7 dest: 0}, { cond=p1, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 7}, { cond=(AND p2 p1), acceptance={} source=8 dest: 8}, { cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 9}], [{ cond=(NOT p2), acceptance={} source=9 dest: 0}, { cond=p2, acceptance={} source=9 dest: 9}]], initial=3, aps=[p2:(OR (EQ s76 0) (EQ s256 0)), p0:(OR (EQ s141 0) (EQ s150 0)), p1:(AND (EQ s76 1) (EQ s256 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 651 steps with 5 reset in 3 ms.
FORMULA DES-PT-10b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-05 finished in 1644 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 8 out of 284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 229/229 transitions.
Graph (complete) has 546 edges and 284 vertex of which 277 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 276 transition count 208
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 261 transition count 208
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 261 transition count 198
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 51 place count 251 transition count 198
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 55 place count 247 transition count 194
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 247 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 62 place count 247 transition count 191
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 64 place count 246 transition count 190
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 64 place count 246 transition count 189
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 245 transition count 189
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 67 place count 244 transition count 188
Iterating global reduction 4 with 1 rules applied. Total rules applied 68 place count 244 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 69 place count 244 transition count 187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 69 place count 244 transition count 186
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 71 place count 243 transition count 186
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 5 with 138 rules applied. Total rules applied 209 place count 174 transition count 117
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 213 place count 172 transition count 119
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 215 place count 170 transition count 117
Applied a total of 215 rules in 52 ms. Remains 170 /284 variables (removed 114) and now considering 117/229 (removed 112) transitions.
// Phase 1: matrix 117 rows 170 cols
[2022-05-16 20:53:54] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 20:53:54] [INFO ] Implicit Places using invariants in 241 ms returned []
// Phase 1: matrix 117 rows 170 cols
[2022-05-16 20:53:54] [INFO ] Computed 59 place invariants in 5 ms
[2022-05-16 20:53:55] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
[2022-05-16 20:53:55] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 117 rows 170 cols
[2022-05-16 20:53:55] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 20:53:55] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/284 places, 117/229 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/284 places, 117/229 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s43 1) (EQ s46 1) (EQ s52 1) (EQ s53 1) (EQ s56 1) (EQ s60 1) (EQ s89 1) (EQ s163 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 1 ms.
FORMULA DES-PT-10b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-06 finished in 993 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(G(F(p0))))))'
Support contains 2 out of 284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 229/229 transitions.
Graph (complete) has 546 edges and 284 vertex of which 277 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 276 transition count 206
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 259 transition count 206
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 35 place count 259 transition count 196
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 55 place count 249 transition count 196
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 245 transition count 192
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 245 transition count 192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 66 place count 245 transition count 189
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 68 place count 244 transition count 188
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 68 place count 244 transition count 187
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 70 place count 243 transition count 187
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 242 transition count 186
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 242 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 242 transition count 185
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 73 place count 242 transition count 184
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 75 place count 241 transition count 184
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 225 place count 166 transition count 109
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 231 place count 163 transition count 117
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 233 place count 161 transition count 115
Applied a total of 233 rules in 59 ms. Remains 161 /284 variables (removed 123) and now considering 115/229 (removed 114) transitions.
// Phase 1: matrix 115 rows 161 cols
[2022-05-16 20:53:55] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 20:53:55] [INFO ] Implicit Places using invariants in 248 ms returned []
// Phase 1: matrix 115 rows 161 cols
[2022-05-16 20:53:55] [INFO ] Computed 59 place invariants in 8 ms
[2022-05-16 20:53:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 20:53:56] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
[2022-05-16 20:53:56] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 115 rows 161 cols
[2022-05-16 20:53:56] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 20:53:56] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/284 places, 115/229 transitions.
Finished structural reductions, in 1 iterations. Remains : 161/284 places, 115/229 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s133 0) (EQ s136 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]]
Product exploration explored 100000 steps with 5957 reset in 292 ms.
Product exploration explored 100000 steps with 5931 reset in 325 ms.
Computed a total of 57 stabilizing places and 58 stable transitions
Computed a total of 57 stabilizing places and 58 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Finished random walk after 100 steps, including 5 resets, run visited all 1 properties in 3 ms. (steps per millisecond=33 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 175 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 115/115 transitions.
Applied a total of 0 rules in 9 ms. Remains 161 /161 variables (removed 0) and now considering 115/115 (removed 0) transitions.
// Phase 1: matrix 115 rows 161 cols
[2022-05-16 20:53:57] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 20:53:57] [INFO ] Implicit Places using invariants in 226 ms returned []
// Phase 1: matrix 115 rows 161 cols
[2022-05-16 20:53:57] [INFO ] Computed 59 place invariants in 7 ms
[2022-05-16 20:53:58] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 20:53:58] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
[2022-05-16 20:53:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 115 rows 161 cols
[2022-05-16 20:53:58] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 20:53:58] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 161/161 places, 115/115 transitions.
Computed a total of 57 stabilizing places and 58 stable transitions
Computed a total of 57 stabilizing places and 58 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Finished random walk after 76 steps, including 4 resets, run visited all 1 properties in 2 ms. (steps per millisecond=38 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5919 reset in 501 ms.
Product exploration explored 100000 steps with 5904 reset in 457 ms.
Built C files in :
/tmp/ltsmin17453659405367343195
[2022-05-16 20:54:00] [INFO ] Computing symmetric may disable matrix : 115 transitions.
[2022-05-16 20:54:00] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:54:00] [INFO ] Computing symmetric may enable matrix : 115 transitions.
[2022-05-16 20:54:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:54:00] [INFO ] Computing Do-Not-Accords matrix : 115 transitions.
[2022-05-16 20:54:00] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:54:00] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17453659405367343195
Running compilation step : cd /tmp/ltsmin17453659405367343195;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 407 ms.
Running link step : cd /tmp/ltsmin17453659405367343195;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17453659405367343195;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12001697271208728536.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 115/115 transitions.
Applied a total of 0 rules in 6 ms. Remains 161 /161 variables (removed 0) and now considering 115/115 (removed 0) transitions.
// Phase 1: matrix 115 rows 161 cols
[2022-05-16 20:54:15] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 20:54:15] [INFO ] Implicit Places using invariants in 176 ms returned []
// Phase 1: matrix 115 rows 161 cols
[2022-05-16 20:54:15] [INFO ] Computed 59 place invariants in 8 ms
[2022-05-16 20:54:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 20:54:15] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
[2022-05-16 20:54:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 115 rows 161 cols
[2022-05-16 20:54:15] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 20:54:16] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 161/161 places, 115/115 transitions.
Built C files in :
/tmp/ltsmin11071187563269325164
[2022-05-16 20:54:16] [INFO ] Computing symmetric may disable matrix : 115 transitions.
[2022-05-16 20:54:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:54:16] [INFO ] Computing symmetric may enable matrix : 115 transitions.
[2022-05-16 20:54:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:54:16] [INFO ] Computing Do-Not-Accords matrix : 115 transitions.
[2022-05-16 20:54:16] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:54:16] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11071187563269325164
Running compilation step : cd /tmp/ltsmin11071187563269325164;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 431 ms.
Running link step : cd /tmp/ltsmin11071187563269325164;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11071187563269325164;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15341485629345491234.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 20:54:31] [INFO ] Flatten gal took : 24 ms
[2022-05-16 20:54:31] [INFO ] Flatten gal took : 20 ms
[2022-05-16 20:54:31] [INFO ] Time to serialize gal into /tmp/LTL4807184168464802915.gal : 2 ms
[2022-05-16 20:54:31] [INFO ] Time to serialize properties into /tmp/LTL18331327189960887513.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4807184168464802915.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18331327189960887513.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4807184...267
Read 1 LTL properties
Checking formula 0 : !((X(F(G(G(F("((p273==0)||(p277==0))")))))))
Formula 0 simplified : !XFGF"((p273==0)||(p277==0))"
Detected timeout of ITS tools.
[2022-05-16 20:54:46] [INFO ] Flatten gal took : 10 ms
[2022-05-16 20:54:46] [INFO ] Applying decomposition
[2022-05-16 20:54:46] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11446459308513031366.txt' '-o' '/tmp/graph11446459308513031366.bin' '-w' '/tmp/graph11446459308513031366.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11446459308513031366.bin' '-l' '-1' '-v' '-w' '/tmp/graph11446459308513031366.weights' '-q' '0' '-e' '0.001'
[2022-05-16 20:54:46] [INFO ] Decomposing Gal with order
[2022-05-16 20:54:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 20:54:46] [INFO ] Removed a total of 70 redundant transitions.
[2022-05-16 20:54:46] [INFO ] Flatten gal took : 20 ms
[2022-05-16 20:54:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 4 ms.
[2022-05-16 20:54:46] [INFO ] Time to serialize gal into /tmp/LTL7238659285660014696.gal : 3 ms
[2022-05-16 20:54:46] [INFO ] Time to serialize properties into /tmp/LTL5244606338485277267.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7238659285660014696.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5244606338485277267.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7238659...245
Read 1 LTL properties
Checking formula 0 : !((X(F(G(G(F("((i1.i1.u29.p273==0)||(i13.i2.u38.p277==0))")))))))
Formula 0 simplified : !XFGF"((i1.i1.u29.p273==0)||(i13.i2.u38.p277==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3943874562290361111
[2022-05-16 20:55:01] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3943874562290361111
Running compilation step : cd /tmp/ltsmin3943874562290361111;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 542 ms.
Running link step : cd /tmp/ltsmin3943874562290361111;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin3943874562290361111;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>([]([](<>((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-10b-LTLFireability-07 finished in 81189 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(p1)&&p2)))'
Support contains 6 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 229/229 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 278 transition count 223
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 278 transition count 223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 278 transition count 221
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 275 transition count 218
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 275 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 275 transition count 216
Applied a total of 22 rules in 26 ms. Remains 275 /284 variables (removed 9) and now considering 216/229 (removed 13) transitions.
// Phase 1: matrix 216 rows 275 cols
[2022-05-16 20:55:16] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 20:55:16] [INFO ] Implicit Places using invariants in 211 ms returned []
// Phase 1: matrix 216 rows 275 cols
[2022-05-16 20:55:16] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 20:55:17] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 825 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 275 cols
[2022-05-16 20:55:17] [INFO ] Computed 61 place invariants in 4 ms
[2022-05-16 20:55:17] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 275/284 places, 216/229 transitions.
Finished structural reductions, in 1 iterations. Remains : 275/284 places, 216/229 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true]
Running random walk in product with property : DES-PT-10b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=(AND p2 p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p2) (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=[p0:(OR (EQ s3 1) (EQ s107 0) (EQ s109 0)), p1:(EQ s78 1), p2:(OR (EQ s28 0) (EQ s124 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3782 steps with 32 reset in 13 ms.
FORMULA DES-PT-10b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-08 finished in 1415 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 3 out of 284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 229/229 transitions.
Graph (complete) has 546 edges and 284 vertex of which 277 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 276 transition count 209
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 262 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 261 transition count 208
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 31 place count 261 transition count 198
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 51 place count 251 transition count 198
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 55 place count 247 transition count 194
Iterating global reduction 3 with 4 rules applied. Total rules applied 59 place count 247 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 62 place count 247 transition count 191
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 64 place count 246 transition count 190
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 64 place count 246 transition count 189
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 66 place count 245 transition count 189
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 67 place count 244 transition count 188
Iterating global reduction 5 with 1 rules applied. Total rules applied 68 place count 244 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 69 place count 244 transition count 187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 69 place count 244 transition count 186
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 71 place count 243 transition count 186
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 6 with 150 rules applied. Total rules applied 221 place count 168 transition count 111
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 227 place count 165 transition count 119
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 229 place count 163 transition count 117
Applied a total of 229 rules in 83 ms. Remains 163 /284 variables (removed 121) and now considering 117/229 (removed 112) transitions.
// Phase 1: matrix 117 rows 163 cols
[2022-05-16 20:55:18] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 20:55:18] [INFO ] Implicit Places using invariants in 234 ms returned []
// Phase 1: matrix 117 rows 163 cols
[2022-05-16 20:55:18] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-16 20:55:18] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 20:55:18] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
[2022-05-16 20:55:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 117 rows 163 cols
[2022-05-16 20:55:18] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 20:55:19] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 163/284 places, 117/229 transitions.
Finished structural reductions, in 1 iterations. Remains : 163/284 places, 117/229 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-10b-LTLFireability-09 automaton TGBA Formula[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=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s39 1) (EQ s45 1)), p1:(EQ s116 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA DES-PT-10b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-09 finished in 1126 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 229/229 transitions.
Graph (complete) has 546 edges and 284 vertex of which 277 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 276 transition count 206
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 259 transition count 206
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 35 place count 259 transition count 196
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 55 place count 249 transition count 196
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 245 transition count 192
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 245 transition count 192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 66 place count 245 transition count 189
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 68 place count 244 transition count 188
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 68 place count 244 transition count 187
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 70 place count 243 transition count 187
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 242 transition count 186
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 242 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 242 transition count 185
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 73 place count 242 transition count 184
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 75 place count 241 transition count 184
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 223 place count 167 transition count 110
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 229 place count 164 transition count 118
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 231 place count 162 transition count 116
Applied a total of 231 rules in 67 ms. Remains 162 /284 variables (removed 122) and now considering 116/229 (removed 113) transitions.
// Phase 1: matrix 116 rows 162 cols
[2022-05-16 20:55:19] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 20:55:19] [INFO ] Implicit Places using invariants in 300 ms returned []
// Phase 1: matrix 116 rows 162 cols
[2022-05-16 20:55:19] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 20:55:19] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 20:55:19] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
[2022-05-16 20:55:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 116 rows 162 cols
[2022-05-16 20:55:19] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 20:55:20] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/284 places, 116/229 transitions.
Finished structural reductions, in 1 iterations. Remains : 162/284 places, 116/229 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s79 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4890 reset in 527 ms.
Product exploration explored 100000 steps with 4848 reset in 537 ms.
Computed a total of 59 stabilizing places and 60 stable transitions
Computed a total of 59 stabilizing places and 60 stable transitions
Detected a total of 59/162 stabilizing places and 60/116 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 167 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 214 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 116/116 transitions.
Applied a total of 0 rules in 7 ms. Remains 162 /162 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 162 cols
[2022-05-16 20:55:21] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 20:55:22] [INFO ] Implicit Places using invariants in 257 ms returned []
// Phase 1: matrix 116 rows 162 cols
[2022-05-16 20:55:22] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 20:55:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 20:55:22] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
[2022-05-16 20:55:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 116 rows 162 cols
[2022-05-16 20:55:22] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 20:55:22] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 162/162 places, 116/116 transitions.
Computed a total of 59 stabilizing places and 60 stable transitions
Computed a total of 59 stabilizing places and 60 stable transitions
Detected a total of 59/162 stabilizing places and 60/116 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 195 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 170 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4907 reset in 473 ms.
Product exploration explored 100000 steps with 4957 reset in 371 ms.
Built C files in :
/tmp/ltsmin9420238403921516260
[2022-05-16 20:55:24] [INFO ] Computing symmetric may disable matrix : 116 transitions.
[2022-05-16 20:55:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:55:24] [INFO ] Computing symmetric may enable matrix : 116 transitions.
[2022-05-16 20:55:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:55:24] [INFO ] Computing Do-Not-Accords matrix : 116 transitions.
[2022-05-16 20:55:24] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:55:24] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9420238403921516260
Running compilation step : cd /tmp/ltsmin9420238403921516260;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 385 ms.
Running link step : cd /tmp/ltsmin9420238403921516260;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin9420238403921516260;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13456513387344843644.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 116/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 162 /162 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 162 cols
[2022-05-16 20:55:39] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 20:55:39] [INFO ] Implicit Places using invariants in 198 ms returned []
// Phase 1: matrix 116 rows 162 cols
[2022-05-16 20:55:39] [INFO ] Computed 59 place invariants in 4 ms
[2022-05-16 20:55:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 20:55:39] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
[2022-05-16 20:55:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 116 rows 162 cols
[2022-05-16 20:55:39] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 20:55:40] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 162/162 places, 116/116 transitions.
Built C files in :
/tmp/ltsmin8195675629248779541
[2022-05-16 20:55:40] [INFO ] Computing symmetric may disable matrix : 116 transitions.
[2022-05-16 20:55:40] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:55:40] [INFO ] Computing symmetric may enable matrix : 116 transitions.
[2022-05-16 20:55:40] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:55:40] [INFO ] Computing Do-Not-Accords matrix : 116 transitions.
[2022-05-16 20:55:40] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:55:40] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8195675629248779541
Running compilation step : cd /tmp/ltsmin8195675629248779541;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 630 ms.
Running link step : cd /tmp/ltsmin8195675629248779541;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin8195675629248779541;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8807095386305108777.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 20:55:55] [INFO ] Flatten gal took : 10 ms
[2022-05-16 20:55:55] [INFO ] Flatten gal took : 10 ms
[2022-05-16 20:55:55] [INFO ] Time to serialize gal into /tmp/LTL14930725562802717700.gal : 2 ms
[2022-05-16 20:55:55] [INFO ] Time to serialize properties into /tmp/LTL17073326201991554241.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14930725562802717700.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17073326201991554241.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1493072...268
Read 1 LTL properties
Checking formula 0 : !((F(G("(p178!=1)"))))
Formula 0 simplified : !FG"(p178!=1)"
Detected timeout of ITS tools.
[2022-05-16 20:56:10] [INFO ] Flatten gal took : 13 ms
[2022-05-16 20:56:10] [INFO ] Applying decomposition
[2022-05-16 20:56:10] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15045829970396187664.txt' '-o' '/tmp/graph15045829970396187664.bin' '-w' '/tmp/graph15045829970396187664.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15045829970396187664.bin' '-l' '-1' '-v' '-w' '/tmp/graph15045829970396187664.weights' '-q' '0' '-e' '0.001'
[2022-05-16 20:56:10] [INFO ] Decomposing Gal with order
[2022-05-16 20:56:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 20:56:10] [INFO ] Removed a total of 70 redundant transitions.
[2022-05-16 20:56:10] [INFO ] Flatten gal took : 18 ms
[2022-05-16 20:56:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 17 ms.
[2022-05-16 20:56:10] [INFO ] Time to serialize gal into /tmp/LTL4572539250996300337.gal : 4 ms
[2022-05-16 20:56:10] [INFO ] Time to serialize properties into /tmp/LTL17429312002441225269.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4572539250996300337.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17429312002441225269.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4572539...246
Read 1 LTL properties
Checking formula 0 : !((F(G("(i13.i0.u11.p178!=1)"))))
Formula 0 simplified : !FG"(i13.i0.u11.p178!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18246379495274759984
[2022-05-16 20:56:25] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18246379495274759984
Running compilation step : cd /tmp/ltsmin18246379495274759984;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 375 ms.
Running link step : cd /tmp/ltsmin18246379495274759984;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin18246379495274759984;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-10b-LTLFireability-10 finished in 81393 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((G(X((G(p0)||p1)))||p2)))))'
Support contains 4 out of 284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 229/229 transitions.
Graph (complete) has 546 edges and 284 vertex of which 277 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 276 transition count 208
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 17 rules applied. Total rules applied 33 place count 261 transition count 206
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 35 place count 259 transition count 206
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 35 place count 259 transition count 196
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 55 place count 249 transition count 196
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 58 place count 246 transition count 193
Iterating global reduction 3 with 3 rules applied. Total rules applied 61 place count 246 transition count 193
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 64 place count 246 transition count 190
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 66 place count 245 transition count 189
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 66 place count 245 transition count 188
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 68 place count 244 transition count 188
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 5 with 144 rules applied. Total rules applied 212 place count 172 transition count 116
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 220 place count 168 transition count 125
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 222 place count 166 transition count 123
Applied a total of 222 rules in 50 ms. Remains 166 /284 variables (removed 118) and now considering 123/229 (removed 106) transitions.
// Phase 1: matrix 123 rows 166 cols
[2022-05-16 20:56:40] [INFO ] Computed 59 place invariants in 6 ms
[2022-05-16 20:56:40] [INFO ] Implicit Places using invariants in 182 ms returned []
// Phase 1: matrix 123 rows 166 cols
[2022-05-16 20:56:40] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 20:56:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 20:56:41] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2022-05-16 20:56:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 123 rows 166 cols
[2022-05-16 20:56:41] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 20:56:41] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 166/284 places, 123/229 transitions.
Finished structural reductions, in 1 iterations. Remains : 166/284 places, 123/229 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : DES-PT-10b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p2 (NOT p1)), acceptance={2} source=0 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1, 2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s47 1), p2:(AND (EQ s138 1) (EQ s151 1)), p1:(EQ s50 0)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4325 reset in 372 ms.
Product exploration explored 100000 steps with 4399 reset in 404 ms.
Computed a total of 59 stabilizing places and 60 stable transitions
Computed a total of 59 stabilizing places and 60 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 p1))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
Knowledge based reduction with 15 factoid took 930 ms. Reduced automaton from 1 states, 8 edges and 3 AP to 1 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 1250 steps, including 59 resets, run visited all 8 properties in 25 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 p1))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (AND p0 (NOT p1) p2)), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 p1 p2)), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 15 factoid took 1179 ms. Reduced automaton from 1 states, 8 edges and 3 AP to 1 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 123/123 transitions.
Applied a total of 0 rules in 7 ms. Remains 166 /166 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 166 cols
[2022-05-16 20:56:44] [INFO ] Computed 59 place invariants in 5 ms
[2022-05-16 20:56:44] [INFO ] Implicit Places using invariants in 260 ms returned []
// Phase 1: matrix 123 rows 166 cols
[2022-05-16 20:56:44] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-16 20:56:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 20:56:45] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
[2022-05-16 20:56:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 123 rows 166 cols
[2022-05-16 20:56:45] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 20:56:45] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 166/166 places, 123/123 transitions.
Computed a total of 59 stabilizing places and 60 stable transitions
Computed a total of 59 stabilizing places and 60 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
Knowledge based reduction with 15 factoid took 951 ms. Reduced automaton from 1 states, 8 edges and 3 AP to 1 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 92 steps, including 3 resets, run visited all 8 properties in 8 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (AND p0 (NOT p1) p2)), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 p1 p2)), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 15 factoid took 1221 ms. Reduced automaton from 1 states, 8 edges and 3 AP to 1 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 4323 reset in 385 ms.
Product exploration explored 100000 steps with 4422 reset in 439 ms.
Built C files in :
/tmp/ltsmin3707901094587428248
[2022-05-16 20:56:48] [INFO ] Computing symmetric may disable matrix : 123 transitions.
[2022-05-16 20:56:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:56:48] [INFO ] Computing symmetric may enable matrix : 123 transitions.
[2022-05-16 20:56:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:56:48] [INFO ] Computing Do-Not-Accords matrix : 123 transitions.
[2022-05-16 20:56:48] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:56:48] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3707901094587428248
Running compilation step : cd /tmp/ltsmin3707901094587428248;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 691 ms.
Running link step : cd /tmp/ltsmin3707901094587428248;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin3707901094587428248;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9907663381811653274.hoa' '--buchi-type=spotba'
LTSmin run took 3837 ms.
FORMULA DES-PT-10b-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-10b-LTLFireability-11 finished in 12719 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G((p0 U p1))&&p2))||X(G(p1)))))'
Support contains 4 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 229/229 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 277 transition count 222
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 277 transition count 222
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 277 transition count 220
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 274 transition count 217
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 274 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 274 transition count 216
Applied a total of 23 rules in 28 ms. Remains 274 /284 variables (removed 10) and now considering 216/229 (removed 13) transitions.
// Phase 1: matrix 216 rows 274 cols
[2022-05-16 20:56:53] [INFO ] Computed 61 place invariants in 7 ms
[2022-05-16 20:56:53] [INFO ] Implicit Places using invariants in 248 ms returned []
// Phase 1: matrix 216 rows 274 cols
[2022-05-16 20:56:53] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 20:56:54] [INFO ] Implicit Places using invariants and state equation in 594 ms returned []
Implicit Place search using SMT with State Equation took 844 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 274 cols
[2022-05-16 20:56:54] [INFO ] Computed 61 place invariants in 3 ms
[2022-05-16 20:56:54] [INFO ] Dead Transitions using invariants and state equation in 350 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 274/284 places, 216/229 transitions.
Finished structural reductions, in 1 iterations. Remains : 274/284 places, 216/229 transitions.
Stuttering acceptance computed with spot in 283 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-10b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p2) (AND (NOT p1) (NOT p0))), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=2 dest: 4}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p1) (NOT p0))), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=(OR p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 5}], [{ cond=(AND p2 (NOT p1) p0), acceptance={0} source=5 dest: 3}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=5 dest: 4}, { cond=(OR (NOT p2) (AND (NOT p1) (NOT p0))), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (AND (EQ s171 1) (EQ s203 1)) (EQ s66 1)), p1:(AND (EQ s171 1) (EQ s203 1)), p0:(EQ s155 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 107 steps with 0 reset in 1 ms.
FORMULA DES-PT-10b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-12 finished in 1531 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 229/229 transitions.
Graph (complete) has 546 edges and 284 vertex of which 277 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 276 transition count 207
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 260 transition count 206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 259 transition count 206
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 35 place count 259 transition count 197
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 53 place count 250 transition count 197
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 56 place count 247 transition count 194
Iterating global reduction 3 with 3 rules applied. Total rules applied 59 place count 247 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 247 transition count 193
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 60 place count 247 transition count 192
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 62 place count 246 transition count 192
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 63 place count 245 transition count 191
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 245 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 65 place count 245 transition count 190
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 65 place count 245 transition count 189
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 67 place count 244 transition count 189
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 219 place count 168 transition count 113
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 223 place count 166 transition count 118
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 227 place count 166 transition count 114
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 229 place count 164 transition count 112
Applied a total of 229 rules in 69 ms. Remains 164 /284 variables (removed 120) and now considering 112/229 (removed 117) transitions.
// Phase 1: matrix 112 rows 164 cols
[2022-05-16 20:56:54] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 20:56:55] [INFO ] Implicit Places using invariants in 233 ms returned []
// Phase 1: matrix 112 rows 164 cols
[2022-05-16 20:56:55] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 20:56:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 20:56:55] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
[2022-05-16 20:56:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 112 rows 164 cols
[2022-05-16 20:56:55] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 20:56:55] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/284 places, 112/229 transitions.
Finished structural reductions, in 1 iterations. Remains : 164/284 places, 112/229 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-10b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s48 1) (NEQ s74 1)), p1:(NEQ s54 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 10373 reset in 336 ms.
Product exploration explored 100000 steps with 10368 reset in 483 ms.
Computed a total of 58 stabilizing places and 52 stable transitions
Computed a total of 58 stabilizing places and 52 stable transitions
Detected a total of 58/164 stabilizing places and 52/112 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 232 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 14 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 270 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 112/112 transitions.
Applied a total of 0 rules in 3 ms. Remains 164 /164 variables (removed 0) and now considering 112/112 (removed 0) transitions.
// Phase 1: matrix 112 rows 164 cols
[2022-05-16 20:56:57] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 20:56:57] [INFO ] Implicit Places using invariants in 177 ms returned []
// Phase 1: matrix 112 rows 164 cols
[2022-05-16 20:56:57] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 20:56:57] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 20:56:58] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
[2022-05-16 20:56:58] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 112 rows 164 cols
[2022-05-16 20:56:58] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 20:56:58] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 164/164 places, 112/112 transitions.
Computed a total of 58 stabilizing places and 52 stable transitions
Computed a total of 58 stabilizing places and 52 stable transitions
Detected a total of 58/164 stabilizing places and 52/112 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 231 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 11 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 379 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 10357 reset in 494 ms.
Product exploration explored 100000 steps with 10174 reset in 557 ms.
Built C files in :
/tmp/ltsmin7094558738212740821
[2022-05-16 20:57:00] [INFO ] Computing symmetric may disable matrix : 112 transitions.
[2022-05-16 20:57:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:57:00] [INFO ] Computing symmetric may enable matrix : 112 transitions.
[2022-05-16 20:57:00] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:57:00] [INFO ] Computing Do-Not-Accords matrix : 112 transitions.
[2022-05-16 20:57:00] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:57:00] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7094558738212740821
Running compilation step : cd /tmp/ltsmin7094558738212740821;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 381 ms.
Running link step : cd /tmp/ltsmin7094558738212740821;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin7094558738212740821;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3443139633397742452.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 112/112 transitions.
Applied a total of 0 rules in 5 ms. Remains 164 /164 variables (removed 0) and now considering 112/112 (removed 0) transitions.
// Phase 1: matrix 112 rows 164 cols
[2022-05-16 20:57:15] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 20:57:15] [INFO ] Implicit Places using invariants in 178 ms returned []
// Phase 1: matrix 112 rows 164 cols
[2022-05-16 20:57:15] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 20:57:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 20:57:16] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
[2022-05-16 20:57:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 112 rows 164 cols
[2022-05-16 20:57:16] [INFO ] Computed 59 place invariants in 8 ms
[2022-05-16 20:57:16] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 164/164 places, 112/112 transitions.
Built C files in :
/tmp/ltsmin10141309027269689056
[2022-05-16 20:57:16] [INFO ] Computing symmetric may disable matrix : 112 transitions.
[2022-05-16 20:57:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:57:16] [INFO ] Computing symmetric may enable matrix : 112 transitions.
[2022-05-16 20:57:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:57:16] [INFO ] Computing Do-Not-Accords matrix : 112 transitions.
[2022-05-16 20:57:16] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:57:16] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10141309027269689056
Running compilation step : cd /tmp/ltsmin10141309027269689056;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 561 ms.
Running link step : cd /tmp/ltsmin10141309027269689056;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin10141309027269689056;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13944839932882124217.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 20:57:31] [INFO ] Flatten gal took : 9 ms
[2022-05-16 20:57:31] [INFO ] Flatten gal took : 8 ms
[2022-05-16 20:57:31] [INFO ] Time to serialize gal into /tmp/LTL5516294079100315295.gal : 1 ms
[2022-05-16 20:57:31] [INFO ] Time to serialize properties into /tmp/LTL16181425040860517395.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5516294079100315295.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16181425040860517395.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5516294...267
Read 1 LTL properties
Checking formula 0 : !((G((F("((p76!=1)||(p162!=1))"))&&(F("(p103!=1)")))))
Formula 0 simplified : !G(F"((p76!=1)||(p162!=1))" & F"(p103!=1)")
Detected timeout of ITS tools.
[2022-05-16 20:57:46] [INFO ] Flatten gal took : 8 ms
[2022-05-16 20:57:46] [INFO ] Applying decomposition
[2022-05-16 20:57:46] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1003043315865660012.txt' '-o' '/tmp/graph1003043315865660012.bin' '-w' '/tmp/graph1003043315865660012.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1003043315865660012.bin' '-l' '-1' '-v' '-w' '/tmp/graph1003043315865660012.weights' '-q' '0' '-e' '0.001'
[2022-05-16 20:57:46] [INFO ] Decomposing Gal with order
[2022-05-16 20:57:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 20:57:46] [INFO ] Removed a total of 54 redundant transitions.
[2022-05-16 20:57:46] [INFO ] Flatten gal took : 14 ms
[2022-05-16 20:57:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 3 ms.
[2022-05-16 20:57:46] [INFO ] Time to serialize gal into /tmp/LTL8829224702178384611.gal : 2 ms
[2022-05-16 20:57:46] [INFO ] Time to serialize properties into /tmp/LTL1417244277368227249.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8829224702178384611.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1417244277368227249.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8829224...245
Read 1 LTL properties
Checking formula 0 : !((G((F("((i3.u3.p76!=1)||(i3.u10.p162!=1))"))&&(F("(i1.u6.p103!=1)")))))
Formula 0 simplified : !G(F"((i3.u3.p76!=1)||(i3.u10.p162!=1))" & F"(i1.u6.p103!=1)")
Reverse transition relation is NOT exact ! Due to transitions t222_t79, t7_t48_t39, t9_t34, t10_t34, t189_t34, t188_t25, t128_t228_t134_t135_t109_t110_t131...540
Computing Next relation with stutter on 8.68949e+06 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10936729700021885565
[2022-05-16 20:58:01] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10936729700021885565
Running compilation step : cd /tmp/ltsmin10936729700021885565;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 331 ms.
Running link step : cd /tmp/ltsmin10936729700021885565;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin10936729700021885565;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-10b-LTLFireability-15 finished in 81903 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(p0))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(G(F(p0))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
[2022-05-16 20:58:17] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2005090595238312373
[2022-05-16 20:58:17] [INFO ] Computing symmetric may disable matrix : 229 transitions.
[2022-05-16 20:58:17] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:58:17] [INFO ] Computing symmetric may enable matrix : 229 transitions.
[2022-05-16 20:58:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:58:17] [INFO ] Applying decomposition
[2022-05-16 20:58:17] [INFO ] Computing Do-Not-Accords matrix : 229 transitions.
[2022-05-16 20:58:17] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:58:17] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2005090595238312373
Running compilation step : cd /tmp/ltsmin2005090595238312373;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-16 20:58:17] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15714052937076159341.txt' '-o' '/tmp/graph15714052937076159341.bin' '-w' '/tmp/graph15714052937076159341.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15714052937076159341.bin' '-l' '-1' '-v' '-w' '/tmp/graph15714052937076159341.weights' '-q' '0' '-e' '0.001'
[2022-05-16 20:58:17] [INFO ] Decomposing Gal with order
[2022-05-16 20:58:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 20:58:17] [INFO ] Removed a total of 20 redundant transitions.
[2022-05-16 20:58:17] [INFO ] Flatten gal took : 22 ms
[2022-05-16 20:58:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2022-05-16 20:58:17] [INFO ] Time to serialize gal into /tmp/LTLFireability29813147634111485.gal : 3 ms
[2022-05-16 20:58:17] [INFO ] Time to serialize properties into /tmp/LTLFireability5476763891923131682.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability29813147634111485.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5476763891923131682.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...265
Read 4 LTL properties
Checking formula 0 : !((G(F(G("(i0.u0.p1!=1)")))))
Formula 0 simplified : !GFG"(i0.u0.p1!=1)"
Compilation finished in 901 ms.
Running link step : cd /tmp/ltsmin2005090595238312373;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2005090595238312373;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>([]((LTLAPp0==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t87, t168, t188, t189, t222, u36.t76, i0.u34.t79, i1.t122, i1.u8.t163, i1.u8.t164, i...821
Computing Next relation with stutter on 2.16521e+07 deadlock states
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin2005090595238312373;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>([]((LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2005090595238312373;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>([]([](<>((LTLAPp1==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-16 21:20:23] [INFO ] Applying decomposition
[2022-05-16 21:20:23] [INFO ] Flatten gal took : 35 ms
[2022-05-16 21:20:23] [INFO ] Decomposing Gal with order
[2022-05-16 21:20:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 21:20:24] [INFO ] Removed a total of 48 redundant transitions.
[2022-05-16 21:20:24] [INFO ] Flatten gal took : 75 ms
[2022-05-16 21:20:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 178 labels/synchronizations in 42 ms.
[2022-05-16 21:20:24] [INFO ] Time to serialize gal into /tmp/LTLFireability15524268621984792536.gal : 12 ms
[2022-05-16 21:20:24] [INFO ] Time to serialize properties into /tmp/LTLFireability9934871936839243566.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15524268621984792536.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9934871936839243566.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 4 LTL properties
Checking formula 0 : !((G(F(G("(i0.u124.p1!=1)")))))
Formula 0 simplified : !GFG"(i0.u124.p1!=1)"
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin2005090595238312373;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>([]([](<>((LTLAPp1==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2005090595238312373;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-16 21:42:30] [INFO ] Flatten gal took : 24 ms
[2022-05-16 21:42:30] [INFO ] Input system was already deterministic with 229 transitions.
[2022-05-16 21:42:30] [INFO ] Transformed 284 places.
[2022-05-16 21:42:30] [INFO ] Transformed 229 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 21:42:31] [INFO ] Time to serialize gal into /tmp/LTLFireability10636175984434084724.gal : 1 ms
[2022-05-16 21:42:31] [INFO ] Time to serialize properties into /tmp/LTLFireability17608283764127602449.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10636175984434084724.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17608283764127602449.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...335
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(G("(p1!=1)")))))
Formula 0 simplified : !GFG"(p1!=1)"
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin2005090595238312373;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2005090595238312373;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp3==true))&&<>((LTLAPp4==true))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-10b"
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 DES-PT-10b, 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 r042-smll-165252095800460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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