About the Execution of ITS-Tools for DoubleExponent-PT-100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12268.691 | 3600000.00 | 11475443.00 | 2861.20 | FFTTTTF?TTFTFF?T | normal |
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.r078-tall-165260110000211.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 DoubleExponent-PT-100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110000211
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.0K Apr 29 13:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 13:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 13:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 13:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1.8M 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 DoubleExponent-PT-100-LTLCardinality-00
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-01
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-02
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-03
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-04
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-05
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-06
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-07
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-08
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-09
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-10
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-11
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-12
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-13
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-14
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652648118730
Running Version 202205111006
[2022-05-15 20:55:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 20:55:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 20:55:20] [INFO ] Load time of PNML (sax parser for PT used): 248 ms
[2022-05-15 20:55:20] [INFO ] Transformed 5304 places.
[2022-05-15 20:55:20] [INFO ] Transformed 4998 transitions.
[2022-05-15 20:55:20] [INFO ] Parsed PT model containing 5304 places and 4998 transitions in 381 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA DoubleExponent-PT-100-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 5304 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5304/5304 places, 4998/4998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 5300 transition count 4998
Applied a total of 4 rules in 1163 ms. Remains 5300 /5304 variables (removed 4) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 20:55:22] [INFO ] Invariants computation overflowed in 233 ms
[2022-05-15 20:55:23] [INFO ] Implicit Places using invariants in 878 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 20:55:23] [INFO ] Invariants computation overflowed in 146 ms
[2022-05-15 20:55:24] [INFO ] Implicit Places using invariants and state equation in 1150 ms returned []
Implicit Place search using SMT with State Equation took 2060 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 20:55:24] [INFO ] Invariants computation overflowed in 104 ms
[2022-05-15 20:55:27] [INFO ] Dead Transitions using invariants and state equation in 3428 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5300/5304 places, 4998/4998 transitions.
Finished structural reductions, in 1 iterations. Remains : 5300/5304 places, 4998/4998 transitions.
Support contains 23 out of 5300 places after structural reductions.
[2022-05-15 20:55:28] [INFO ] Flatten gal took : 358 ms
[2022-05-15 20:55:29] [INFO ] Flatten gal took : 217 ms
[2022-05-15 20:55:29] [INFO ] Input system was already deterministic with 4998 transitions.
Incomplete random walk after 10000 steps, including 331 resets, run finished after 607 ms. (steps per millisecond=16 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 275 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 279 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 275 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 272 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 292 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 293 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 278 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 147747 steps, run timeout after 9001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 147747 steps, saw 73886 distinct states, run finished after 9007 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 20:55:43] [INFO ] Invariants computation overflowed in 91 ms
[2022-05-15 20:55:44] [INFO ] After 1619ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-05-15 20:56:09] [INFO ] After 22828ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-15 20:56:09] [INFO ] After 22838ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-15 20:56:09] [INFO ] After 25052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 21 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.20 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1178 transitions
Trivial Post-agglo rules discarded 1178 transitions
Performed 1178 trivial Post agglomeration. Transition count delta: 1178
Iterating post reduction 0 with 1181 rules applied. Total rules applied 1182 place count 5297 transition count 3818
Reduce places removed 1178 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 1189 rules applied. Total rules applied 2371 place count 4119 transition count 3807
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 2382 place count 4108 transition count 3807
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 2382 place count 4108 transition count 3608
Deduced a syphon composed of 199 places in 176 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 2780 place count 3909 transition count 3608
Performed 895 Post agglomeration using F-continuation condition.Transition count delta: 895
Deduced a syphon composed of 895 places in 65 ms
Reduce places removed 895 places and 0 transitions.
Iterating global reduction 3 with 1790 rules applied. Total rules applied 4570 place count 3014 transition count 2713
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 134 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4772 place count 2913 transition count 2713
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 92 places in 86 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 4956 place count 2821 transition count 2713
Free-agglomeration rule (complex) applied 408 times.
Iterating global reduction 3 with 408 rules applied. Total rules applied 5364 place count 2821 transition count 2305
Reduce places removed 408 places and 0 transitions.
Iterating post reduction 3 with 408 rules applied. Total rules applied 5772 place count 2413 transition count 2305
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 397 times.
Drop transitions removed 397 transitions
Iterating global reduction 4 with 397 rules applied. Total rules applied 6169 place count 2413 transition count 2305
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6170 place count 2412 transition count 2304
Applied a total of 6170 rules in 2483 ms. Remains 2412 /5300 variables (removed 2888) and now considering 2304/4998 (removed 2694) transitions.
Finished structural reductions, in 1 iterations. Remains : 2412/5300 places, 2304/4998 transitions.
Incomplete random walk after 10000 steps, including 1276 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 832 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 846 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 863 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 851 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 850 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 828 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 172159 steps, run timeout after 6001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 172159 steps, saw 86099 distinct states, run finished after 6004 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 2304 rows 2412 cols
[2022-05-15 20:56:20] [INFO ] Invariants computation overflowed in 46 ms
[2022-05-15 20:56:21] [INFO ] After 690ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-05-15 20:56:46] [INFO ] After 23998ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-15 20:56:46] [INFO ] State equation strengthened by 394 read => feed constraints.
[2022-05-15 20:56:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 20:56:46] [INFO ] After 25054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 21 out of 2412 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2412/2412 places, 2304/2304 transitions.
Applied a total of 0 rules in 197 ms. Remains 2412 /2412 variables (removed 0) and now considering 2304/2304 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2412/2412 places, 2304/2304 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2412/2412 places, 2304/2304 transitions.
Applied a total of 0 rules in 217 ms. Remains 2412 /2412 variables (removed 0) and now considering 2304/2304 (removed 0) transitions.
// Phase 1: matrix 2304 rows 2412 cols
[2022-05-15 20:56:47] [INFO ] Invariants computation overflowed in 73 ms
[2022-05-15 20:57:08] [INFO ] Implicit Places using invariants in 21883 ms returned []
// Phase 1: matrix 2304 rows 2412 cols
[2022-05-15 20:57:08] [INFO ] Invariants computation overflowed in 51 ms
[2022-05-15 20:57:30] [INFO ] Implicit Places using invariants and state equation in 21869 ms returned []
Implicit Place search using SMT with State Equation took 43759 ms to find 0 implicit places.
[2022-05-15 20:57:30] [INFO ] Redundant transitions in 225 ms returned []
// Phase 1: matrix 2304 rows 2412 cols
[2022-05-15 20:57:31] [INFO ] Invariants computation overflowed in 73 ms
[2022-05-15 20:57:32] [INFO ] Dead Transitions using invariants and state equation in 1621 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2412/2412 places, 2304/2304 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.43 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(p1))))'
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 817 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 20:57:33] [INFO ] Invariants computation overflowed in 94 ms
[2022-05-15 20:57:35] [INFO ] Implicit Places using invariants in 2219 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 20:57:35] [INFO ] Invariants computation overflowed in 94 ms
[2022-05-15 20:57:36] [INFO ] Implicit Places using invariants and state equation in 1005 ms returned []
Implicit Place search using SMT with State Equation took 3227 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 20:57:36] [INFO ] Invariants computation overflowed in 112 ms
[2022-05-15 20:57:40] [INFO ] Dead Transitions using invariants and state equation in 3259 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 354 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 1 s744), p0:(LEQ 3 s2977)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 71 steps with 0 reset in 11 ms.
FORMULA DoubleExponent-PT-100-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLCardinality-01 finished in 8132 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p0)||p1))&&X(G(F(p2)))))'
Support contains 5 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1193 transitions
Trivial Post-agglo rules discarded 1193 transitions
Performed 1193 trivial Post agglomeration. Transition count delta: 1193
Iterating post reduction 0 with 1193 rules applied. Total rules applied 1193 place count 5299 transition count 3804
Reduce places removed 1193 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 1196 rules applied. Total rules applied 2389 place count 4106 transition count 3801
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 2392 place count 4103 transition count 3801
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 2392 place count 4103 transition count 3602
Deduced a syphon composed of 199 places in 182 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 2790 place count 3904 transition count 3602
Performed 903 Post agglomeration using F-continuation condition.Transition count delta: 903
Deduced a syphon composed of 903 places in 69 ms
Reduce places removed 903 places and 0 transitions.
Iterating global reduction 3 with 1806 rules applied. Total rules applied 4596 place count 3001 transition count 2699
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 63 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4798 place count 2900 transition count 2699
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 76 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 4988 place count 2805 transition count 2699
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4989 place count 2804 transition count 2698
Applied a total of 4989 rules in 1443 ms. Remains 2804 /5300 variables (removed 2496) and now considering 2698/4998 (removed 2300) transitions.
// Phase 1: matrix 2698 rows 2804 cols
[2022-05-15 20:57:42] [INFO ] Invariants computation overflowed in 52 ms
[2022-05-15 20:57:43] [INFO ] Implicit Places using invariants in 1424 ms returned []
// Phase 1: matrix 2698 rows 2804 cols
[2022-05-15 20:57:43] [INFO ] Invariants computation overflowed in 65 ms
[2022-05-15 20:57:46] [INFO ] Implicit Places using invariants and state equation in 2358 ms returned []
Implicit Place search using SMT with State Equation took 3783 ms to find 0 implicit places.
[2022-05-15 20:57:46] [INFO ] Redundant transitions in 121 ms returned []
// Phase 1: matrix 2698 rows 2804 cols
[2022-05-15 20:57:46] [INFO ] Invariants computation overflowed in 54 ms
[2022-05-15 20:57:47] [INFO ] Dead Transitions using invariants and state equation in 1247 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2804/5300 places, 2698/4998 transitions.
Finished structural reductions, in 1 iterations. Remains : 2804/5300 places, 2698/4998 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ s2126 s889), p0:(LEQ s2631 s91), p1:(LEQ 2 s1557)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 13984 reset in 249 ms.
Product exploration explored 100000 steps with 13914 reset in 220 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8871 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 224 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 73 ms :[(NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 1381 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 798 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 103112 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103112 steps, saw 51565 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2698 rows 2804 cols
[2022-05-15 20:57:51] [INFO ] Invariants computation overflowed in 48 ms
[2022-05-15 20:57:52] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:58:17] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2804 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2804/2804 places, 2698/2698 transitions.
Graph (complete) has 8471 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 2802 transition count 2694
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 2800 transition count 2694
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 7 place count 2800 transition count 2692
Deduced a syphon composed of 2 places in 44 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 2798 transition count 2692
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 69 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 2797 transition count 2692
Free-agglomeration rule (complex) applied 399 times.
Iterating global reduction 2 with 399 rules applied. Total rules applied 412 place count 2797 transition count 2293
Reduce places removed 399 places and 0 transitions.
Iterating post reduction 2 with 399 rules applied. Total rules applied 811 place count 2398 transition count 2293
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 3 with 399 rules applied. Total rules applied 1210 place count 2398 transition count 2293
Applied a total of 1210 rules in 795 ms. Remains 2398 /2804 variables (removed 406) and now considering 2293/2698 (removed 405) transitions.
Finished structural reductions, in 1 iterations. Remains : 2398/2804 places, 2293/2698 transitions.
Incomplete random walk after 10000 steps, including 1286 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 122155 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122155 steps, saw 61140 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2293 rows 2398 cols
[2022-05-15 20:58:21] [INFO ] Invariants computation overflowed in 43 ms
[2022-05-15 20:58:21] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:58:46] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2398 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2398/2398 places, 2293/2293 transitions.
Applied a total of 0 rules in 194 ms. Remains 2398 /2398 variables (removed 0) and now considering 2293/2293 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2398/2398 places, 2293/2293 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2398/2398 places, 2293/2293 transitions.
Applied a total of 0 rules in 187 ms. Remains 2398 /2398 variables (removed 0) and now considering 2293/2293 (removed 0) transitions.
// Phase 1: matrix 2293 rows 2398 cols
[2022-05-15 20:58:46] [INFO ] Invariants computation overflowed in 59 ms
[2022-05-15 20:59:08] [INFO ] Implicit Places using invariants in 21787 ms returned []
// Phase 1: matrix 2293 rows 2398 cols
[2022-05-15 20:59:08] [INFO ] Invariants computation overflowed in 39 ms
[2022-05-15 20:59:31] [INFO ] Implicit Places using invariants and state equation in 22634 ms returned []
Implicit Place search using SMT with State Equation took 44423 ms to find 0 implicit places.
[2022-05-15 20:59:31] [INFO ] Redundant transitions in 81 ms returned []
// Phase 1: matrix 2293 rows 2398 cols
[2022-05-15 20:59:31] [INFO ] Invariants computation overflowed in 44 ms
[2022-05-15 20:59:32] [INFO ] Dead Transitions using invariants and state equation in 1510 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2398/2398 places, 2293/2293 transitions.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 237 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 74 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p2), (NOT p2)]
Support contains 2 out of 2804 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2804/2804 places, 2698/2698 transitions.
Applied a total of 0 rules in 131 ms. Remains 2804 /2804 variables (removed 0) and now considering 2698/2698 (removed 0) transitions.
// Phase 1: matrix 2698 rows 2804 cols
[2022-05-15 20:59:33] [INFO ] Invariants computation overflowed in 57 ms
[2022-05-15 20:59:34] [INFO ] Implicit Places using invariants in 1408 ms returned []
// Phase 1: matrix 2698 rows 2804 cols
[2022-05-15 20:59:34] [INFO ] Invariants computation overflowed in 45 ms
[2022-05-15 20:59:36] [INFO ] Implicit Places using invariants and state equation in 2200 ms returned []
Implicit Place search using SMT with State Equation took 3611 ms to find 0 implicit places.
[2022-05-15 20:59:36] [INFO ] Redundant transitions in 54 ms returned []
// Phase 1: matrix 2698 rows 2804 cols
[2022-05-15 20:59:37] [INFO ] Invariants computation overflowed in 48 ms
[2022-05-15 20:59:38] [INFO ] Dead Transitions using invariants and state equation in 1184 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2804/2804 places, 2698/2698 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8871 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 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 65 ms :[(NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 1373 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 804 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 102897 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102897 steps, saw 51458 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2698 rows 2804 cols
[2022-05-15 20:59:41] [INFO ] Invariants computation overflowed in 51 ms
[2022-05-15 20:59:41] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 21:00:06] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2804 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2804/2804 places, 2698/2698 transitions.
Graph (complete) has 8471 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 2802 transition count 2694
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 2800 transition count 2694
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 7 place count 2800 transition count 2692
Deduced a syphon composed of 2 places in 45 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 2798 transition count 2692
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 49 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 2797 transition count 2692
Free-agglomeration rule (complex) applied 399 times.
Iterating global reduction 2 with 399 rules applied. Total rules applied 412 place count 2797 transition count 2293
Reduce places removed 399 places and 0 transitions.
Iterating post reduction 2 with 399 rules applied. Total rules applied 811 place count 2398 transition count 2293
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 3 with 399 rules applied. Total rules applied 1210 place count 2398 transition count 2293
Applied a total of 1210 rules in 763 ms. Remains 2398 /2804 variables (removed 406) and now considering 2293/2698 (removed 405) transitions.
Finished structural reductions, in 1 iterations. Remains : 2398/2804 places, 2293/2698 transitions.
Incomplete random walk after 10000 steps, including 1272 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 814 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 121913 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 121913 steps, saw 61013 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2293 rows 2398 cols
[2022-05-15 21:00:10] [INFO ] Invariants computation overflowed in 41 ms
[2022-05-15 21:00:11] [INFO ] After 264ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 21:00:36] [INFO ] After 25011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2398 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2398/2398 places, 2293/2293 transitions.
Applied a total of 0 rules in 213 ms. Remains 2398 /2398 variables (removed 0) and now considering 2293/2293 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2398/2398 places, 2293/2293 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2398/2398 places, 2293/2293 transitions.
Applied a total of 0 rules in 188 ms. Remains 2398 /2398 variables (removed 0) and now considering 2293/2293 (removed 0) transitions.
// Phase 1: matrix 2293 rows 2398 cols
[2022-05-15 21:00:36] [INFO ] Invariants computation overflowed in 43 ms
[2022-05-15 21:00:58] [INFO ] Implicit Places using invariants in 21688 ms returned []
// Phase 1: matrix 2293 rows 2398 cols
[2022-05-15 21:00:58] [INFO ] Invariants computation overflowed in 36 ms
[2022-05-15 21:01:20] [INFO ] Implicit Places using invariants and state equation in 22690 ms returned []
Implicit Place search using SMT with State Equation took 44387 ms to find 0 implicit places.
[2022-05-15 21:01:20] [INFO ] Redundant transitions in 98 ms returned []
// Phase 1: matrix 2293 rows 2398 cols
[2022-05-15 21:01:21] [INFO ] Invariants computation overflowed in 40 ms
[2022-05-15 21:01:22] [INFO ] Dead Transitions using invariants and state equation in 1513 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2398/2398 places, 2293/2293 transitions.
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 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 68 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 130 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 13828 reset in 179 ms.
Product exploration explored 100000 steps with 13969 reset in 183 ms.
Built C files in :
/tmp/ltsmin8157297257267010300
[2022-05-15 21:01:23] [INFO ] Too many transitions (2698) to apply POR reductions. Disabling POR matrices.
[2022-05-15 21:01:23] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8157297257267010300
Running compilation step : cd /tmp/ltsmin8157297257267010300;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8157297257267010300;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8157297257267010300;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 2804 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2804/2804 places, 2698/2698 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 2804 transition count 2696
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 2802 transition count 2696
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 2802 transition count 2695
Deduced a syphon composed of 1 places in 43 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 2801 transition count 2695
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 44 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 2800 transition count 2695
Applied a total of 8 rules in 324 ms. Remains 2800 /2804 variables (removed 4) and now considering 2695/2698 (removed 3) transitions.
// Phase 1: matrix 2695 rows 2800 cols
[2022-05-15 21:01:26] [INFO ] Invariants computation overflowed in 34 ms
[2022-05-15 21:01:28] [INFO ] Implicit Places using invariants in 1474 ms returned []
// Phase 1: matrix 2695 rows 2800 cols
[2022-05-15 21:01:28] [INFO ] Invariants computation overflowed in 34 ms
[2022-05-15 21:01:30] [INFO ] Implicit Places using invariants and state equation in 2199 ms returned []
Implicit Place search using SMT with State Equation took 3685 ms to find 0 implicit places.
[2022-05-15 21:01:30] [INFO ] Redundant transitions in 55 ms returned []
// Phase 1: matrix 2695 rows 2800 cols
[2022-05-15 21:01:30] [INFO ] Invariants computation overflowed in 38 ms
[2022-05-15 21:01:31] [INFO ] Dead Transitions using invariants and state equation in 1223 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2800/2804 places, 2695/2698 transitions.
Finished structural reductions, in 1 iterations. Remains : 2800/2804 places, 2695/2698 transitions.
Built C files in :
/tmp/ltsmin2863502961986698758
[2022-05-15 21:01:31] [INFO ] Too many transitions (2695) to apply POR reductions. Disabling POR matrices.
[2022-05-15 21:01:31] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2863502961986698758
Running compilation step : cd /tmp/ltsmin2863502961986698758;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2863502961986698758;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2863502961986698758;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 21:01:35] [INFO ] Flatten gal took : 129 ms
[2022-05-15 21:01:35] [INFO ] Flatten gal took : 116 ms
[2022-05-15 21:01:35] [INFO ] Time to serialize gal into /tmp/LTL7776754236022192013.gal : 48 ms
[2022-05-15 21:01:35] [INFO ] Time to serialize properties into /tmp/LTL4379103573709494668.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/LTL7776754236022192013.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4379103573709494668.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/LTL7776754...266
Read 1 LTL properties
Checking formula 0 : !(((F((F("(p699<=p1146)"))||("(p3651>=2)")))&&(X(G(F("(p4617<=p2513)"))))))
Formula 0 simplified : !(F("(p3651>=2)" | F"(p699<=p1146)") & XGF"(p4617<=p2513)")
Detected timeout of ITS tools.
[2022-05-15 21:01:50] [INFO ] Flatten gal took : 90 ms
[2022-05-15 21:01:50] [INFO ] Applying decomposition
[2022-05-15 21:01:50] [INFO ] Flatten gal took : 90 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/graph7636890010313670391.txt' '-o' '/tmp/graph7636890010313670391.bin' '-w' '/tmp/graph7636890010313670391.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7636890010313670391.bin' '-l' '-1' '-v' '-w' '/tmp/graph7636890010313670391.weights' '-q' '0' '-e' '0.001'
[2022-05-15 21:01:51] [INFO ] Decomposing Gal with order
[2022-05-15 21:01:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:01:51] [INFO ] Removed a total of 2359 redundant transitions.
[2022-05-15 21:01:51] [INFO ] Flatten gal took : 311 ms
[2022-05-15 21:01:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 124 ms.
[2022-05-15 21:01:52] [INFO ] Time to serialize gal into /tmp/LTL9312087160054709022.gal : 31 ms
[2022-05-15 21:01:52] [INFO ] Time to serialize properties into /tmp/LTL10148759866244717417.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/LTL9312087160054709022.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10148759866244717417.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/LTL9312087...267
Read 1 LTL properties
Checking formula 0 : !(((F((F("(gu1080.p699<=gu1080.p1146)"))||("(gi0.gi0.gi1.gi2.gi7.gu641.p3651>=2)")))&&(X(G(F("(gu874.p4617<=gu874.p2513)"))))))
Formula 0 simplified : !(F("(gi0.gi0.gi1.gi2.gi7.gu641.p3651>=2)" | F"(gu1080.p699<=gu1080.p1146)") & XGF"(gu874.p4617<=gu874.p2513)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10321308795396661649
[2022-05-15 21:02:07] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10321308795396661649
Running compilation step : cd /tmp/ltsmin10321308795396661649;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10321308795396661649;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10321308795396661649;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property DoubleExponent-PT-100-LTLCardinality-07 finished in 269765 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(G(p0) U p1)))'
Support contains 6 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 801 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:02:11] [INFO ] Invariants computation overflowed in 93 ms
[2022-05-15 21:02:13] [INFO ] Implicit Places using invariants in 2138 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:02:13] [INFO ] Invariants computation overflowed in 114 ms
[2022-05-15 21:02:14] [INFO ] Implicit Places using invariants and state equation in 991 ms returned []
Implicit Place search using SMT with State Equation took 3133 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:02:14] [INFO ] Invariants computation overflowed in 93 ms
[2022-05-15 21:02:17] [INFO ] Dead Transitions using invariants and state equation in 3205 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, p0, p1, p1, (AND p0 p1)]
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (OR (LEQ 1 s1359) (GT s3580 s3320)) (LEQ s4798 s2195)), p1:(AND (LEQ 1 s1359) (LEQ 3 s4350))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2428 ms.
Product exploration explored 100000 steps with 50000 reset in 2353 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 6 factoid took 125 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DoubleExponent-PT-100-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-100-LTLCardinality-08 finished in 12633 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(G(p0) U X(p1)))'
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 781 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:02:24] [INFO ] Invariants computation overflowed in 92 ms
[2022-05-15 21:02:26] [INFO ] Implicit Places using invariants in 2187 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:02:26] [INFO ] Invariants computation overflowed in 91 ms
[2022-05-15 21:02:27] [INFO ] Implicit Places using invariants and state equation in 1026 ms returned []
Implicit Place search using SMT with State Equation took 3218 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:02:27] [INFO ] Invariants computation overflowed in 95 ms
[2022-05-15 21:02:30] [INFO ] Dead Transitions using invariants and state equation in 3151 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, p1, p0, p1, p1, (AND p0 p1)]
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=3, aps=[p1:(LEQ 3 s5139), p0:(LEQ s4890 s3043)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3321 reset in 359 ms.
Product exploration explored 100000 steps with 3286 reset in 276 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT p1)), true, (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 215 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 94 ms :[p0, (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 343 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 282 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:02:33] [INFO ] Invariants computation overflowed in 94 ms
[2022-05-15 21:02:45] [INFO ] After 12264ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1196 transitions
Trivial Post-agglo rules discarded 1196 transitions
Performed 1196 trivial Post agglomeration. Transition count delta: 1196
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1200 place count 5297 transition count 3800
Reduce places removed 1196 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2398 place count 4101 transition count 3798
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2400 place count 4099 transition count 3798
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2400 place count 4099 transition count 3598
Deduced a syphon composed of 200 places in 191 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2800 place count 3899 transition count 3598
Performed 904 Post agglomeration using F-continuation condition.Transition count delta: 904
Deduced a syphon composed of 904 places in 62 ms
Reduce places removed 904 places and 0 transitions.
Iterating global reduction 3 with 1808 rules applied. Total rules applied 4608 place count 2995 transition count 2694
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 62 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4810 place count 2894 transition count 2694
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 45 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 5004 place count 2797 transition count 2694
Free-agglomeration rule (complex) applied 400 times.
Iterating global reduction 3 with 400 rules applied. Total rules applied 5404 place count 2797 transition count 2294
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 3 with 400 rules applied. Total rules applied 5804 place count 2397 transition count 2294
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 4 with 399 rules applied. Total rules applied 6203 place count 2397 transition count 2294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6204 place count 2396 transition count 2293
Applied a total of 6204 rules in 1686 ms. Remains 2396 /5300 variables (removed 2904) and now considering 2293/4998 (removed 2705) transitions.
Finished structural reductions, in 1 iterations. Remains : 2396/5300 places, 2293/4998 transitions.
Incomplete random walk after 10000 steps, including 1278 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 876 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 122103 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122103 steps, saw 61091 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2293 rows 2396 cols
[2022-05-15 21:02:50] [INFO ] Invariants computation overflowed in 66 ms
[2022-05-15 21:03:09] [INFO ] After 18790ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 2396 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2396/2396 places, 2293/2293 transitions.
Applied a total of 0 rules in 214 ms. Remains 2396 /2396 variables (removed 0) and now considering 2293/2293 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2396/2396 places, 2293/2293 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2396/2396 places, 2293/2293 transitions.
Applied a total of 0 rules in 186 ms. Remains 2396 /2396 variables (removed 0) and now considering 2293/2293 (removed 0) transitions.
// Phase 1: matrix 2293 rows 2396 cols
[2022-05-15 21:03:09] [INFO ] Invariants computation overflowed in 66 ms
[2022-05-15 21:03:31] [INFO ] Implicit Places using invariants in 22376 ms returned []
// Phase 1: matrix 2293 rows 2396 cols
[2022-05-15 21:03:31] [INFO ] Invariants computation overflowed in 69 ms
[2022-05-15 21:03:54] [INFO ] Implicit Places using invariants and state equation in 22588 ms returned []
Implicit Place search using SMT with State Equation took 44970 ms to find 0 implicit places.
[2022-05-15 21:03:54] [INFO ] Redundant transitions in 75 ms returned []
// Phase 1: matrix 2293 rows 2396 cols
[2022-05-15 21:03:54] [INFO ] Invariants computation overflowed in 64 ms
[2022-05-15 21:03:56] [INFO ] Dead Transitions using invariants and state equation in 1485 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2396/2396 places, 2293/2293 transitions.
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 199 Pre rules applied. Total rules applied 0 place count 2396 transition count 2094
Deduced a syphon composed of 199 places in 76 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 0 with 398 rules applied. Total rules applied 398 place count 2197 transition count 2094
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 399 place count 2197 transition count 2093
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 400 place count 2196 transition count 2093
Applied a total of 400 rules in 513 ms. Remains 2196 /2396 variables (removed 200) and now considering 2093/2293 (removed 200) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2093 rows 2196 cols
[2022-05-15 21:03:56] [INFO ] Invariants computation overflowed in 44 ms
[2022-05-15 21:04:07] [INFO ] After 10502ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT p1)), true, (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 216 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 108 ms :[p0, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 100 ms :[p0, (AND p0 p1), (AND p0 p1)]
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 774 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:04:08] [INFO ] Invariants computation overflowed in 96 ms
[2022-05-15 21:04:10] [INFO ] Implicit Places using invariants in 2240 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:04:10] [INFO ] Invariants computation overflowed in 96 ms
[2022-05-15 21:04:11] [INFO ] Implicit Places using invariants and state equation in 1089 ms returned []
Implicit Place search using SMT with State Equation took 3331 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:04:12] [INFO ] Invariants computation overflowed in 92 ms
[2022-05-15 21:04:15] [INFO ] Dead Transitions using invariants and state equation in 3196 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5300/5300 places, 4998/4998 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 197 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 98 ms :[p0, (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 325 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 280 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 56722 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 56722 steps, saw 28367 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:04:20] [INFO ] Invariants computation overflowed in 94 ms
[2022-05-15 21:04:32] [INFO ] After 12340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.22 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1196 transitions
Trivial Post-agglo rules discarded 1196 transitions
Performed 1196 trivial Post agglomeration. Transition count delta: 1196
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1200 place count 5297 transition count 3800
Reduce places removed 1196 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2398 place count 4101 transition count 3798
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2400 place count 4099 transition count 3798
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2400 place count 4099 transition count 3598
Deduced a syphon composed of 200 places in 184 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2800 place count 3899 transition count 3598
Performed 904 Post agglomeration using F-continuation condition.Transition count delta: 904
Deduced a syphon composed of 904 places in 70 ms
Reduce places removed 904 places and 0 transitions.
Iterating global reduction 3 with 1808 rules applied. Total rules applied 4608 place count 2995 transition count 2694
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 52 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4810 place count 2894 transition count 2694
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 49 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 5004 place count 2797 transition count 2694
Free-agglomeration rule (complex) applied 400 times.
Iterating global reduction 3 with 400 rules applied. Total rules applied 5404 place count 2797 transition count 2294
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 3 with 400 rules applied. Total rules applied 5804 place count 2397 transition count 2294
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 4 with 399 rules applied. Total rules applied 6203 place count 2397 transition count 2294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6204 place count 2396 transition count 2293
Applied a total of 6204 rules in 1706 ms. Remains 2396 /5300 variables (removed 2904) and now considering 2293/4998 (removed 2705) transitions.
Finished structural reductions, in 1 iterations. Remains : 2396/5300 places, 2293/4998 transitions.
Incomplete random walk after 10000 steps, including 1281 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 122340 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122340 steps, saw 61208 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2293 rows 2396 cols
[2022-05-15 21:04:37] [INFO ] Invariants computation overflowed in 66 ms
[2022-05-15 21:04:56] [INFO ] After 18747ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 2396 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2396/2396 places, 2293/2293 transitions.
Applied a total of 0 rules in 193 ms. Remains 2396 /2396 variables (removed 0) and now considering 2293/2293 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2396/2396 places, 2293/2293 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2396/2396 places, 2293/2293 transitions.
Applied a total of 0 rules in 211 ms. Remains 2396 /2396 variables (removed 0) and now considering 2293/2293 (removed 0) transitions.
// Phase 1: matrix 2293 rows 2396 cols
[2022-05-15 21:04:56] [INFO ] Invariants computation overflowed in 66 ms
[2022-05-15 21:05:18] [INFO ] Implicit Places using invariants in 22086 ms returned []
// Phase 1: matrix 2293 rows 2396 cols
[2022-05-15 21:05:18] [INFO ] Invariants computation overflowed in 65 ms
[2022-05-15 21:05:41] [INFO ] Implicit Places using invariants and state equation in 22739 ms returned []
Implicit Place search using SMT with State Equation took 44830 ms to find 0 implicit places.
[2022-05-15 21:05:41] [INFO ] Redundant transitions in 77 ms returned []
// Phase 1: matrix 2293 rows 2396 cols
[2022-05-15 21:05:41] [INFO ] Invariants computation overflowed in 63 ms
[2022-05-15 21:05:43] [INFO ] Dead Transitions using invariants and state equation in 1581 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2396/2396 places, 2293/2293 transitions.
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 199 Pre rules applied. Total rules applied 0 place count 2396 transition count 2094
Deduced a syphon composed of 199 places in 78 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 0 with 398 rules applied. Total rules applied 398 place count 2197 transition count 2094
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 399 place count 2197 transition count 2093
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 400 place count 2196 transition count 2093
Applied a total of 400 rules in 505 ms. Remains 2196 /2396 variables (removed 200) and now considering 2093/2293 (removed 200) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2093 rows 2196 cols
[2022-05-15 21:05:43] [INFO ] Invariants computation overflowed in 45 ms
[2022-05-15 21:05:54] [INFO ] After 10527ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 255 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 104 ms :[p0, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 108 ms :[p0, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 100 ms :[p0, (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 3340 reset in 423 ms.
Product exploration explored 100000 steps with 3331 reset in 356 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 106 ms :[p0, (AND p0 p1), (AND p0 p1)]
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Performed 1196 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1196 rules applied. Total rules applied 1196 place count 5300 transition count 4998
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 201 Pre rules applied. Total rules applied 1196 place count 5300 transition count 5198
Deduced a syphon composed of 1397 places in 244 ms
Iterating global reduction 1 with 201 rules applied. Total rules applied 1397 place count 5300 transition count 5198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1399 place count 5298 transition count 5196
Deduced a syphon composed of 1395 places in 209 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 1401 place count 5298 transition count 5196
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: -200
Deduced a syphon composed of 2296 places in 151 ms
Iterating global reduction 1 with 901 rules applied. Total rules applied 2302 place count 5298 transition count 5396
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2303 place count 5297 transition count 5395
Deduced a syphon composed of 2295 places in 130 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2304 place count 5297 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -664
Deduced a syphon composed of 2396 places in 138 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 2405 place count 5297 transition count 6059
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 2506 place count 5196 transition count 5857
Deduced a syphon composed of 2295 places in 143 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 2607 place count 5196 transition count 5857
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: -627
Deduced a syphon composed of 2394 places in 138 ms
Iterating global reduction 1 with 99 rules applied. Total rules applied 2706 place count 5196 transition count 6484
Discarding 99 places :
Symmetric choice reduction at 1 with 99 rule applications. Total rules 2805 place count 5097 transition count 6286
Deduced a syphon composed of 2295 places in 125 ms
Iterating global reduction 1 with 99 rules applied. Total rules applied 2904 place count 5097 transition count 6286
Deduced a syphon composed of 2295 places in 124 ms
Applied a total of 2904 rules in 5001 ms. Remains 5097 /5300 variables (removed 203) and now considering 6286/4998 (removed -1288) transitions.
[2022-05-15 21:06:01] [INFO ] Redundant transitions in 267 ms returned []
// Phase 1: matrix 6286 rows 5097 cols
[2022-05-15 21:06:01] [INFO ] Invariants computation overflowed in 99 ms
[2022-05-15 21:06:04] [INFO ] Dead Transitions using invariants and state equation in 3497 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5097/5300 places, 6286/4998 transitions.
Finished structural reductions, in 1 iterations. Remains : 5097/5300 places, 6286/4998 transitions.
Product exploration explored 100000 steps with 10888 reset in 3159 ms.
Product exploration explored 100000 steps with 10846 reset in 3122 ms.
Built C files in :
/tmp/ltsmin7184599136273518573
[2022-05-15 21:06:11] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7184599136273518573
Running compilation step : cd /tmp/ltsmin7184599136273518573;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7184599136273518573;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7184599136273518573;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1039 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:06:15] [INFO ] Invariants computation overflowed in 93 ms
[2022-05-15 21:06:17] [INFO ] Implicit Places using invariants in 2133 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:06:17] [INFO ] Invariants computation overflowed in 90 ms
[2022-05-15 21:06:18] [INFO ] Implicit Places using invariants and state equation in 1024 ms returned []
Implicit Place search using SMT with State Equation took 3167 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:06:18] [INFO ] Invariants computation overflowed in 107 ms
[2022-05-15 21:06:21] [INFO ] Dead Transitions using invariants and state equation in 3411 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5300/5300 places, 4998/4998 transitions.
Built C files in :
/tmp/ltsmin11288463082249092323
[2022-05-15 21:06:22] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11288463082249092323
Running compilation step : cd /tmp/ltsmin11288463082249092323;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11288463082249092323;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11288463082249092323;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 21:06:26] [INFO ] Flatten gal took : 206 ms
[2022-05-15 21:06:26] [INFO ] Flatten gal took : 197 ms
[2022-05-15 21:06:26] [INFO ] Time to serialize gal into /tmp/LTL11039272497845890869.gal : 58 ms
[2022-05-15 21:06:26] [INFO ] Time to serialize properties into /tmp/LTL3025965942388564622.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/LTL11039272497845890869.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3025965942388564622.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/LTL1103927...267
Read 1 LTL properties
Checking formula 0 : !((!((G("(p63<=p3738)"))U(X("(p854>=3)")))))
Formula 0 simplified : G"(p63<=p3738)" U X"(p854>=3)"
Detected timeout of ITS tools.
[2022-05-15 21:06:41] [INFO ] Flatten gal took : 146 ms
[2022-05-15 21:06:41] [INFO ] Applying decomposition
[2022-05-15 21:06:42] [INFO ] Flatten gal took : 156 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/graph15895429041592285875.txt' '-o' '/tmp/graph15895429041592285875.bin' '-w' '/tmp/graph15895429041592285875.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15895429041592285875.bin' '-l' '-1' '-v' '-w' '/tmp/graph15895429041592285875.weights' '-q' '0' '-e' '0.001'
[2022-05-15 21:06:42] [INFO ] Decomposing Gal with order
[2022-05-15 21:06:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:06:44] [INFO ] Removed a total of 1401 redundant transitions.
[2022-05-15 21:06:44] [INFO ] Flatten gal took : 326 ms
[2022-05-15 21:06:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 106 labels/synchronizations in 192 ms.
[2022-05-15 21:06:45] [INFO ] Time to serialize gal into /tmp/LTL1488554089817997499.gal : 62 ms
[2022-05-15 21:06:45] [INFO ] Time to serialize properties into /tmp/LTL2649208015344339387.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/LTL1488554089817997499.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2649208015344339387.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/LTL1488554...266
Read 1 LTL properties
Checking formula 0 : !((!((G("(gu1296.p63<=gu1296.p3738)"))U(X("(gi6.gi1.gi0.gi1.gi0.gu2179.p854>=3)")))))
Formula 0 simplified : G"(gu1296.p63<=gu1296.p3738)" U X"(gi6.gi1.gi0.gi1.gi0.gu2179.p854>=3)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12748031041493547598
[2022-05-15 21:07:00] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12748031041493547598
Running compilation step : cd /tmp/ltsmin12748031041493547598;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12748031041493547598;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12748031041493547598;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property DoubleExponent-PT-100-LTLCardinality-09 finished in 280477 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&(!p0||F(p1)))))'
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1197 transitions
Trivial Post-agglo rules discarded 1197 transitions
Performed 1197 trivial Post agglomeration. Transition count delta: 1197
Iterating post reduction 0 with 1197 rules applied. Total rules applied 1197 place count 5299 transition count 3800
Reduce places removed 1197 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2396 place count 4102 transition count 3798
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2398 place count 4100 transition count 3798
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2398 place count 4100 transition count 3598
Deduced a syphon composed of 200 places in 184 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2798 place count 3900 transition count 3598
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 62 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 3 with 1802 rules applied. Total rules applied 4600 place count 2999 transition count 2697
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 57 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4802 place count 2898 transition count 2697
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 46 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 4994 place count 2802 transition count 2697
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 4996 place count 2802 transition count 2697
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4997 place count 2801 transition count 2696
Applied a total of 4997 rules in 1754 ms. Remains 2801 /5300 variables (removed 2499) and now considering 2696/4998 (removed 2302) transitions.
// Phase 1: matrix 2696 rows 2801 cols
[2022-05-15 21:07:05] [INFO ] Invariants computation overflowed in 55 ms
[2022-05-15 21:07:06] [INFO ] Implicit Places using invariants in 1424 ms returned []
// Phase 1: matrix 2696 rows 2801 cols
[2022-05-15 21:07:07] [INFO ] Invariants computation overflowed in 49 ms
[2022-05-15 21:07:09] [INFO ] Implicit Places using invariants and state equation in 2255 ms returned []
Implicit Place search using SMT with State Equation took 3689 ms to find 0 implicit places.
[2022-05-15 21:07:09] [INFO ] Redundant transitions in 54 ms returned []
// Phase 1: matrix 2696 rows 2801 cols
[2022-05-15 21:07:09] [INFO ] Invariants computation overflowed in 51 ms
[2022-05-15 21:07:10] [INFO ] Dead Transitions using invariants and state equation in 1345 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2801/5300 places, 2696/4998 transitions.
Finished structural reductions, in 1 iterations. Remains : 2801/5300 places, 2696/4998 transitions.
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s1544 s2267), p1:(LEQ 3 s917)], 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 5 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-100-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLCardinality-13 finished in 7009 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U X(p0)) U X(p0))&&G(X(p1))))'
Support contains 4 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1047 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:07:11] [INFO ] Invariants computation overflowed in 123 ms
[2022-05-15 21:07:13] [INFO ] Implicit Places using invariants in 2122 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:07:14] [INFO ] Invariants computation overflowed in 90 ms
[2022-05-15 21:07:14] [INFO ] Implicit Places using invariants and state equation in 1013 ms returned []
Implicit Place search using SMT with State Equation took 3153 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:07:15] [INFO ] Invariants computation overflowed in 90 ms
[2022-05-15 21:07:18] [INFO ] Dead Transitions using invariants and state equation in 3166 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(LEQ s465 s3069), p1:(LEQ s4988 s616)], 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]]
Product exploration explored 100000 steps with 3291 reset in 256 ms.
Product exploration explored 100000 steps with 3303 reset in 258 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X p1)), true, (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 321 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 330 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 59007 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59007 steps, saw 29508 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:07:23] [INFO ] Invariants computation overflowed in 99 ms
[2022-05-15 21:07:24] [INFO ] After 534ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 21:07:49] [INFO ] After 25052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1200 transitions
Trivial Post-agglo rules discarded 1200 transitions
Performed 1200 trivial Post agglomeration. Transition count delta: 1200
Iterating post reduction 0 with 1203 rules applied. Total rules applied 1204 place count 5297 transition count 3796
Reduce places removed 1200 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1201 rules applied. Total rules applied 2405 place count 4097 transition count 3795
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2406 place count 4096 transition count 3795
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2406 place count 4096 transition count 3595
Deduced a syphon composed of 200 places in 183 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2806 place count 3896 transition count 3595
Performed 903 Post agglomeration using F-continuation condition.Transition count delta: 903
Deduced a syphon composed of 903 places in 66 ms
Reduce places removed 903 places and 0 transitions.
Iterating global reduction 3 with 1806 rules applied. Total rules applied 4612 place count 2993 transition count 2692
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 56 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4814 place count 2892 transition count 2692
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 47 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 5008 place count 2795 transition count 2692
Free-agglomeration rule (complex) applied 397 times.
Iterating global reduction 3 with 397 rules applied. Total rules applied 5405 place count 2795 transition count 2295
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 3 with 397 rules applied. Total rules applied 5802 place count 2398 transition count 2295
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 4 with 399 rules applied. Total rules applied 6201 place count 2398 transition count 2295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6202 place count 2397 transition count 2294
Applied a total of 6202 rules in 2022 ms. Remains 2397 /5300 variables (removed 2903) and now considering 2294/4998 (removed 2704) transitions.
Finished structural reductions, in 1 iterations. Remains : 2397/5300 places, 2294/4998 transitions.
Incomplete random walk after 10000 steps, including 1283 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 859 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 122309 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122309 steps, saw 61191 distinct states, run finished after 3002 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2294 rows 2397 cols
[2022-05-15 21:07:54] [INFO ] Invariants computation overflowed in 63 ms
[2022-05-15 21:07:54] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 21:08:06] [INFO ] After 12283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2397 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2397/2397 places, 2294/2294 transitions.
Applied a total of 0 rules in 224 ms. Remains 2397 /2397 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2397/2397 places, 2294/2294 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2397/2397 places, 2294/2294 transitions.
Applied a total of 0 rules in 220 ms. Remains 2397 /2397 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
// Phase 1: matrix 2294 rows 2397 cols
[2022-05-15 21:08:07] [INFO ] Invariants computation overflowed in 66 ms
[2022-05-15 21:08:29] [INFO ] Implicit Places using invariants in 21934 ms returned []
// Phase 1: matrix 2294 rows 2397 cols
[2022-05-15 21:08:29] [INFO ] Invariants computation overflowed in 62 ms
[2022-05-15 21:08:52] [INFO ] Implicit Places using invariants and state equation in 22902 ms returned []
Implicit Place search using SMT with State Equation took 44850 ms to find 0 implicit places.
[2022-05-15 21:08:52] [INFO ] Redundant transitions in 75 ms returned []
// Phase 1: matrix 2294 rows 2397 cols
[2022-05-15 21:08:52] [INFO ] Invariants computation overflowed in 64 ms
[2022-05-15 21:08:53] [INFO ] Dead Transitions using invariants and state equation in 1473 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2397/2397 places, 2294/2294 transitions.
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 199 Pre rules applied. Total rules applied 0 place count 2397 transition count 2095
Deduced a syphon composed of 199 places in 76 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 0 with 398 rules applied. Total rules applied 398 place count 2198 transition count 2095
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 399 place count 2198 transition count 2094
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 400 place count 2197 transition count 2094
Applied a total of 400 rules in 576 ms. Remains 2197 /2397 variables (removed 200) and now considering 2094/2294 (removed 200) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2094 rows 2197 cols
[2022-05-15 21:08:54] [INFO ] Invariants computation overflowed in 35 ms
[2022-05-15 21:08:54] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 21:09:15] [INFO ] After 21276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X p1)), true, (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 323 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p1), (NOT p1)]
Support contains 2 out of 5300 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1027 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:09:17] [INFO ] Invariants computation overflowed in 96 ms
[2022-05-15 21:09:19] [INFO ] Implicit Places using invariants in 2083 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:09:19] [INFO ] Invariants computation overflowed in 109 ms
[2022-05-15 21:09:20] [INFO ] Implicit Places using invariants and state equation in 1009 ms returned []
Implicit Place search using SMT with State Equation took 3098 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:09:20] [INFO ] Invariants computation overflowed in 92 ms
[2022-05-15 21:09:23] [INFO ] Dead Transitions using invariants and state equation in 3253 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5300/5300 places, 4998/4998 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 343 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 59616 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59616 steps, saw 29813 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:09:28] [INFO ] Invariants computation overflowed in 95 ms
[2022-05-15 21:09:29] [INFO ] After 507ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 21:09:54] [INFO ] After 25052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1200 transitions
Trivial Post-agglo rules discarded 1200 transitions
Performed 1200 trivial Post agglomeration. Transition count delta: 1200
Iterating post reduction 0 with 1203 rules applied. Total rules applied 1204 place count 5297 transition count 3796
Reduce places removed 1200 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1201 rules applied. Total rules applied 2405 place count 4097 transition count 3795
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2406 place count 4096 transition count 3795
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2406 place count 4096 transition count 3595
Deduced a syphon composed of 200 places in 190 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2806 place count 3896 transition count 3595
Performed 903 Post agglomeration using F-continuation condition.Transition count delta: 903
Deduced a syphon composed of 903 places in 64 ms
Reduce places removed 903 places and 0 transitions.
Iterating global reduction 3 with 1806 rules applied. Total rules applied 4612 place count 2993 transition count 2692
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 62 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4814 place count 2892 transition count 2692
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 46 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 5008 place count 2795 transition count 2692
Free-agglomeration rule (complex) applied 397 times.
Iterating global reduction 3 with 397 rules applied. Total rules applied 5405 place count 2795 transition count 2295
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 3 with 397 rules applied. Total rules applied 5802 place count 2398 transition count 2295
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 4 with 399 rules applied. Total rules applied 6201 place count 2398 transition count 2295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6202 place count 2397 transition count 2294
Applied a total of 6202 rules in 2011 ms. Remains 2397 /5300 variables (removed 2903) and now considering 2294/4998 (removed 2704) transitions.
Finished structural reductions, in 1 iterations. Remains : 2397/5300 places, 2294/4998 transitions.
Incomplete random walk after 10000 steps, including 1270 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 869 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 122732 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122732 steps, saw 61417 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2294 rows 2397 cols
[2022-05-15 21:09:59] [INFO ] Invariants computation overflowed in 61 ms
[2022-05-15 21:09:59] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 21:10:12] [INFO ] After 12555ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2397 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2397/2397 places, 2294/2294 transitions.
Applied a total of 0 rules in 239 ms. Remains 2397 /2397 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2397/2397 places, 2294/2294 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2397/2397 places, 2294/2294 transitions.
Applied a total of 0 rules in 221 ms. Remains 2397 /2397 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
// Phase 1: matrix 2294 rows 2397 cols
[2022-05-15 21:10:12] [INFO ] Invariants computation overflowed in 61 ms
[2022-05-15 21:10:33] [INFO ] Implicit Places using invariants in 20896 ms returned []
// Phase 1: matrix 2294 rows 2397 cols
[2022-05-15 21:10:33] [INFO ] Invariants computation overflowed in 57 ms
[2022-05-15 21:10:55] [INFO ] Implicit Places using invariants and state equation in 22188 ms returned []
Implicit Place search using SMT with State Equation took 43087 ms to find 0 implicit places.
[2022-05-15 21:10:55] [INFO ] Redundant transitions in 74 ms returned []
// Phase 1: matrix 2294 rows 2397 cols
[2022-05-15 21:10:55] [INFO ] Invariants computation overflowed in 59 ms
[2022-05-15 21:10:57] [INFO ] Dead Transitions using invariants and state equation in 1482 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2397/2397 places, 2294/2294 transitions.
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 199 Pre rules applied. Total rules applied 0 place count 2397 transition count 2095
Deduced a syphon composed of 199 places in 76 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 0 with 398 rules applied. Total rules applied 398 place count 2198 transition count 2095
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 399 place count 2198 transition count 2094
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 400 place count 2197 transition count 2094
Applied a total of 400 rules in 585 ms. Remains 2197 /2397 variables (removed 200) and now considering 2094/2294 (removed 200) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2094 rows 2197 cols
[2022-05-15 21:10:57] [INFO ] Invariants computation overflowed in 34 ms
[2022-05-15 21:10:58] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 21:11:19] [INFO ] After 21099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [p1, (X p1), (X (X p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 3322 reset in 256 ms.
Product exploration explored 100000 steps with 3325 reset in 254 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p1), (NOT p1)]
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Performed 1199 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1199 place count 5300 transition count 4998
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 201 Pre rules applied. Total rules applied 1199 place count 5300 transition count 5198
Deduced a syphon composed of 1400 places in 240 ms
Iterating global reduction 1 with 201 rules applied. Total rules applied 1400 place count 5300 transition count 5198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1402 place count 5298 transition count 5196
Deduced a syphon composed of 1398 places in 214 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 1404 place count 5298 transition count 5196
Performed 900 Post agglomeration using F-continuation condition.Transition count delta: -199
Deduced a syphon composed of 2298 places in 160 ms
Iterating global reduction 1 with 900 rules applied. Total rules applied 2304 place count 5298 transition count 5395
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2305 place count 5297 transition count 5394
Deduced a syphon composed of 2297 places in 151 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2306 place count 5297 transition count 5394
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -659
Deduced a syphon composed of 2398 places in 153 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 2407 place count 5297 transition count 6053
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 2508 place count 5196 transition count 5851
Deduced a syphon composed of 2297 places in 137 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 2609 place count 5196 transition count 5851
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: -628
Deduced a syphon composed of 2396 places in 149 ms
Iterating global reduction 1 with 99 rules applied. Total rules applied 2708 place count 5196 transition count 6479
Discarding 99 places :
Symmetric choice reduction at 1 with 99 rule applications. Total rules 2807 place count 5097 transition count 6281
Deduced a syphon composed of 2297 places in 142 ms
Iterating global reduction 1 with 99 rules applied. Total rules applied 2906 place count 5097 transition count 6281
Deduced a syphon composed of 2297 places in 134 ms
Applied a total of 2906 rules in 5203 ms. Remains 5097 /5300 variables (removed 203) and now considering 6281/4998 (removed -1283) transitions.
[2022-05-15 21:11:25] [INFO ] Redundant transitions in 266 ms returned []
// Phase 1: matrix 6281 rows 5097 cols
[2022-05-15 21:11:26] [INFO ] Invariants computation overflowed in 90 ms
[2022-05-15 21:11:29] [INFO ] Dead Transitions using invariants and state equation in 3668 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5097/5300 places, 6281/4998 transitions.
Finished structural reductions, in 1 iterations. Remains : 5097/5300 places, 6281/4998 transitions.
Product exploration explored 100000 steps with 10801 reset in 3193 ms.
Product exploration explored 100000 steps with 10815 reset in 3211 ms.
Built C files in :
/tmp/ltsmin4402015189510005532
[2022-05-15 21:11:36] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4402015189510005532
Running compilation step : cd /tmp/ltsmin4402015189510005532;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4402015189510005532;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4402015189510005532;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1064 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:11:40] [INFO ] Invariants computation overflowed in 90 ms
[2022-05-15 21:11:42] [INFO ] Implicit Places using invariants in 2060 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:11:42] [INFO ] Invariants computation overflowed in 117 ms
[2022-05-15 21:11:43] [INFO ] Implicit Places using invariants and state equation in 1028 ms returned []
Implicit Place search using SMT with State Equation took 3125 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2022-05-15 21:11:43] [INFO ] Invariants computation overflowed in 90 ms
[2022-05-15 21:11:46] [INFO ] Dead Transitions using invariants and state equation in 3032 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5300/5300 places, 4998/4998 transitions.
Built C files in :
/tmp/ltsmin17579478845681224781
[2022-05-15 21:11:46] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17579478845681224781
Running compilation step : cd /tmp/ltsmin17579478845681224781;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17579478845681224781;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17579478845681224781;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 21:11:50] [INFO ] Flatten gal took : 164 ms
[2022-05-15 21:11:51] [INFO ] Flatten gal took : 156 ms
[2022-05-15 21:11:51] [INFO ] Time to serialize gal into /tmp/LTL12830082157394529907.gal : 22 ms
[2022-05-15 21:11:51] [INFO ] Time to serialize properties into /tmp/LTL13186514098813834158.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/LTL12830082157394529907.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13186514098813834158.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/LTL1283008...268
Read 1 LTL properties
Checking formula 0 : !((((("(p1417<=p3761)")U(X("(p1417<=p3761)")))U(X("(p1417<=p3761)")))&&(G(X("(p718<=p1553)")))))
Formula 0 simplified : !((("(p1417<=p3761)" U X"(p1417<=p3761)") U X"(p1417<=p3761)") & GX"(p718<=p1553)")
Detected timeout of ITS tools.
[2022-05-15 21:12:06] [INFO ] Flatten gal took : 131 ms
[2022-05-15 21:12:06] [INFO ] Applying decomposition
[2022-05-15 21:12:06] [INFO ] Flatten gal took : 130 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/graph2213098987482131960.txt' '-o' '/tmp/graph2213098987482131960.bin' '-w' '/tmp/graph2213098987482131960.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2213098987482131960.bin' '-l' '-1' '-v' '-w' '/tmp/graph2213098987482131960.weights' '-q' '0' '-e' '0.001'
[2022-05-15 21:12:06] [INFO ] Decomposing Gal with order
[2022-05-15 21:12:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:12:08] [INFO ] Removed a total of 1417 redundant transitions.
[2022-05-15 21:12:08] [INFO ] Flatten gal took : 248 ms
[2022-05-15 21:12:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 68 ms.
[2022-05-15 21:12:09] [INFO ] Time to serialize gal into /tmp/LTL6787525959785281187.gal : 60 ms
[2022-05-15 21:12:09] [INFO ] Time to serialize properties into /tmp/LTL16166279255652356826.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/LTL6787525959785281187.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16166279255652356826.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/LTL6787525...267
Read 1 LTL properties
Checking formula 0 : !((((("(gu1309.p1417<=gu1309.p3761)")U(X("(gu1309.p1417<=gu1309.p3761)")))U(X("(gu1309.p1417<=gu1309.p3761)")))&&(G(X("(gu2126.p718<=g...173
Formula 0 simplified : !((("(gu1309.p1417<=gu1309.p3761)" U X"(gu1309.p1417<=gu1309.p3761)") U X"(gu1309.p1417<=gu1309.p3761)") & GX"(gu2126.p718<=gu2126.p...162
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11262924687322196686
[2022-05-15 21:12:24] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11262924687322196686
Running compilation step : cd /tmp/ltsmin11262924687322196686;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11262924687322196686;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11262924687322196686;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property DoubleExponent-PT-100-LTLCardinality-14 finished in 316404 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p0)||p1))&&X(G(F(p2)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(G(p0) U X(p1)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U X(p0)) U X(p0))&&G(X(p1))))'
[2022-05-15 21:12:27] [INFO ] Flatten gal took : 122 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13022433622780882631
[2022-05-15 21:12:27] [INFO ] Too many transitions (4998) to apply POR reductions. Disabling POR matrices.
[2022-05-15 21:12:27] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13022433622780882631
Running compilation step : cd /tmp/ltsmin13022433622780882631;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-15 21:12:27] [INFO ] Applying decomposition
[2022-05-15 21:12:27] [INFO ] Flatten gal took : 129 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/graph8664520493432514397.txt' '-o' '/tmp/graph8664520493432514397.bin' '-w' '/tmp/graph8664520493432514397.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8664520493432514397.bin' '-l' '-1' '-v' '-w' '/tmp/graph8664520493432514397.weights' '-q' '0' '-e' '0.001'
[2022-05-15 21:12:28] [INFO ] Decomposing Gal with order
[2022-05-15 21:12:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:12:29] [INFO ] Removed a total of 1409 redundant transitions.
[2022-05-15 21:12:29] [INFO ] Flatten gal took : 238 ms
[2022-05-15 21:12:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 121 ms.
[2022-05-15 21:12:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality2273723200511832748.gal : 26 ms
[2022-05-15 21:12:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality6890548369449995531.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/LTLCardinality2273723200511832748.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6890548369449995531.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/LTLCardina...288
Read 3 LTL properties
Checking formula 0 : !(((F((F("(gu2119.p699<=gu2119.p1146)"))||("(gi4.gi1.gi0.gi0.gi0.gi2.gi2.gi4.gu1258.p3651>=2)")))&&(X(G(F("(gu1718.p4617<=gu1718.p2513...163
Formula 0 simplified : !(F("(gi4.gi1.gi0.gi0.gi0.gi2.gi2.gi4.gu1258.p3651>=2)" | F"(gu2119.p699<=gu2119.p1146)") & XGF"(gu1718.p4617<=gu1718.p2513)")
Compilation finished in 17910 ms.
Running link step : cd /tmp/ltsmin13022433622780882631;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin13022433622780882631;'/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)))&&X([](<>((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin13022433622780882631;'/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)))&&X([](<>((LTLAPp2==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13022433622780882631;'/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' '!([]((LTLAPp3==true)) U X((LTLAPp4==true)))' '--buchi-type=spotba'
LTSmin run took 3048 ms.
FORMULA DoubleExponent-PT-100-LTLCardinality-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin13022433622780882631;'/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' '((((LTLAPp5==true) U X((LTLAPp5==true))) U X((LTLAPp5==true)))&&[](X((LTLAPp6==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 21:38:13] [INFO ] Flatten gal took : 317 ms
[2022-05-15 21:38:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality11087050541823965188.gal : 24 ms
[2022-05-15 21:38:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality4019660264314137701.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/LTLCardinality11087050541823965188.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4019660264314137701.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/LTLCardina...289
Read 2 LTL properties
Checking formula 0 : !(((F((F("(p699<=p1146)"))||("(p3651>=2)")))&&(X(G(F("(p4617<=p2513)"))))))
Formula 0 simplified : !(F("(p3651>=2)" | F"(p699<=p1146)") & XGF"(p4617<=p2513)")
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin13022433622780882631;'/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' '((((LTLAPp5==true) U X((LTLAPp5==true))) U X((LTLAPp5==true)))&&[](X((LTLAPp6==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin13022433622780882631;'/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)))&&X([](<>((LTLAPp2==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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="DoubleExponent-PT-100"
export BK_EXAMINATION="LTLCardinality"
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 DoubleExponent-PT-100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-tall-165260110000211"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-100.tgz
mv DoubleExponent-PT-100 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;