Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.6M
-rw-r--r-- 1 mcc users 5.8K Feb 25 22:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 25 22:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 22:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 25 22:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 22:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 22:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 25 22:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 5.2M Mar 5 18:23 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 Railroad-PT-100-LTLFireability-00
FORMULA_NAME Railroad-PT-100-LTLFireability-01
FORMULA_NAME Railroad-PT-100-LTLFireability-02
FORMULA_NAME Railroad-PT-100-LTLFireability-03
FORMULA_NAME Railroad-PT-100-LTLFireability-04
FORMULA_NAME Railroad-PT-100-LTLFireability-05
FORMULA_NAME Railroad-PT-100-LTLFireability-06
FORMULA_NAME Railroad-PT-100-LTLFireability-07
FORMULA_NAME Railroad-PT-100-LTLFireability-08
FORMULA_NAME Railroad-PT-100-LTLFireability-09
FORMULA_NAME Railroad-PT-100-LTLFireability-10
FORMULA_NAME Railroad-PT-100-LTLFireability-11
FORMULA_NAME Railroad-PT-100-LTLFireability-12
FORMULA_NAME Railroad-PT-100-LTLFireability-13
FORMULA_NAME Railroad-PT-100-LTLFireability-14
FORMULA_NAME Railroad-PT-100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679010541600

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Railroad-PT-100
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-16 23:49:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 23:49:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 23:49:03] [INFO ] Load time of PNML (sax parser for PT used): 346 ms
[2023-03-16 23:49:03] [INFO ] Transformed 1018 places.
[2023-03-16 23:49:03] [INFO ] Transformed 10506 transitions.
[2023-03-16 23:49:03] [INFO ] Found NUPN structural information;
[2023-03-16 23:49:03] [INFO ] Parsed PT model containing 1018 places and 10506 transitions and 62728 arcs in 487 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 301 places in 109 ms
Reduce places removed 301 places and 100 transitions.
FORMULA Railroad-PT-100-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-100-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-100-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 717 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 717/717 places, 10406/10406 transitions.
Ensure Unique test removed 102 places
Iterating post reduction 0 with 102 rules applied. Total rules applied 102 place count 615 transition count 10406
Applied a total of 102 rules in 164 ms. Remains 615 /717 variables (removed 102) and now considering 10406/10406 (removed 0) transitions.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-16 23:49:04] [INFO ] Invariants computation overflowed in 58 ms
[2023-03-16 23:49:05] [INFO ] Implicit Places using invariants in 1166 ms returned []
Implicit Place search using SMT only with invariants took 1190 ms to find 0 implicit places.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-16 23:49:05] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-16 23:49:09] [INFO ] Dead Transitions using invariants and state equation in 3451 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 615/717 places, 10406/10406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4812 ms. Remains : 615/717 places, 10406/10406 transitions.
Support contains 50 out of 615 places after structural reductions.
[2023-03-16 23:49:10] [INFO ] Flatten gal took : 1135 ms
[2023-03-16 23:49:11] [INFO ] Flatten gal took : 452 ms
[2023-03-16 23:49:12] [INFO ] Input system was already deterministic with 10406 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 870 ms. (steps per millisecond=11 ) properties (out of 28) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-16 23:49:13] [INFO ] Invariants computation overflowed in 28 ms
[2023-03-16 23:49:27] [INFO ] After 13349ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:19
[2023-03-16 23:49:40] [INFO ] After 11803ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :19
[2023-03-16 23:49:49] [INFO ] After 21287ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :19
Attempting to minimize the solution found.
Minimization took 3236 ms.
[2023-03-16 23:49:52] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :19
Fused 21 Parikh solutions to 19 different solutions.
Parikh walk visited 18 properties in 4896 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 25 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 0 with 198 rules applied. Total rules applied 198 place count 516 transition count 10307
Applied a total of 198 rules in 6679 ms. Remains 516 /615 variables (removed 99) and now considering 10307/10406 (removed 99) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6681 ms. Remains : 516/615 places, 10307/10406 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 291083 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 291083 steps, saw 280901 distinct states, run finished after 3006 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-16 23:50:07] [INFO ] Invariants computation overflowed in 25 ms
[2023-03-16 23:50:10] [INFO ] After 2822ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:50:13] [INFO ] After 2480ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:50:13] [INFO ] After 2879ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 203 ms.
[2023-03-16 23:50:13] [INFO ] After 3190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 137 steps, including 2 resets, run visited all 1 properties in 14 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 15 ms.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA Railroad-PT-100-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 33 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 0 with 198 rules applied. Total rules applied 198 place count 516 transition count 10307
Applied a total of 198 rules in 6372 ms. Remains 516 /615 variables (removed 99) and now considering 10307/10406 (removed 99) transitions.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-16 23:50:20] [INFO ] Invariants computation overflowed in 24 ms
[2023-03-16 23:50:21] [INFO ] Implicit Places using invariants in 997 ms returned []
Implicit Place search using SMT only with invariants took 999 ms to find 0 implicit places.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-16 23:50:21] [INFO ] Invariants computation overflowed in 17 ms
[2023-03-16 23:50:24] [INFO ] Dead Transitions using invariants and state equation in 3097 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 516/615 places, 10307/10406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10475 ms. Remains : 516/615 places, 10307/10406 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s182 1) (NEQ s206 1) (NEQ s492 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 3058 ms.
Product exploration explored 100000 steps with 0 reset in 2914 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 276743 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 276743 steps, saw 267208 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-16 23:50:34] [INFO ] Invariants computation overflowed in 19 ms
[2023-03-16 23:50:37] [INFO ] After 2987ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:50:40] [INFO ] After 2703ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:50:40] [INFO ] After 3103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 210 ms.
[2023-03-16 23:50:41] [INFO ] After 3420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 383 steps, including 2 resets, run visited all 1 properties in 16 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 19 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 10307/10307 transitions.
Applied a total of 0 rules in 6155 ms. Remains 516 /516 variables (removed 0) and now considering 10307/10307 (removed 0) transitions.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-16 23:50:47] [INFO ] Invariants computation overflowed in 28 ms
[2023-03-16 23:50:48] [INFO ] Implicit Places using invariants in 880 ms returned []
Implicit Place search using SMT only with invariants took 885 ms to find 0 implicit places.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-16 23:50:48] [INFO ] Invariants computation overflowed in 13 ms
[2023-03-16 23:50:51] [INFO ] Dead Transitions using invariants and state equation in 3106 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10149 ms. Remains : 516/516 places, 10307/10307 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 268402 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 268402 steps, saw 259217 distinct states, run finished after 3004 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-16 23:50:55] [INFO ] Invariants computation overflowed in 14 ms
[2023-03-16 23:50:58] [INFO ] After 2950ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:51:01] [INFO ] After 2942ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:51:01] [INFO ] After 3363ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 220 ms.
[2023-03-16 23:51:01] [INFO ] After 3691ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 384 steps, including 2 resets, run visited all 1 properties in 18 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 19 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 2871 ms.
Product exploration explored 100000 steps with 0 reset in 2855 ms.
Built C files in :
/tmp/ltsmin9001327632783888092
[2023-03-16 23:51:08] [INFO ] Too many transitions (10307) to apply POR reductions. Disabling POR matrices.
[2023-03-16 23:51:08] [INFO ] Built C files in 155ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9001327632783888092
Running compilation step : cd /tmp/ltsmin9001327632783888092;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin9001327632783888092;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin9001327632783888092;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 10307/10307 transitions.
Applied a total of 0 rules in 6136 ms. Remains 516 /516 variables (removed 0) and now considering 10307/10307 (removed 0) transitions.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-16 23:51:17] [INFO ] Invariants computation overflowed in 19 ms
[2023-03-16 23:51:18] [INFO ] Implicit Places using invariants in 832 ms returned []
Implicit Place search using SMT only with invariants took 835 ms to find 0 implicit places.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-16 23:51:18] [INFO ] Invariants computation overflowed in 22 ms
[2023-03-16 23:51:21] [INFO ] Dead Transitions using invariants and state equation in 3004 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9981 ms. Remains : 516/516 places, 10307/10307 transitions.
Built C files in :
/tmp/ltsmin12842711888367919203
[2023-03-16 23:51:21] [INFO ] Too many transitions (10307) to apply POR reductions. Disabling POR matrices.
[2023-03-16 23:51:21] [INFO ] Built C files in 109ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12842711888367919203
Running compilation step : cd /tmp/ltsmin12842711888367919203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin12842711888367919203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin12842711888367919203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-16 23:51:25] [INFO ] Flatten gal took : 411 ms
[2023-03-16 23:51:25] [INFO ] Flatten gal took : 387 ms
[2023-03-16 23:51:25] [INFO ] Time to serialize gal into /tmp/LTL4513664135190785895.gal : 82 ms
[2023-03-16 23:51:25] [INFO ] Time to serialize properties into /tmp/LTL16715252324424770843.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4513664135190785895.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3527114867359545413.hoa' '-atoms' '/tmp/LTL16715252324424770843.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16715252324424770843.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3527114867359545413.hoa
Detected timeout of ITS tools.
[2023-03-16 23:51:41] [INFO ] Flatten gal took : 357 ms
[2023-03-16 23:51:42] [INFO ] Flatten gal took : 364 ms
[2023-03-16 23:51:42] [INFO ] Time to serialize gal into /tmp/LTL5833511840313390457.gal : 47 ms
[2023-03-16 23:51:42] [INFO ] Time to serialize properties into /tmp/LTL6195156681409380367.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5833511840313390457.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6195156681409380367.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(((pl_P29_92==0)||(pl_P304_21==0))||(pl_P51_1==0))"))))
Formula 0 simplified : FG!"(((pl_P29_92==0)||(pl_P304_21==0))||(pl_P51_1==0))"
Detected timeout of ITS tools.
[2023-03-16 23:51:57] [INFO ] Flatten gal took : 347 ms
[2023-03-16 23:51:57] [INFO ] Applying decomposition
[2023-03-16 23:51:57] [INFO ] Flatten gal took : 378 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17499589047197666538.txt' '-o' '/tmp/graph17499589047197666538.bin' '-w' '/tmp/graph17499589047197666538.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17499589047197666538.bin' '-l' '-1' '-v' '-w' '/tmp/graph17499589047197666538.weights' '-q' '0' '-e' '0.001'
[2023-03-16 23:51:58] [INFO ] Decomposing Gal with order
[2023-03-16 23:51:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 23:51:59] [INFO ] Removed a total of 33046 redundant transitions.
[2023-03-16 23:52:00] [INFO ] Flatten gal took : 880 ms
[2023-03-16 23:52:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 226 labels/synchronizations in 327 ms.
[2023-03-16 23:52:00] [INFO ] Time to serialize gal into /tmp/LTL17431466194343637873.gal : 52 ms
[2023-03-16 23:52:00] [INFO ] Time to serialize properties into /tmp/LTL17151540332866081613.ltl : 27 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17431466194343637873.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17151540332866081613.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("(((u91.pl_P29_92==0)||(i46.i0.u101.pl_P304_21==0))||(i45.i1.u105.pl_P51_1==0))"))))
Formula 0 simplified : FG!"(((u91.pl_P29_92==0)||(i46.i0.u101.pl_P304_21==0))||(i45.i1.u105.pl_P51_1==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1889494060353804977
[2023-03-16 23:52:15] [INFO ] Built C files in 106ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1889494060353804977
Running compilation step : cd /tmp/ltsmin1889494060353804977;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1889494060353804977;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1889494060353804977;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Railroad-PT-100-LTLFireability-00 finished in 124656 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((G(p1)&&p0) U p2)))))'
Support contains 5 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Applied a total of 0 rules in 59 ms. Remains 615 /615 variables (removed 0) and now considering 10406/10406 (removed 0) transitions.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-16 23:52:18] [INFO ] Invariants computation overflowed in 19 ms
[2023-03-16 23:52:19] [INFO ] Implicit Places using invariants in 855 ms returned []
Implicit Place search using SMT only with invariants took 856 ms to find 0 implicit places.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-16 23:52:19] [INFO ] Invariants computation overflowed in 20 ms
[2023-03-16 23:52:22] [INFO ] Dead Transitions using invariants and state equation in 2817 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3734 ms. Remains : 615/615 places, 10406/10406 transitions.
Stuttering acceptance computed with spot in 658 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1), (NOT p2)]
Running random walk in product with property : Railroad-PT-100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p2 (AND p0 p1)), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s149 1) (EQ s252 1) (EQ s569 1)), p0:(AND (EQ s149 1) (EQ s252 1) (EQ s569 1)), p1:(AND (EQ s188 1) (EQ s251 1) (EQ s569 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Railroad-PT-100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-100-LTLFireability-01 finished in 4460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(X(G(p1))||(F(p3)&&p2)))))'
Support contains 7 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Applied a total of 0 rules in 56 ms. Remains 615 /615 variables (removed 0) and now considering 10406/10406 (removed 0) transitions.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-16 23:52:23] [INFO ] Invariants computation overflowed in 16 ms
[2023-03-16 23:52:24] [INFO ] Implicit Places using invariants in 931 ms returned []
Implicit Place search using SMT only with invariants took 931 ms to find 0 implicit places.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-16 23:52:24] [INFO ] Invariants computation overflowed in 12 ms
[2023-03-16 23:52:27] [INFO ] Dead Transitions using invariants and state equation in 2978 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3967 ms. Remains : 615/615 places, 10406/10406 transitions.
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p3) (NOT p1)), true, (NOT p3)]
Running random walk in product with property : Railroad-PT-100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p3) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s116 1) (EQ s268 1) (EQ s569 1)), p2:(AND (EQ s116 1) (EQ s268 1) (EQ s569 1)), p3:(AND (EQ s145 1) (EQ s258 1) (EQ s569 1)), p1:(AND (EQ s155...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Railroad-PT-100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-100-LTLFireability-02 finished in 4338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||G(p1)))&&F(p2)))'
Support contains 7 out of 615 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 26 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 0 with 194 rules applied. Total rules applied 194 place count 518 transition count 10309
Applied a total of 194 rules in 6583 ms. Remains 518 /615 variables (removed 97) and now considering 10309/10406 (removed 97) transitions.
// Phase 1: matrix 10309 rows 518 cols
[2023-03-16 23:52:34] [INFO ] Invariants computation overflowed in 17 ms
[2023-03-16 23:52:35] [INFO ] Implicit Places using invariants in 843 ms returned []
Implicit Place search using SMT only with invariants took 844 ms to find 0 implicit places.
// Phase 1: matrix 10309 rows 518 cols
[2023-03-16 23:52:35] [INFO ] Invariants computation overflowed in 12 ms
[2023-03-16 23:52:37] [INFO ] Dead Transitions using invariants and state equation in 2658 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 518/615 places, 10309/10406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10088 ms. Remains : 518/615 places, 10309/10406 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, (OR (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : Railroad-PT-100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p1:(OR (EQ s144 0) (EQ s246 0) (EQ s493 0)), p2:(AND (EQ s169 1) (EQ s204 1) (EQ s493 1)), p0:(AND (EQ s116 1) (EQ s287 1) (EQ s493 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 8094 steps with 0 reset in 252 ms.
FORMULA Railroad-PT-100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-100-LTLFireability-03 finished in 10613 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))&&F((p1&&X((p1 U (G(p1)||(!p2&&X(!p3))))))))))'
Support contains 9 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Applied a total of 0 rules in 54 ms. Remains 615 /615 variables (removed 0) and now considering 10406/10406 (removed 0) transitions.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-16 23:52:38] [INFO ] Invariants computation overflowed in 19 ms
[2023-03-16 23:52:39] [INFO ] Implicit Places using invariants in 852 ms returned []
Implicit Place search using SMT only with invariants took 853 ms to find 0 implicit places.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-16 23:52:39] [INFO ] Invariants computation overflowed in 17 ms
[2023-03-16 23:52:42] [INFO ] Dead Transitions using invariants and state equation in 2814 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3727 ms. Remains : 615/615 places, 10406/10406 transitions.
Stuttering acceptance computed with spot in 628 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1), (OR (AND (NOT p1) p3) (AND (NOT p1) p2)), (AND (NOT p1) p3), (AND (NOT p1) p3)]
Running random walk in product with property : Railroad-PT-100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) p3), acceptance={0} source=6 dest: 4}, { cond=(AND p1 p3), acceptance={0} source=6 dest: 5}], [{ cond=(AND (NOT p1) p2 p3), acceptance={0} source=7 dest: 4}, { cond=(AND p1 p2 p3), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={0} source=7 dest: 6}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s199 1) (EQ s303 1) (EQ s569 1)), p1:(OR (NEQ s193 1) (NEQ s277 1) (NEQ s569 1)), p2:(AND (EQ s190 1) (EQ s244 1) (EQ s569 1)), p3:(AND (EQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2290 ms.
Product exploration explored 100000 steps with 1 reset in 2574 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) (NOT p3)), (X p1), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p2)))), true, (X (X p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 519 ms. Reduced automaton from 8 states, 20 edges and 4 AP (stutter sensitive) to 8 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 386 ms :[(OR (NOT p0) (AND (NOT p1) p3) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2) (AND (NOT p1) p3)), (NOT p0), (NOT p0), (NOT p1), (OR (AND (NOT p1) p3) (AND (NOT p1) p2)), (AND (NOT p1) p3), (AND (NOT p1) p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 510 ms. (steps per millisecond=19 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 107458 steps, run timeout after 3003 ms. (steps per millisecond=35 ) properties seen :{1=1, 4=1, 5=1}
Probabilistic random walk after 107458 steps, saw 104568 distinct states, run finished after 3003 ms. (steps per millisecond=35 ) properties seen :3
Running SMT prover for 9 properties.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-16 23:52:52] [INFO ] Invariants computation overflowed in 18 ms
[2023-03-16 23:53:02] [INFO ] After 9441ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:4
[2023-03-16 23:53:09] [INFO ] After 6942ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :4
[2023-03-16 23:53:11] [INFO ] After 8898ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :4
Attempting to minimize the solution found.
Minimization took 1250 ms.
[2023-03-16 23:53:12] [INFO ] After 10311ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :4
Fused 9 Parikh solutions to 4 different solutions.
Parikh walk visited 3 properties in 294 ms.
Support contains 5 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 28 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 196 rules applied. Total rules applied 196 place count 517 transition count 10308
Applied a total of 196 rules in 5892 ms. Remains 517 /615 variables (removed 98) and now considering 10308/10406 (removed 98) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5892 ms. Remains : 517/615 places, 10308/10406 transitions.
Finished random walk after 3494 steps, including 1 resets, run visited all 1 properties in 99 ms. (steps per millisecond=35 )
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) (NOT p3)), (X p1), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p2)))), true, (X (X p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (G (NOT (AND p3 (NOT p1) p2))), (G (NOT (AND p3 p1 p2))), (G (NOT (AND p3 (NOT p1)))), (G (NOT (AND (NOT p1) p2))), (G (NOT (AND p3 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND p3 p1)), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2)), (F (NOT (AND p1 (NOT p2)))), (F p0), (F (NOT p1)), (F (AND p3 p1 (NOT p2)))]
Knowledge based reduction with 15 factoid took 1403 ms. Reduced automaton from 8 states, 19 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 318 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (NOT p1), (NOT p1)]
// Phase 1: matrix 10406 rows 615 cols
[2023-03-16 23:53:20] [INFO ] Invariants computation overflowed in 19 ms
[2023-03-16 23:53:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 23:53:27] [INFO ] [Real]Absence check using state equation in 2884 ms returned sat
[2023-03-16 23:53:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 23:53:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 23:53:35] [INFO ] [Nat]Absence check using state equation in 3001 ms returned sat
[2023-03-16 23:53:36] [INFO ] Deduced a trap composed of 3 places in 1066 ms of which 1 ms to minimize.
[2023-03-16 23:53:38] [INFO ] Deduced a trap composed of 6 places in 533 ms of which 1 ms to minimize.
[2023-03-16 23:53:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 2381 ms
Proved EG (AND (NOT p0) (NOT p3))
// Phase 1: matrix 10406 rows 615 cols
[2023-03-16 23:53:38] [INFO ] Invariants computation overflowed in 21 ms
[2023-03-16 23:53:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 23:53:45] [INFO ] [Real]Absence check using state equation in 2929 ms returned sat
[2023-03-16 23:53:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 23:53:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 23:53:52] [INFO ] [Nat]Absence check using state equation in 2850 ms returned sat
[2023-03-16 23:53:53] [INFO ] Deduced a trap composed of 6 places in 988 ms of which 1 ms to minimize.
[2023-03-16 23:53:55] [INFO ] Deduced a trap composed of 3 places in 1058 ms of which 1 ms to minimize.
[2023-03-16 23:53:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 2659 ms
Proved EG (AND (NOT p0) (NOT p2))
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) (NOT p3)), (X p1), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p2)))), true, (X (X p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (G (NOT (AND p3 (NOT p1) p2))), (G (NOT (AND p3 p1 p2))), (G (NOT (AND p3 (NOT p1)))), (G (NOT (AND (NOT p1) p2))), (G (NOT (AND p3 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND p3 p1)), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2)), (F (NOT (AND p1 (NOT p2)))), (F p0), (F (NOT p1)), (F (AND p3 p1 (NOT p2))), (G (AND (NOT p0) (NOT p3))), (G (AND (NOT p0) (NOT p2)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p0) (NOT p3)))
Knowledge based reduction with 15 factoid took 452 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Railroad-PT-100-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-100-LTLFireability-05 finished in 77582 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(!p0))'
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 26 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 0 with 198 rules applied. Total rules applied 198 place count 516 transition count 10307
Applied a total of 198 rules in 6224 ms. Remains 516 /615 variables (removed 99) and now considering 10307/10406 (removed 99) transitions.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-16 23:54:02] [INFO ] Invariants computation overflowed in 19 ms
[2023-03-16 23:54:02] [INFO ] Implicit Places using invariants in 855 ms returned []
Implicit Place search using SMT only with invariants took 855 ms to find 0 implicit places.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-16 23:54:02] [INFO ] Invariants computation overflowed in 16 ms
[2023-03-16 23:54:05] [INFO ] Dead Transitions using invariants and state equation in 2801 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 516/615 places, 10307/10406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9885 ms. Remains : 516/615 places, 10307/10406 transitions.
Stuttering acceptance computed with spot in 62 ms :[true, p0]
Running random walk in product with property : Railroad-PT-100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s130 1) (EQ s233 1) (EQ s491 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1673 steps with 0 reset in 48 ms.
FORMULA Railroad-PT-100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-100-LTLFireability-06 finished in 10053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 29 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 0 with 198 rules applied. Total rules applied 198 place count 516 transition count 10307
Applied a total of 198 rules in 5915 ms. Remains 516 /615 variables (removed 99) and now considering 10307/10406 (removed 99) transitions.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-16 23:54:11] [INFO ] Invariants computation overflowed in 21 ms
[2023-03-16 23:54:12] [INFO ] Implicit Places using invariants in 867 ms returned []
Implicit Place search using SMT only with invariants took 867 ms to find 0 implicit places.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-16 23:54:12] [INFO ] Invariants computation overflowed in 12 ms
[2023-03-16 23:54:15] [INFO ] Dead Transitions using invariants and state equation in 2724 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 516/615 places, 10307/10406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9510 ms. Remains : 516/615 places, 10307/10406 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s175 1) (EQ s207 1) (EQ s492 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 2780 ms.
Stack based approach found an accepted trace after 28987 steps with 0 reset with depth 28988 and stack size 28988 in 788 ms.
FORMULA Railroad-PT-100-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-100-LTLFireability-10 finished in 13191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 30 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 0 with 198 rules applied. Total rules applied 198 place count 516 transition count 10307
Applied a total of 198 rules in 5956 ms. Remains 516 /615 variables (removed 99) and now considering 10307/10406 (removed 99) transitions.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-16 23:54:25] [INFO ] Invariants computation overflowed in 18 ms
[2023-03-16 23:54:25] [INFO ] Implicit Places using invariants in 860 ms returned []
Implicit Place search using SMT only with invariants took 861 ms to find 0 implicit places.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-16 23:54:25] [INFO ] Invariants computation overflowed in 17 ms
[2023-03-16 23:54:28] [INFO ] Dead Transitions using invariants and state equation in 2835 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 516/615 places, 10307/10406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9654 ms. Remains : 516/615 places, 10307/10406 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s123 0) (EQ s264 0) (EQ s492 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 2613 ms.
Product exploration explored 100000 steps with 0 reset in 2742 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Finished probabilistic random walk after 27209 steps, run visited all 1 properties in 282 ms. (steps per millisecond=96 )
Probabilistic random walk after 27209 steps, saw 26501 distinct states, run finished after 283 ms. (steps per millisecond=96 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 3 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 10307/10307 transitions.
Applied a total of 0 rules in 5959 ms. Remains 516 /516 variables (removed 0) and now considering 10307/10307 (removed 0) transitions.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-16 23:54:41] [INFO ] Invariants computation overflowed in 17 ms
[2023-03-16 23:54:42] [INFO ] Implicit Places using invariants in 860 ms returned []
Implicit Place search using SMT only with invariants took 862 ms to find 0 implicit places.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-16 23:54:42] [INFO ] Invariants computation overflowed in 12 ms
[2023-03-16 23:54:45] [INFO ] Dead Transitions using invariants and state equation in 2895 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9718 ms. Remains : 516/516 places, 10307/10307 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Finished probabilistic random walk after 27209 steps, run visited all 1 properties in 267 ms. (steps per millisecond=101 )
Probabilistic random walk after 27209 steps, saw 26501 distinct states, run finished after 268 ms. (steps per millisecond=101 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 178 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 2681 ms.
Product exploration explored 100000 steps with 0 reset in 2814 ms.
Built C files in :
/tmp/ltsmin6372743086056962718
[2023-03-16 23:54:51] [INFO ] Too many transitions (10307) to apply POR reductions. Disabling POR matrices.
[2023-03-16 23:54:51] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6372743086056962718
Running compilation step : cd /tmp/ltsmin6372743086056962718;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin6372743086056962718;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin6372743086056962718;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 10307/10307 transitions.
Applied a total of 0 rules in 5740 ms. Remains 516 /516 variables (removed 0) and now considering 10307/10307 (removed 0) transitions.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-16 23:55:00] [INFO ] Invariants computation overflowed in 18 ms
[2023-03-16 23:55:01] [INFO ] Implicit Places using invariants in 793 ms returned []
Implicit Place search using SMT only with invariants took 809 ms to find 0 implicit places.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-16 23:55:01] [INFO ] Invariants computation overflowed in 18 ms
[2023-03-16 23:55:04] [INFO ] Dead Transitions using invariants and state equation in 2906 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9457 ms. Remains : 516/516 places, 10307/10307 transitions.
Built C files in :
/tmp/ltsmin16751002490552303681
[2023-03-16 23:55:04] [INFO ] Too many transitions (10307) to apply POR reductions. Disabling POR matrices.
[2023-03-16 23:55:04] [INFO ] Built C files in 98ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16751002490552303681
Running compilation step : cd /tmp/ltsmin16751002490552303681;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin16751002490552303681;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin16751002490552303681;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-16 23:55:08] [INFO ] Flatten gal took : 350 ms
[2023-03-16 23:55:08] [INFO ] Flatten gal took : 386 ms
[2023-03-16 23:55:08] [INFO ] Time to serialize gal into /tmp/LTL17304763169557736085.gal : 52 ms
[2023-03-16 23:55:08] [INFO ] Time to serialize properties into /tmp/LTL10876284722909515059.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17304763169557736085.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14698814317005608939.hoa' '-atoms' '/tmp/LTL10876284722909515059.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL10876284722909515059.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14698814317005608939.hoa
Detected timeout of ITS tools.
[2023-03-16 23:55:24] [INFO ] Flatten gal took : 378 ms
[2023-03-16 23:55:24] [INFO ] Flatten gal took : 411 ms
[2023-03-16 23:55:24] [INFO ] Time to serialize gal into /tmp/LTL5342866777153193558.gal : 235 ms
[2023-03-16 23:55:24] [INFO ] Time to serialize properties into /tmp/LTL15890897434953369228.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5342866777153193558.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15890897434953369228.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(((pl_P29_38==0)||(pl_P304_73==0))||(pl_P51_1==0))"))))
Formula 0 simplified : GF!"(((pl_P29_38==0)||(pl_P304_73==0))||(pl_P51_1==0))"
Detected timeout of ITS tools.
[2023-03-16 23:55:40] [INFO ] Flatten gal took : 379 ms
[2023-03-16 23:55:40] [INFO ] Applying decomposition
[2023-03-16 23:55:40] [INFO ] Flatten gal took : 401 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17956231467558736336.txt' '-o' '/tmp/graph17956231467558736336.bin' '-w' '/tmp/graph17956231467558736336.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17956231467558736336.bin' '-l' '-1' '-v' '-w' '/tmp/graph17956231467558736336.weights' '-q' '0' '-e' '0.001'
[2023-03-16 23:55:41] [INFO ] Decomposing Gal with order
[2023-03-16 23:55:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 23:55:41] [INFO ] Removed a total of 33850 redundant transitions.
[2023-03-16 23:55:42] [INFO ] Flatten gal took : 484 ms
[2023-03-16 23:55:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 227 labels/synchronizations in 214 ms.
[2023-03-16 23:55:42] [INFO ] Time to serialize gal into /tmp/LTL8126715160364525410.gal : 33 ms
[2023-03-16 23:55:42] [INFO ] Time to serialize properties into /tmp/LTL3714702740401189629.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8126715160364525410.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3714702740401189629.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("(((u188.pl_P29_38==0)||(i54.i0.u135.pl_P304_73==0))||(i48.i2.u110.pl_P51_1==0))"))))
Formula 0 simplified : GF!"(((u188.pl_P29_38==0)||(i54.i0.u135.pl_P304_73==0))||(i48.i2.u110.pl_P51_1==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15738450075871343328
[2023-03-16 23:55:57] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15738450075871343328
Running compilation step : cd /tmp/ltsmin15738450075871343328;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin15738450075871343328;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin15738450075871343328;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Railroad-PT-100-LTLFireability-11 finished in 101494 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(G(p1)))))'
Support contains 5 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Applied a total of 0 rules in 51 ms. Remains 615 /615 variables (removed 0) and now considering 10406/10406 (removed 0) transitions.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-16 23:56:00] [INFO ] Invariants computation overflowed in 19 ms
[2023-03-16 23:56:01] [INFO ] Implicit Places using invariants in 869 ms returned []
Implicit Place search using SMT only with invariants took 870 ms to find 0 implicit places.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-16 23:56:01] [INFO ] Invariants computation overflowed in 12 ms
[2023-03-16 23:56:04] [INFO ] Dead Transitions using invariants and state equation in 2894 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3817 ms. Remains : 615/615 places, 10406/10406 transitions.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Railroad-PT-100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s169 1) (EQ s286 1) (EQ s569 1)), p1:(AND (EQ s134 1) (EQ s288 1) (EQ s569 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2177 ms.
Product exploration explored 100000 steps with 0 reset in 2331 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 284210 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{1=1}
Probabilistic random walk after 284210 steps, saw 274985 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-16 23:56:12] [INFO ] Invariants computation overflowed in 19 ms
[2023-03-16 23:56:19] [INFO ] After 6489ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:56:25] [INFO ] After 6103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:56:26] [INFO ] After 6500ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 216 ms.
[2023-03-16 23:56:26] [INFO ] After 6855ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 42 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 24 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 0 with 198 rules applied. Total rules applied 198 place count 516 transition count 10307
Applied a total of 198 rules in 5440 ms. Remains 516 /615 variables (removed 99) and now considering 10307/10406 (removed 99) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5440 ms. Remains : 516/615 places, 10307/10406 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 293537 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 293537 steps, saw 283231 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-16 23:56:35] [INFO ] Invariants computation overflowed in 19 ms
[2023-03-16 23:56:37] [INFO ] After 2380ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:56:39] [INFO ] After 2100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:56:40] [INFO ] After 2543ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 196 ms.
[2023-03-16 23:56:40] [INFO ] After 2848ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 249 steps, including 2 resets, run visited all 1 properties in 10 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
// Phase 1: matrix 10406 rows 615 cols
[2023-03-16 23:56:40] [INFO ] Invariants computation overflowed in 11 ms
[2023-03-16 23:56:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 23:56:47] [INFO ] [Real]Absence check using state equation in 2499 ms returned sat
[2023-03-16 23:56:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 23:56:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 23:56:55] [INFO ] [Nat]Absence check using state equation in 3797 ms returned sat
[2023-03-16 23:56:56] [INFO ] Deduced a trap composed of 3 places in 970 ms of which 1 ms to minimize.
[2023-03-16 23:56:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1406 ms
[2023-03-16 23:56:57] [INFO ] Computed and/alt/rep : 304/409/304 causal constraints (skipped 10002 transitions) in 978 ms.
[2023-03-16 23:57:03] [INFO ] Deduced a trap composed of 3 places in 1256 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 23:57:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 5 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Applied a total of 0 rules in 48 ms. Remains 615 /615 variables (removed 0) and now considering 10406/10406 (removed 0) transitions.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-16 23:57:03] [INFO ] Invariants computation overflowed in 18 ms
[2023-03-16 23:57:04] [INFO ] Implicit Places using invariants in 874 ms returned []
Implicit Place search using SMT only with invariants took 894 ms to find 0 implicit places.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-16 23:57:04] [INFO ] Invariants computation overflowed in 11 ms
[2023-03-16 23:57:07] [INFO ] Dead Transitions using invariants and state equation in 3077 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4034 ms. Remains : 615/615 places, 10406/10406 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 257672 steps, run timeout after 3089 ms. (steps per millisecond=83 ) properties seen :{1=1}
Probabilistic random walk after 257672 steps, saw 249340 distinct states, run finished after 3089 ms. (steps per millisecond=83 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-16 23:57:11] [INFO ] Invariants computation overflowed in 13 ms
[2023-03-16 23:57:18] [INFO ] After 6252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:57:24] [INFO ] After 5937ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:57:24] [INFO ] After 6324ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 199 ms.
[2023-03-16 23:57:24] [INFO ] After 6618ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 42 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 25 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 0 with 198 rules applied. Total rules applied 198 place count 516 transition count 10307
Applied a total of 198 rules in 5358 ms. Remains 516 /615 variables (removed 99) and now considering 10307/10406 (removed 99) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5358 ms. Remains : 516/615 places, 10307/10406 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 297266 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 297266 steps, saw 286826 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-16 23:57:33] [INFO ] Invariants computation overflowed in 18 ms
[2023-03-16 23:57:35] [INFO ] After 2257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:57:37] [INFO ] After 2079ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:57:38] [INFO ] After 2501ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 196 ms.
[2023-03-16 23:57:38] [INFO ] After 2787ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 257 steps, including 2 resets, run visited all 1 properties in 10 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 3 factoid took 195 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
// Phase 1: matrix 10406 rows 615 cols
[2023-03-16 23:57:39] [INFO ] Invariants computation overflowed in 18 ms
[2023-03-16 23:57:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 23:57:46] [INFO ] [Real]Absence check using state equation in 2770 ms returned sat
[2023-03-16 23:57:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 23:57:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 23:57:54] [INFO ] [Nat]Absence check using state equation in 4173 ms returned sat
[2023-03-16 23:57:56] [INFO ] Deduced a trap composed of 3 places in 1127 ms of which 1 ms to minimize.
[2023-03-16 23:57:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1615 ms
[2023-03-16 23:57:57] [INFO ] Computed and/alt/rep : 304/409/304 causal constraints (skipped 10002 transitions) in 1024 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 23:58:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 2159 ms.
Product exploration explored 100000 steps with 0 reset in 2232 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 5 out of 615 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 98 places in 27 ms
Iterating global reduction 0 with 98 rules applied. Total rules applied 98 place count 615 transition count 10406
Deduced a syphon composed of 98 places in 28 ms
Applied a total of 98 rules in 6264 ms. Remains 615 /615 variables (removed 0) and now considering 10406/10406 (removed 0) transitions.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-16 23:58:12] [INFO ] Invariants computation overflowed in 17 ms
[2023-03-16 23:58:15] [INFO ] Dead Transitions using invariants and state equation in 2939 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 615/615 places, 10406/10406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9209 ms. Remains : 615/615 places, 10406/10406 transitions.
Built C files in :
/tmp/ltsmin5630590776775578381
[2023-03-16 23:58:15] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5630590776775578381
Running compilation step : cd /tmp/ltsmin5630590776775578381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin5630590776775578381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin5630590776775578381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Applied a total of 0 rules in 54 ms. Remains 615 /615 variables (removed 0) and now considering 10406/10406 (removed 0) transitions.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-16 23:58:18] [INFO ] Invariants computation overflowed in 20 ms
[2023-03-16 23:58:19] [INFO ] Implicit Places using invariants in 877 ms returned []
Implicit Place search using SMT only with invariants took 877 ms to find 0 implicit places.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-16 23:58:19] [INFO ] Invariants computation overflowed in 14 ms
[2023-03-16 23:58:22] [INFO ] Dead Transitions using invariants and state equation in 2816 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3750 ms. Remains : 615/615 places, 10406/10406 transitions.
Built C files in :
/tmp/ltsmin4927275693599156046
[2023-03-16 23:58:22] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4927275693599156046
Running compilation step : cd /tmp/ltsmin4927275693599156046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin4927275693599156046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin4927275693599156046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-16 23:58:26] [INFO ] Flatten gal took : 385 ms
[2023-03-16 23:58:26] [INFO ] Flatten gal took : 359 ms
[2023-03-16 23:58:26] [INFO ] Time to serialize gal into /tmp/LTL13187138412266878010.gal : 49 ms
[2023-03-16 23:58:26] [INFO ] Time to serialize properties into /tmp/LTL6996068557364872218.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13187138412266878010.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17112654296718972115.hoa' '-atoms' '/tmp/LTL6996068557364872218.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL6996068557364872218.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17112654296718972115.hoa
Detected timeout of ITS tools.
[2023-03-16 23:58:42] [INFO ] Flatten gal took : 344 ms
[2023-03-16 23:58:42] [INFO ] Flatten gal took : 369 ms
[2023-03-16 23:58:42] [INFO ] Time to serialize gal into /tmp/LTL11808849282665974000.gal : 47 ms
[2023-03-16 23:58:42] [INFO ] Time to serialize properties into /tmp/LTL12782382837044419480.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11808849282665974000.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12782382837044419480.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((F("(((pl_P29_67==1)&&(pl_P304_8==1))&&(pl_P51_1==1))"))||(X(G("(((pl_P29_35==1)&&(pl_P304_81==1))&&(pl_P51_1==1))"))))))
Formula 0 simplified : F(G!"(((pl_P29_67==1)&&(pl_P304_8==1))&&(pl_P51_1==1))" & XF!"(((pl_P29_35==1)&&(pl_P304_81==1))&&(pl_P51_1==1))")
Detected timeout of ITS tools.
[2023-03-16 23:58:58] [INFO ] Flatten gal took : 365 ms
[2023-03-16 23:58:58] [INFO ] Applying decomposition
[2023-03-16 23:58:58] [INFO ] Flatten gal took : 356 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10477402171040236531.txt' '-o' '/tmp/graph10477402171040236531.bin' '-w' '/tmp/graph10477402171040236531.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10477402171040236531.bin' '-l' '-1' '-v' '-w' '/tmp/graph10477402171040236531.weights' '-q' '0' '-e' '0.001'
[2023-03-16 23:58:59] [INFO ] Decomposing Gal with order
[2023-03-16 23:58:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 23:58:59] [INFO ] Removed a total of 32743 redundant transitions.
[2023-03-16 23:58:59] [INFO ] Flatten gal took : 503 ms
[2023-03-16 23:59:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 235 labels/synchronizations in 265 ms.
[2023-03-16 23:59:00] [INFO ] Time to serialize gal into /tmp/LTL9452070469779066606.gal : 33 ms
[2023-03-16 23:59:00] [INFO ] Time to serialize properties into /tmp/LTL17666313369420938045.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9452070469779066606.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17666313369420938045.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((F("(((u65.pl_P29_67==1)&&(i37.i0.u105.pl_P304_8==1))&&(i39.i0.u97.pl_P51_1==1))"))||(X(G("(((u167.pl_P29_35==1)&&(i41.i1.u110.pl...202
Formula 0 simplified : F(G!"(((u65.pl_P29_67==1)&&(i37.i0.u105.pl_P304_8==1))&&(i39.i0.u97.pl_P51_1==1))" & XF!"(((u167.pl_P29_35==1)&&(i41.i1.u110.pl_P304...192
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7701204339693437192
[2023-03-16 23:59:15] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7701204339693437192
Running compilation step : cd /tmp/ltsmin7701204339693437192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7701204339693437192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7701204339693437192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Railroad-PT-100-LTLFireability-12 finished in 197900 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p2)||p1)))'
Support contains 9 out of 615 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 25 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 0 with 192 rules applied. Total rules applied 192 place count 519 transition count 10310
Applied a total of 192 rules in 6406 ms. Remains 519 /615 variables (removed 96) and now considering 10310/10406 (removed 96) transitions.
// Phase 1: matrix 10310 rows 519 cols
[2023-03-16 23:59:24] [INFO ] Invariants computation overflowed in 19 ms
[2023-03-16 23:59:25] [INFO ] Implicit Places using invariants in 819 ms returned []
Implicit Place search using SMT only with invariants took 820 ms to find 0 implicit places.
// Phase 1: matrix 10310 rows 519 cols
[2023-03-16 23:59:25] [INFO ] Invariants computation overflowed in 12 ms
[2023-03-16 23:59:28] [INFO ] Dead Transitions using invariants and state equation in 2753 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 519/615 places, 10310/10406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9982 ms. Remains : 519/615 places, 10310/10406 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : Railroad-PT-100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (EQ s141 1) (EQ s280 1) (EQ s494 1)) (AND (EQ s171 1) (EQ s243 1) (EQ s494 1)) (AND (EQ s178 1) (EQ s286 1) (EQ s494 1))), p2:(OR (NOT (AND (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 2065 steps with 0 reset in 63 ms.
FORMULA Railroad-PT-100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-100-LTLFireability-13 finished in 10206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Applied a total of 0 rules in 55 ms. Remains 615 /615 variables (removed 0) and now considering 10406/10406 (removed 0) transitions.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-16 23:59:28] [INFO ] Invariants computation overflowed in 17 ms
[2023-03-16 23:59:29] [INFO ] Implicit Places using invariants in 862 ms returned []
Implicit Place search using SMT only with invariants took 864 ms to find 0 implicit places.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-16 23:59:29] [INFO ] Invariants computation overflowed in 13 ms
[2023-03-16 23:59:32] [INFO ] Dead Transitions using invariants and state equation in 2947 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3867 ms. Remains : 615/615 places, 10406/10406 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s203 1) (EQ s286 1) (EQ s569 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2209 ms.
Product exploration explored 100000 steps with 0 reset in 2350 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 292583 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 292583 steps, saw 283091 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-16 23:59:40] [INFO ] Invariants computation overflowed in 21 ms
[2023-03-16 23:59:47] [INFO ] After 6394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:59:53] [INFO ] After 6185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:59:54] [INFO ] After 6594ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 215 ms.
[2023-03-16 23:59:54] [INFO ] After 6926ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 42 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 25 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 0 with 198 rules applied. Total rules applied 198 place count 516 transition count 10307
Applied a total of 198 rules in 5680 ms. Remains 516 /615 variables (removed 99) and now considering 10307/10406 (removed 99) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5680 ms. Remains : 516/615 places, 10307/10406 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 293212 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 293212 steps, saw 282954 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10307 rows 516 cols
[2023-03-17 00:00:03] [INFO ] Invariants computation overflowed in 15 ms
[2023-03-17 00:00:06] [INFO ] After 2690ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 00:00:08] [INFO ] After 2319ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 00:00:08] [INFO ] After 2701ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 194 ms.
[2023-03-17 00:00:09] [INFO ] After 2997ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 141 steps, including 2 resets, run visited all 1 properties in 7 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 10406 rows 615 cols
[2023-03-17 00:00:09] [INFO ] Invariants computation overflowed in 20 ms
[2023-03-17 00:00:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 00:00:15] [INFO ] [Real]Absence check using state equation in 2316 ms returned sat
[2023-03-17 00:00:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 00:00:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 00:00:24] [INFO ] [Nat]Absence check using state equation in 4475 ms returned sat
[2023-03-17 00:00:25] [INFO ] Deduced a trap composed of 7 places in 1063 ms of which 0 ms to minimize.
[2023-03-17 00:00:27] [INFO ] Deduced a trap composed of 3 places in 942 ms of which 0 ms to minimize.
[2023-03-17 00:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 3390 ms
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 2 factoid took 64 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Railroad-PT-100-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-100-LTLFireability-14 finished in 59354 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F((G(F(p1))||G(p0))))))'
Support contains 5 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Applied a total of 0 rules in 59 ms. Remains 615 /615 variables (removed 0) and now considering 10406/10406 (removed 0) transitions.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-17 00:00:28] [INFO ] Invariants computation overflowed in 18 ms
[2023-03-17 00:00:28] [INFO ] Implicit Places using invariants in 841 ms returned []
Implicit Place search using SMT only with invariants took 842 ms to find 0 implicit places.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-17 00:00:28] [INFO ] Invariants computation overflowed in 15 ms
[2023-03-17 00:00:31] [INFO ] Dead Transitions using invariants and state equation in 2885 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3787 ms. Remains : 615/615 places, 10406/10406 transitions.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Railroad-PT-100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(AND (EQ s137 1) (EQ s300 1) (EQ s569 1)), p1:(AND (EQ s176 1) (EQ s286 1) (EQ s569 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2440 ms.
Product exploration explored 100000 steps with 0 reset in 2638 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 241 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 186363 steps, run timeout after 3002 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 186363 steps, saw 180483 distinct states, run finished after 3004 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 10406 rows 615 cols
[2023-03-17 00:00:40] [INFO ] Invariants computation overflowed in 15 ms
[2023-03-17 00:00:41] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 00:00:47] [INFO ] After 6560ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 00:00:49] [INFO ] After 7929ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1083 ms.
[2023-03-17 00:00:50] [INFO ] After 9133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 292 steps, including 0 resets, run visited all 2 properties in 11 ms. (steps per millisecond=26 )
Parikh walk visited 2 properties in 11 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 278 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 720 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 10406 rows 615 cols
[2023-03-17 00:00:51] [INFO ] Invariants computation overflowed in 19 ms
[2023-03-17 00:00:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 00:00:58] [INFO ] [Real]Absence check using state equation in 2600 ms returned sat
[2023-03-17 00:00:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 00:01:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 00:01:05] [INFO ] [Nat]Absence check using state equation in 2589 ms returned sat
[2023-03-17 00:01:06] [INFO ] Deduced a trap composed of 6 places in 957 ms of which 0 ms to minimize.
[2023-03-17 00:01:07] [INFO ] Deduced a trap composed of 3 places in 743 ms of which 1 ms to minimize.
[2023-03-17 00:01:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 2270 ms
Proved EG (AND (NOT p0) (NOT p1))
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (G (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 6 factoid took 125 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Railroad-PT-100-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-100-LTLFireability-15 finished in 39826 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(G(p1)))))'
Found a Lengthening insensitive property : Railroad-PT-100-LTLFireability-12
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 5 out of 615 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 615/615 places, 10406/10406 transitions.
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 24 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 196 rules applied. Total rules applied 196 place count 517 transition count 10308
Applied a total of 196 rules in 169 ms. Remains 517 /615 variables (removed 98) and now considering 10308/10406 (removed 98) transitions.
// Phase 1: matrix 10308 rows 517 cols
[2023-03-17 00:01:08] [INFO ] Invariants computation overflowed in 16 ms
[2023-03-17 00:01:09] [INFO ] Implicit Places using invariants in 813 ms returned []
Implicit Place search using SMT only with invariants took 815 ms to find 0 implicit places.
// Phase 1: matrix 10308 rows 517 cols
[2023-03-17 00:01:09] [INFO ] Invariants computation overflowed in 18 ms
[2023-03-17 00:01:12] [INFO ] Dead Transitions using invariants and state equation in 2810 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 517/615 places, 10308/10406 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3797 ms. Remains : 517/615 places, 10308/10406 transitions.
Running random walk in product with property : Railroad-PT-100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s155 1) (EQ s271 1) (EQ s493 1)), p1:(AND (EQ s120 1) (EQ s273 1) (EQ s493 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2836 ms.
Stack based approach found an accepted trace after 31744 steps with 0 reset with depth 31745 and stack size 25312 in 929 ms.
Treatment of property Railroad-PT-100-LTLFireability-12 finished in 7798 ms.
FORMULA Railroad-PT-100-LTLFireability-12 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-17 00:01:16] [INFO ] Flatten gal took : 375 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9401482650674892634
[2023-03-17 00:01:16] [INFO ] Too many transitions (10406) to apply POR reductions. Disabling POR matrices.
[2023-03-17 00:01:16] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9401482650674892634
Running compilation step : cd /tmp/ltsmin9401482650674892634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-17 00:01:16] [INFO ] Applying decomposition
[2023-03-17 00:01:17] [INFO ] Flatten gal took : 376 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5437648585276331253.txt' '-o' '/tmp/graph5437648585276331253.bin' '-w' '/tmp/graph5437648585276331253.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5437648585276331253.bin' '-l' '-1' '-v' '-w' '/tmp/graph5437648585276331253.weights' '-q' '0' '-e' '0.001'
[2023-03-17 00:01:17] [INFO ] Decomposing Gal with order
[2023-03-17 00:01:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 00:01:18] [INFO ] Removed a total of 32943 redundant transitions.
[2023-03-17 00:01:18] [INFO ] Flatten gal took : 547 ms
[2023-03-17 00:01:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 219 labels/synchronizations in 276 ms.
[2023-03-17 00:01:19] [INFO ] Time to serialize gal into /tmp/LTLFireability13690366157087600782.gal : 30 ms
[2023-03-17 00:01:19] [INFO ] Time to serialize properties into /tmp/LTLFireability4256801160135698786.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13690366157087600782.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4256801160135698786.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((G(F("(((u201.pl_P29_92!=1)||(i42.i0.u85.pl_P304_21!=1))||(i41.i1.u89.pl_P51_1!=1))"))))
Formula 0 simplified : FG!"(((u201.pl_P29_92!=1)||(i42.i0.u85.pl_P304_21!=1))||(i41.i1.u89.pl_P51_1!=1))"
Compilation finished in 56783 ms.
Running link step : cd /tmp/ltsmin9401482650674892634;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 106 ms.
Running LTSmin : cd /tmp/ltsmin9401482650674892634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-17 00:25:59] [INFO ] Applying decomposition
[2023-03-17 00:26:02] [INFO ] Flatten gal took : 3023 ms
[2023-03-17 00:26:03] [INFO ] Decomposing Gal with order
[2023-03-17 00:26:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 00:26:16] [INFO ] Removed a total of 30391 redundant transitions.
[2023-03-17 00:26:19] [INFO ] Flatten gal took : 14023 ms
[2023-03-17 00:26:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 196 labels/synchronizations in 1096 ms.
[2023-03-17 00:26:21] [INFO ] Time to serialize gal into /tmp/LTLFireability14034070599113455481.gal : 30 ms
[2023-03-17 00:26:21] [INFO ] Time to serialize properties into /tmp/LTLFireability12529614817570574288.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14034070599113455481.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12529614817570574288.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !((G(F("(((u95.pl_P29_92!=1)||(u1.pl_P304_21!=1))||(u156.pl_P51_1!=1))"))))
Formula 0 simplified : FG!"(((u95.pl_P29_92!=1)||(u1.pl_P304_21!=1))||(u156.pl_P51_1!=1))"
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin9401482650674892634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9401482650674892634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp1==true)))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 216096 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16238308 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="Railroad-PT-100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Railroad-PT-100, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r325-tall-167889197100396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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