Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r186-tajo-165281572100316.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Railroad-PT-050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572100316
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 8.0K Apr 29 13:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 29 13:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 29 13:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 13:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.4M May 10 09:34 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-050-LTLFireability-00
FORMULA_NAME Railroad-PT-050-LTLFireability-01
FORMULA_NAME Railroad-PT-050-LTLFireability-02
FORMULA_NAME Railroad-PT-050-LTLFireability-03
FORMULA_NAME Railroad-PT-050-LTLFireability-04
FORMULA_NAME Railroad-PT-050-LTLFireability-05
FORMULA_NAME Railroad-PT-050-LTLFireability-06
FORMULA_NAME Railroad-PT-050-LTLFireability-07
FORMULA_NAME Railroad-PT-050-LTLFireability-08
FORMULA_NAME Railroad-PT-050-LTLFireability-09
FORMULA_NAME Railroad-PT-050-LTLFireability-10
FORMULA_NAME Railroad-PT-050-LTLFireability-11
FORMULA_NAME Railroad-PT-050-LTLFireability-12
FORMULA_NAME Railroad-PT-050-LTLFireability-13
FORMULA_NAME Railroad-PT-050-LTLFireability-14
FORMULA_NAME Railroad-PT-050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653082639959

Running Version 202205111006
[2022-05-20 21:37:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 21:37:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 21:37:21] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2022-05-20 21:37:21] [INFO ] Transformed 518 places.
[2022-05-20 21:37:21] [INFO ] Transformed 2756 transitions.
[2022-05-20 21:37:21] [INFO ] Found NUPN structural information;
[2022-05-20 21:37:21] [INFO ] Parsed PT model containing 518 places and 2756 transitions in 355 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 151 places in 21 ms
Reduce places removed 151 places and 50 transitions.
FORMULA Railroad-PT-050-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 2706/2706 transitions.
Ensure Unique test removed 51 places
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 316 transition count 2706
Applied a total of 51 rules in 68 ms. Remains 316 /367 variables (removed 51) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 316 cols
[2022-05-20 21:37:22] [INFO ] Invariants computation overflowed in 40 ms
[2022-05-20 21:37:22] [INFO ] Implicit Places using invariants in 499 ms returned []
// Phase 1: matrix 2706 rows 316 cols
[2022-05-20 21:37:22] [INFO ] Invariants computation overflowed in 12 ms
[2022-05-20 21:37:23] [INFO ] Implicit Places using invariants and state equation in 794 ms returned []
Implicit Place search using SMT with State Equation took 1324 ms to find 0 implicit places.
// Phase 1: matrix 2706 rows 316 cols
[2022-05-20 21:37:23] [INFO ] Invariants computation overflowed in 8 ms
[2022-05-20 21:37:24] [INFO ] Dead Transitions using invariants and state equation in 845 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 316/367 places, 2706/2706 transitions.
Finished structural reductions, in 1 iterations. Remains : 316/367 places, 2706/2706 transitions.
Support contains 50 out of 316 places after structural reductions.
[2022-05-20 21:37:25] [INFO ] Flatten gal took : 510 ms
[2022-05-20 21:37:25] [INFO ] Flatten gal took : 242 ms
[2022-05-20 21:37:25] [INFO ] Input system was already deterministic with 2706 transitions.
Support contains 42 out of 316 places (down from 50) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 810 ms. (steps per millisecond=12 ) properties (out of 28) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 2706 rows 316 cols
[2022-05-20 21:37:26] [INFO ] Invariants computation overflowed in 22 ms
[2022-05-20 21:37:29] [INFO ] After 2750ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:19
[2022-05-20 21:37:32] [INFO ] After 2444ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :19
[2022-05-20 21:37:35] [INFO ] After 5656ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :19
Attempting to minimize the solution found.
Minimization took 2285 ms.
[2022-05-20 21:37:37] [INFO ] After 8328ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :19
Fused 20 Parikh solutions to 19 different solutions.
Parikh walk visited 18 properties in 1122 ms.
Support contains 3 out of 316 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 316/316 places, 2706/2706 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 315 transition count 2706
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 1 with 98 rules applied. Total rules applied 99 place count 266 transition count 2657
Applied a total of 99 rules in 633 ms. Remains 266 /316 variables (removed 50) and now considering 2657/2706 (removed 49) transitions.
Finished structural reductions, in 1 iterations. Remains : 266/316 places, 2657/2706 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 592119 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :{}
Probabilistic random walk after 592119 steps, saw 489868 distinct states, run finished after 3002 ms. (steps per millisecond=197 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2657 rows 266 cols
[2022-05-20 21:37:42] [INFO ] Invariants computation overflowed in 18 ms
[2022-05-20 21:37:43] [INFO ] After 720ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 21:37:44] [INFO ] After 532ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 21:37:44] [INFO ] After 733ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 109 ms.
[2022-05-20 21:37:44] [INFO ] After 924ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 266 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 266/266 places, 2657/2657 transitions.
Applied a total of 0 rules in 619 ms. Remains 266 /266 variables (removed 0) and now considering 2657/2657 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 266/266 places, 2657/2657 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 266/266 places, 2657/2657 transitions.
Applied a total of 0 rules in 550 ms. Remains 266 /266 variables (removed 0) and now considering 2657/2657 (removed 0) transitions.
// Phase 1: matrix 2657 rows 266 cols
[2022-05-20 21:37:45] [INFO ] Invariants computation overflowed in 16 ms
[2022-05-20 21:37:45] [INFO ] Implicit Places using invariants in 337 ms returned []
// Phase 1: matrix 2657 rows 266 cols
[2022-05-20 21:37:45] [INFO ] Invariants computation overflowed in 5 ms
[2022-05-20 21:37:47] [INFO ] Implicit Places using invariants and state equation in 1346 ms returned [0, 1, 6, 7, 8, 11, 12, 16, 17, 18, 22, 23, 24, 27, 31, 133, 134, 136, 137, 138, 140, 141, 143, 147, 148, 149, 152, 153, 154, 156, 157, 159, 160, 162, 215, 217, 219, 225, 226, 227, 228, 231, 239, 240, 242, 244, 245, 246, 247, 248, 250, 256, 258, 261, 262]
Discarding 55 places :
Implicit Place search using SMT with State Equation took 1689 ms to find 55 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 211/266 places, 2657/2657 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 211 transition count 2655
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 209 transition count 2655
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 209 transition count 2653
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 207 transition count 2653
Applied a total of 8 rules in 484 ms. Remains 207 /211 variables (removed 4) and now considering 2653/2657 (removed 4) transitions.
// Phase 1: matrix 2653 rows 207 cols
[2022-05-20 21:37:47] [INFO ] Invariants computation overflowed in 12 ms
[2022-05-20 21:37:48] [INFO ] Implicit Places using invariants in 209 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2022-05-20 21:37:48] [INFO ] Invariants computation overflowed in 5 ms
[2022-05-20 21:37:48] [INFO ] Implicit Places using invariants and state equation in 855 ms returned []
Implicit Place search using SMT with State Equation took 1067 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 207/266 places, 2653/2657 transitions.
Finished structural reductions, in 2 iterations. Remains : 207/266 places, 2653/2657 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 970590 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :{}
Probabilistic random walk after 970590 steps, saw 798359 distinct states, run finished after 3002 ms. (steps per millisecond=323 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2653 rows 207 cols
[2022-05-20 21:37:52] [INFO ] Invariants computation overflowed in 8 ms
[2022-05-20 21:37:52] [INFO ] After 568ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 21:37:53] [INFO ] After 481ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 21:37:53] [INFO ] After 680ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 120 ms.
[2022-05-20 21:37:53] [INFO ] After 867ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 101 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=33 )
Parikh walk visited 1 properties in 3 ms.
FORMULA Railroad-PT-050-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 316/316 places, 2706/2706 transitions.
Ensure Unique test removed 1 places
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 4 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 265 transition count 2656
Applied a total of 100 rules in 1097 ms. Remains 265 /316 variables (removed 51) and now considering 2656/2706 (removed 50) transitions.
// Phase 1: matrix 2656 rows 265 cols
[2022-05-20 21:37:55] [INFO ] Invariants computation overflowed in 13 ms
[2022-05-20 21:37:55] [INFO ] Implicit Places using invariants in 408 ms returned []
// Phase 1: matrix 2656 rows 265 cols
[2022-05-20 21:37:55] [INFO ] Invariants computation overflowed in 6 ms
[2022-05-20 21:37:57] [INFO ] Implicit Places using invariants and state equation in 1810 ms returned [0, 1, 6, 7, 8, 11, 12, 16, 17, 18, 22, 23, 24, 27, 31, 133, 134, 136, 137, 138, 140, 141, 143, 147, 148, 149, 152, 153, 154, 156, 157, 159, 160, 162, 215, 217, 219, 225, 226, 227, 228, 231, 239, 240, 242, 244, 245, 246, 247, 248, 250, 255, 257, 260, 261]
Discarding 55 places :
Implicit Place search using SMT with State Equation took 2224 ms to find 55 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 210/316 places, 2656/2706 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 210 transition count 2653
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 207 transition count 2653
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 207 transition count 2652
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 206 transition count 2652
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 205 transition count 2651
Applied a total of 10 rules in 512 ms. Remains 205 /210 variables (removed 5) and now considering 2651/2656 (removed 5) transitions.
// Phase 1: matrix 2651 rows 205 cols
[2022-05-20 21:37:57] [INFO ] Invariants computation overflowed in 10 ms
[2022-05-20 21:37:58] [INFO ] Implicit Places using invariants in 328 ms returned []
// Phase 1: matrix 2651 rows 205 cols
[2022-05-20 21:37:58] [INFO ] Invariants computation overflowed in 6 ms
[2022-05-20 21:37:59] [INFO ] Implicit Places using invariants and state equation in 1328 ms returned []
Implicit Place search using SMT with State Equation took 1662 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 205/316 places, 2651/2706 transitions.
Finished structural reductions, in 2 iterations. Remains : 205/316 places, 2651/2706 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-050-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 s9 1) (NEQ s198 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 939 reset in 1029 ms.
Product exploration explored 100000 steps with 987 reset in 928 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 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 2651/2651 transitions.
Applied a total of 0 rules in 479 ms. Remains 205 /205 variables (removed 0) and now considering 2651/2651 (removed 0) transitions.
// Phase 1: matrix 2651 rows 205 cols
[2022-05-20 21:38:02] [INFO ] Invariants computation overflowed in 10 ms
[2022-05-20 21:38:02] [INFO ] Implicit Places using invariants in 339 ms returned []
// Phase 1: matrix 2651 rows 205 cols
[2022-05-20 21:38:02] [INFO ] Invariants computation overflowed in 8 ms
[2022-05-20 21:38:03] [INFO ] Implicit Places using invariants and state equation in 925 ms returned []
Implicit Place search using SMT with State Equation took 1285 ms to find 0 implicit places.
[2022-05-20 21:38:04] [INFO ] Redundant transitions in 186 ms returned []
// Phase 1: matrix 2651 rows 205 cols
[2022-05-20 21:38:04] [INFO ] Invariants computation overflowed in 10 ms
[2022-05-20 21:38:04] [INFO ] Dead Transitions using invariants and state equation in 908 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 2651/2651 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 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Finished random walk after 37 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 943 reset in 901 ms.
Product exploration explored 100000 steps with 974 reset in 792 ms.
Built C files in :
/tmp/ltsmin17187953489425609353
[2022-05-20 21:38:07] [INFO ] Too many transitions (2651) to apply POR reductions. Disabling POR matrices.
[2022-05-20 21:38:07] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17187953489425609353
Running compilation step : cd /tmp/ltsmin17187953489425609353;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17187953489425609353;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17187953489425609353;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 2651/2651 transitions.
Applied a total of 0 rules in 496 ms. Remains 205 /205 variables (removed 0) and now considering 2651/2651 (removed 0) transitions.
// Phase 1: matrix 2651 rows 205 cols
[2022-05-20 21:38:10] [INFO ] Invariants computation overflowed in 11 ms
[2022-05-20 21:38:11] [INFO ] Implicit Places using invariants in 457 ms returned []
// Phase 1: matrix 2651 rows 205 cols
[2022-05-20 21:38:11] [INFO ] Invariants computation overflowed in 10 ms
[2022-05-20 21:38:12] [INFO ] Implicit Places using invariants and state equation in 996 ms returned []
Implicit Place search using SMT with State Equation took 1470 ms to find 0 implicit places.
[2022-05-20 21:38:12] [INFO ] Redundant transitions in 254 ms returned []
// Phase 1: matrix 2651 rows 205 cols
[2022-05-20 21:38:12] [INFO ] Invariants computation overflowed in 10 ms
[2022-05-20 21:38:13] [INFO ] Dead Transitions using invariants and state equation in 953 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 2651/2651 transitions.
Built C files in :
/tmp/ltsmin16364780963220971904
[2022-05-20 21:38:13] [INFO ] Too many transitions (2651) to apply POR reductions. Disabling POR matrices.
[2022-05-20 21:38:13] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16364780963220971904
Running compilation step : cd /tmp/ltsmin16364780963220971904;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16364780963220971904;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16364780963220971904;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 21:38:17] [INFO ] Flatten gal took : 170 ms
[2022-05-20 21:38:17] [INFO ] Flatten gal took : 172 ms
[2022-05-20 21:38:17] [INFO ] Time to serialize gal into /tmp/LTL8053243611445690433.gal : 44 ms
[2022-05-20 21:38:17] [INFO ] Time to serialize properties into /tmp/LTL433125366186573420.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8053243611445690433.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL433125366186573420.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8053243...265
Read 1 LTL properties
Checking formula 0 : !((G(F("((pl_P146_1==0)||(pl_P69_1==0))"))))
Formula 0 simplified : !GF"((pl_P146_1==0)||(pl_P69_1==0))"
Detected timeout of ITS tools.
[2022-05-20 21:38:32] [INFO ] Flatten gal took : 179 ms
[2022-05-20 21:38:32] [INFO ] Applying decomposition
[2022-05-20 21:38:32] [INFO ] Flatten gal took : 166 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17549296095019920611.txt' '-o' '/tmp/graph17549296095019920611.bin' '-w' '/tmp/graph17549296095019920611.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17549296095019920611.bin' '-l' '-1' '-v' '-w' '/tmp/graph17549296095019920611.weights' '-q' '0' '-e' '0.001'
[2022-05-20 21:38:33] [INFO ] Decomposing Gal with order
[2022-05-20 21:38:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 21:38:33] [INFO ] Removed a total of 8271 redundant transitions.
[2022-05-20 21:38:33] [INFO ] Flatten gal took : 415 ms
[2022-05-20 21:38:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 111 ms.
[2022-05-20 21:38:33] [INFO ] Time to serialize gal into /tmp/LTL3279523402988968628.gal : 18 ms
[2022-05-20 21:38:33] [INFO ] Time to serialize properties into /tmp/LTL6973132955409923418.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3279523402988968628.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6973132955409923418.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3279523...245
Read 1 LTL properties
Checking formula 0 : !((G(F("((i53.u71.pl_P146_1==0)||(u65.pl_P69_1==0))"))))
Formula 0 simplified : !GF"((i53.u71.pl_P146_1==0)||(u65.pl_P69_1==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6044157550505500399
[2022-05-20 21:38:49] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6044157550505500399
Running compilation step : cd /tmp/ltsmin6044157550505500399;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6044157550505500399;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6044157550505500399;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Railroad-PT-050-LTLFireability-00 finished in 58161 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(((!p0 U G(p1))||p2)))||G(X(p3))))'
Support contains 7 out of 316 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 2706/2706 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 315 transition count 2706
Applied a total of 1 rules in 27 ms. Remains 315 /316 variables (removed 1) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 315 cols
[2022-05-20 21:38:52] [INFO ] Invariants computation overflowed in 8 ms
[2022-05-20 21:38:52] [INFO ] Implicit Places using invariants in 548 ms returned []
// Phase 1: matrix 2706 rows 315 cols
[2022-05-20 21:38:52] [INFO ] Invariants computation overflowed in 5 ms
[2022-05-20 21:38:54] [INFO ] Implicit Places using invariants and state equation in 1406 ms returned [0, 1, 6, 7, 8, 11, 12, 17, 18, 19, 24, 25, 26, 29, 35, 137, 138, 144, 145, 146, 148, 149, 151, 156, 157, 159, 163, 164, 165, 167, 168, 170, 172, 175, 228, 231, 235, 245, 246, 247, 248, 252, 265, 269, 271, 273, 275, 277, 278, 279, 281, 291, 294, 301, 302]
Discarding 55 places :
Implicit Place search using SMT with State Equation took 1960 ms to find 55 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 260/316 places, 2706/2706 transitions.
Applied a total of 0 rules in 9 ms. Remains 260 /260 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 260/316 places, 2706/2706 transitions.
Stuttering acceptance computed with spot in 361 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : Railroad-PT-050-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 p3), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 p0 (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p0 p3), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p2) (NOT p0) p3), acceptance={} source=1 dest: 7}, { cond=(AND (NOT p2) p1 p0 p3), acceptance={} source=1 dest: 8}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 2}, { cond=p3, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=7 dest: 2}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) p3), acceptance={} source=7 dest: 7}, { cond=(AND p1 p0 p3), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=8 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p1) p3), acceptance={} source=8 dest: 6}, { cond=(AND p1 p3), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(AND (EQ s66 1) (EQ s96 1) (EQ s214 1) (EQ s66 1) (EQ s99 1) (EQ s214 1)), p3:(AND (EQ s51 1) (EQ s107 1) (EQ s214 1)), p1:(AND (EQ s45 1) (EQ s107 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 708 ms.
Product exploration explored 100000 steps with 0 reset in 933 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 p2) (NOT p3) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0 p3))), (X (NOT (AND (NOT p2) (NOT p0) p3))), (X (AND (NOT p2) (NOT p0) (NOT p3))), (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3)))), (X (NOT (AND (NOT p2) p1 p0 (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p2) p1 p0 p3))), (X (NOT (AND p2 p3))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) p3)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 p0 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT (AND p1 p0 p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 p3)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0 p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 38 factoid took 1906 ms. Reduced automaton from 9 states, 32 edges and 4 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2706 rows 260 cols
[2022-05-20 21:38:58] [INFO ] Invariants computation overflowed in 5 ms
[2022-05-20 21:38:58] [INFO ] After 549ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-20 21:38:59] [INFO ] After 535ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-20 21:38:59] [INFO ] After 657ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 76 ms.
[2022-05-20 21:38:59] [INFO ] After 831ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 109 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=36 )
Parikh walk visited 1 properties in 3 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0 p3))), (X (NOT (AND (NOT p2) (NOT p0) p3))), (X (AND (NOT p2) (NOT p0) (NOT p3))), (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3)))), (X (NOT (AND (NOT p2) p1 p0 (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p2) p1 p0 p3))), (X (NOT (AND p2 p3))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) p3)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 p0 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT (AND p1 p0 p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 p3)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0 p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (AND (NOT p2) (NOT p0)))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0))), (F p1), (F (AND (NOT p1) p0))]
Knowledge based reduction with 39 factoid took 1068 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[(OR (NOT p1) p0), true, (OR (NOT p1) p0)]
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p1) p0), true, (OR (NOT p1) p0)]
// Phase 1: matrix 2706 rows 260 cols
[2022-05-20 21:39:01] [INFO ] Invariants computation overflowed in 5 ms
[2022-05-20 21:39:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:39:02] [INFO ] [Real]Absence check using state equation in 736 ms returned sat
[2022-05-20 21:39:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 21:39:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 21:39:04] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2022-05-20 21:39:04] [INFO ] Deduced a trap composed of 3 places in 305 ms of which 2 ms to minimize.
[2022-05-20 21:39:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 352 ms
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0 p3))), (X (NOT (AND (NOT p2) (NOT p0) p3))), (X (AND (NOT p2) (NOT p0) (NOT p3))), (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3)))), (X (NOT (AND (NOT p2) p1 p0 (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p2) p1 p0 p3))), (X (NOT (AND p2 p3))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) p3)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 p0 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT (AND p1 p0 p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 p3)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0 p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (AND (NOT p2) (NOT p0)))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0))), (F p1), (F (AND (NOT p1) p0)), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 39 factoid took 505 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA Railroad-PT-050-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-050-LTLFireability-01 finished in 12851 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||(p1 U p2)))'
Support contains 7 out of 316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 316/316 places, 2706/2706 transitions.
Ensure Unique test removed 1 places
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 4 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 0 with 94 rules applied. Total rules applied 94 place count 268 transition count 2659
Applied a total of 94 rules in 686 ms. Remains 268 /316 variables (removed 48) and now considering 2659/2706 (removed 47) transitions.
// Phase 1: matrix 2659 rows 268 cols
[2022-05-20 21:39:05] [INFO ] Invariants computation overflowed in 12 ms
[2022-05-20 21:39:05] [INFO ] Implicit Places using invariants in 295 ms returned []
// Phase 1: matrix 2659 rows 268 cols
[2022-05-20 21:39:05] [INFO ] Invariants computation overflowed in 14 ms
[2022-05-20 21:39:07] [INFO ] Implicit Places using invariants and state equation in 1482 ms returned [0, 1, 6, 7, 8, 11, 12, 16, 17, 18, 22, 23, 24, 27, 31, 133, 134, 136, 140, 141, 143, 147, 148, 149, 152, 153, 154, 156, 157, 159, 160, 162]
Discarding 32 places :
Implicit Place search using SMT with State Equation took 1797 ms to find 32 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 236/316 places, 2659/2706 transitions.
Applied a total of 0 rules in 544 ms. Remains 236 /236 variables (removed 0) and now considering 2659/2659 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 236/316 places, 2659/2706 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : Railroad-PT-050-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s48 1) (EQ s92 1) (EQ s204 1)), p1:(AND (EQ s43 1) (EQ s97 1) (EQ s204 1)), p0:(AND (EQ s56 1) (EQ s87 1) (EQ s204 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1219 ms.
Stack based approach found an accepted trace after 38 steps with 0 reset with depth 39 and stack size 39 in 1 ms.
FORMULA Railroad-PT-050-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-050-LTLFireability-02 finished in 4384 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(F(((p1 U G(p2))||!p3))))))'
Support contains 5 out of 316 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 2706/2706 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 315 transition count 2706
Applied a total of 1 rules in 19 ms. Remains 315 /316 variables (removed 1) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 315 cols
[2022-05-20 21:39:09] [INFO ] Invariants computation overflowed in 10 ms
[2022-05-20 21:39:09] [INFO ] Implicit Places using invariants in 382 ms returned []
// Phase 1: matrix 2706 rows 315 cols
[2022-05-20 21:39:09] [INFO ] Invariants computation overflowed in 6 ms
[2022-05-20 21:39:11] [INFO ] Implicit Places using invariants and state equation in 1367 ms returned [0, 1, 6, 7, 8, 11, 12, 17, 18, 19, 24, 25, 26, 29, 35, 137, 138, 144, 145, 146, 148, 149, 151, 156, 157, 159, 163, 164, 165, 167, 168, 170, 172, 175, 228, 231, 235, 245, 246, 247, 248, 252, 265, 269, 271, 273, 275, 277, 278, 279, 281, 291, 294, 301, 302]
Discarding 55 places :
Implicit Place search using SMT with State Equation took 1757 ms to find 55 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 260/316 places, 2706/2706 transitions.
Applied a total of 0 rules in 7 ms. Remains 260 /260 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 260/316 places, 2706/2706 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND p3 (NOT p2)), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Running random walk in product with property : Railroad-PT-050-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p3 p2), acceptance={} source=2 dest: 2}, { cond=(AND p3 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p3:(AND (EQ s26 1) (EQ s116 1) (EQ s214 1)), p2:(AND (EQ s55 1) (EQ s103 1) (EQ s214 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 633 ms.
Product exploration explored 100000 steps with 33333 reset in 543 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 p3) (NOT p2)), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND p3 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p3) (NOT p2))
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Railroad-PT-050-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-050-LTLFireability-03 finished in 3254 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0) U X(p1)))||F(p0)))'
Support contains 5 out of 316 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 2706/2706 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 315 transition count 2706
Applied a total of 1 rules in 10 ms. Remains 315 /316 variables (removed 1) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 315 cols
[2022-05-20 21:39:12] [INFO ] Invariants computation overflowed in 7 ms
[2022-05-20 21:39:12] [INFO ] Implicit Places using invariants in 260 ms returned []
// Phase 1: matrix 2706 rows 315 cols
[2022-05-20 21:39:12] [INFO ] Invariants computation overflowed in 5 ms
[2022-05-20 21:39:14] [INFO ] Implicit Places using invariants and state equation in 1188 ms returned [0, 1, 6, 7, 8, 11, 12, 17, 18, 19, 24, 25, 26, 29, 35, 137, 138, 144, 145, 146, 148, 149, 151, 156, 157, 159, 163, 164, 165, 167, 168, 170, 172, 175, 228, 231, 235, 245, 246, 247, 248, 252, 265, 269, 271, 273, 275, 277, 278, 279, 281, 291, 294, 301, 302]
Discarding 55 places :
Implicit Place search using SMT with State Equation took 1458 ms to find 55 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 260/316 places, 2706/2706 transitions.
Applied a total of 0 rules in 13 ms. Remains 260 /260 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 260/316 places, 2706/2706 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Railroad-PT-050-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s60 1) (EQ s111 1) (EQ s214 1)), p1:(AND (EQ s66 1) (EQ s95 1) (EQ s214 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 856 ms.
Product exploration explored 100000 steps with 0 reset in 697 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 (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 288 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 542933 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :{}
Probabilistic random walk after 542933 steps, saw 475459 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2706 rows 260 cols
[2022-05-20 21:39:19] [INFO ] Invariants computation overflowed in 9 ms
[2022-05-20 21:39:19] [INFO ] After 565ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 21:39:20] [INFO ] After 607ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 21:39:20] [INFO ] After 742ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2022-05-20 21:39:20] [INFO ] After 925ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 101 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=33 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 6 factoid took 279 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
// Phase 1: matrix 2706 rows 260 cols
[2022-05-20 21:39:21] [INFO ] Invariants computation overflowed in 6 ms
[2022-05-20 21:39:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:39:22] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2022-05-20 21:39:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 21:39:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 21:39:23] [INFO ] [Nat]Absence check using state equation in 417 ms returned sat
[2022-05-20 21:39:23] [INFO ] Deduced a trap composed of 3 places in 210 ms of which 0 ms to minimize.
[2022-05-20 21:39:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 251 ms
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (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 6 factoid took 66 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA Railroad-PT-050-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-050-LTLFireability-05 finished in 11407 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U p0)&&!(X(p0) U F(p1)))))'
Support contains 5 out of 316 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 2706/2706 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 315 transition count 2706
Applied a total of 1 rules in 8 ms. Remains 315 /316 variables (removed 1) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 315 cols
[2022-05-20 21:39:23] [INFO ] Invariants computation overflowed in 8 ms
[2022-05-20 21:39:24] [INFO ] Implicit Places using invariants in 283 ms returned []
// Phase 1: matrix 2706 rows 315 cols
[2022-05-20 21:39:24] [INFO ] Invariants computation overflowed in 4 ms
[2022-05-20 21:39:25] [INFO ] Implicit Places using invariants and state equation in 1384 ms returned [0, 1, 6, 7, 8, 11, 12, 17, 18, 19, 24, 25, 26, 29, 35, 137, 138, 144, 145, 146, 148, 149, 151, 156, 157, 159, 163, 164, 165, 167, 168, 170, 172, 175, 228, 231, 235, 245, 246, 247, 248, 252, 265, 269, 271, 273, 275, 277, 278, 279, 281, 291, 294, 301, 302]
Discarding 55 places :
Implicit Place search using SMT with State Equation took 1682 ms to find 55 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 260/316 places, 2706/2706 transitions.
Applied a total of 0 rules in 9 ms. Remains 260 /260 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 260/316 places, 2706/2706 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Running random walk in product with property : Railroad-PT-050-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (EQ s32 1) (EQ s112 1) (EQ s214 1)), p0:(AND (EQ s52 1) (EQ s77 1) (EQ s214 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Railroad-PT-050-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-050-LTLFireability-07 finished in 1836 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(G(F(X(F((G(p0)||p1))))))))'
Support contains 5 out of 316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 316/316 places, 2706/2706 transitions.
Ensure Unique test removed 1 places
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 4 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 96 place count 267 transition count 2658
Applied a total of 96 rules in 816 ms. Remains 267 /316 variables (removed 49) and now considering 2658/2706 (removed 48) transitions.
// Phase 1: matrix 2658 rows 267 cols
[2022-05-20 21:39:26] [INFO ] Invariants computation overflowed in 6 ms
[2022-05-20 21:39:26] [INFO ] Implicit Places using invariants in 357 ms returned []
// Phase 1: matrix 2658 rows 267 cols
[2022-05-20 21:39:27] [INFO ] Invariants computation overflowed in 7 ms
[2022-05-20 21:39:27] [INFO ] Implicit Places using invariants and state equation in 710 ms returned []
Implicit Place search using SMT with State Equation took 1072 ms to find 0 implicit places.
[2022-05-20 21:39:27] [INFO ] Redundant transitions in 71 ms returned []
// Phase 1: matrix 2658 rows 267 cols
[2022-05-20 21:39:27] [INFO ] Invariants computation overflowed in 6 ms
[2022-05-20 21:39:28] [INFO ] Dead Transitions using invariants and state equation in 786 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 267/316 places, 2658/2706 transitions.
Finished structural reductions, in 1 iterations. Remains : 267/316 places, 2658/2706 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Railroad-PT-050-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s47 0) (EQ s96 0) (EQ s235 0)), p1:(AND (EQ s49 1) (EQ s120 1) (EQ s235 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 32 reset in 965 ms.
Product exploration explored 100000 steps with 46 reset in 930 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 214 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1341 steps, including 0 resets, run visited all 2 properties in 29 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 196 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 2658/2658 transitions.
Applied a total of 0 rules in 587 ms. Remains 267 /267 variables (removed 0) and now considering 2658/2658 (removed 0) transitions.
// Phase 1: matrix 2658 rows 267 cols
[2022-05-20 21:39:31] [INFO ] Invariants computation overflowed in 9 ms
[2022-05-20 21:39:32] [INFO ] Implicit Places using invariants in 305 ms returned []
// Phase 1: matrix 2658 rows 267 cols
[2022-05-20 21:39:32] [INFO ] Invariants computation overflowed in 5 ms
[2022-05-20 21:39:33] [INFO ] Implicit Places using invariants and state equation in 1762 ms returned [0, 1, 6, 7, 8, 11, 12, 16, 17, 18, 22, 23, 24, 27, 31, 133, 134, 136, 137, 138, 140, 141, 143, 147, 148, 150, 153, 154, 155, 157, 158, 160, 161, 163, 216, 218, 220, 226, 227, 228, 229, 232, 240, 241, 243, 245, 246, 247, 248, 249, 251, 257, 259, 262, 263]
Discarding 55 places :
Implicit Place search using SMT with State Equation took 2073 ms to find 55 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 212/267 places, 2658/2658 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 212 transition count 2656
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 210 transition count 2656
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 210 transition count 2654
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 208 transition count 2654
Applied a total of 8 rules in 559 ms. Remains 208 /212 variables (removed 4) and now considering 2654/2658 (removed 4) transitions.
// Phase 1: matrix 2654 rows 208 cols
[2022-05-20 21:39:34] [INFO ] Invariants computation overflowed in 11 ms
[2022-05-20 21:39:34] [INFO ] Implicit Places using invariants in 285 ms returned []
// Phase 1: matrix 2654 rows 208 cols
[2022-05-20 21:39:34] [INFO ] Invariants computation overflowed in 10 ms
[2022-05-20 21:39:35] [INFO ] Implicit Places using invariants and state equation in 828 ms returned []
Implicit Place search using SMT with State Equation took 1141 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 208/267 places, 2654/2658 transitions.
Finished structural reductions, in 2 iterations. Remains : 208/267 places, 2654/2658 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 152 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 89 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 205 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 39 reset in 882 ms.
Product exploration explored 100000 steps with 37 reset in 779 ms.
Built C files in :
/tmp/ltsmin14680647508188824334
[2022-05-20 21:39:37] [INFO ] Too many transitions (2654) to apply POR reductions. Disabling POR matrices.
[2022-05-20 21:39:37] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14680647508188824334
Running compilation step : cd /tmp/ltsmin14680647508188824334;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14680647508188824334;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14680647508188824334;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 2654/2654 transitions.
Applied a total of 0 rules in 430 ms. Remains 208 /208 variables (removed 0) and now considering 2654/2654 (removed 0) transitions.
// Phase 1: matrix 2654 rows 208 cols
[2022-05-20 21:39:41] [INFO ] Invariants computation overflowed in 3 ms
[2022-05-20 21:39:43] [INFO ] Implicit Places using invariants in 2384 ms returned []
// Phase 1: matrix 2654 rows 208 cols
[2022-05-20 21:39:43] [INFO ] Invariants computation overflowed in 4 ms
[2022-05-20 21:39:45] [INFO ] Implicit Places using invariants and state equation in 1449 ms returned []
Implicit Place search using SMT with State Equation took 3836 ms to find 0 implicit places.
[2022-05-20 21:39:45] [INFO ] Redundant transitions in 47 ms returned []
// Phase 1: matrix 2654 rows 208 cols
[2022-05-20 21:39:45] [INFO ] Invariants computation overflowed in 4 ms
[2022-05-20 21:39:45] [INFO ] Dead Transitions using invariants and state equation in 668 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 208/208 places, 2654/2654 transitions.
Built C files in :
/tmp/ltsmin13648264351842027629
[2022-05-20 21:39:45] [INFO ] Too many transitions (2654) to apply POR reductions. Disabling POR matrices.
[2022-05-20 21:39:46] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13648264351842027629
Running compilation step : cd /tmp/ltsmin13648264351842027629;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13648264351842027629;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13648264351842027629;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 21:39:49] [INFO ] Flatten gal took : 173 ms
[2022-05-20 21:39:49] [INFO ] Flatten gal took : 229 ms
[2022-05-20 21:39:49] [INFO ] Time to serialize gal into /tmp/LTL11788588445110999659.gal : 35 ms
[2022-05-20 21:39:49] [INFO ] Time to serialize properties into /tmp/LTL2924823732171015898.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11788588445110999659.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2924823732171015898.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1178858...267
Read 1 LTL properties
Checking formula 0 : !((X(G(G(F(X(F((G("(((pl_P168_23==0)||(pl_P16_21==0))||(pl_P30_1==0))"))||("(((pl_P168_25==1)&&(pl_P16_43==1))&&(pl_P30_1==1))")))))))...157
Formula 0 simplified : !XGFXF("(((pl_P168_25==1)&&(pl_P16_43==1))&&(pl_P30_1==1))" | G"(((pl_P168_23==0)||(pl_P16_21==0))||(pl_P30_1==0))")
Detected timeout of ITS tools.
[2022-05-20 21:40:04] [INFO ] Flatten gal took : 93 ms
[2022-05-20 21:40:04] [INFO ] Applying decomposition
[2022-05-20 21:40:04] [INFO ] Flatten gal took : 95 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13588949503246219167.txt' '-o' '/tmp/graph13588949503246219167.bin' '-w' '/tmp/graph13588949503246219167.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13588949503246219167.bin' '-l' '-1' '-v' '-w' '/tmp/graph13588949503246219167.weights' '-q' '0' '-e' '0.001'
[2022-05-20 21:40:04] [INFO ] Decomposing Gal with order
[2022-05-20 21:40:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 21:40:05] [INFO ] Removed a total of 8122 redundant transitions.
[2022-05-20 21:40:05] [INFO ] Flatten gal took : 259 ms
[2022-05-20 21:40:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 146 labels/synchronizations in 67 ms.
[2022-05-20 21:40:05] [INFO ] Time to serialize gal into /tmp/LTL14761591817615302366.gal : 24 ms
[2022-05-20 21:40:05] [INFO ] Time to serialize properties into /tmp/LTL136142844915275301.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14761591817615302366.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL136142844915275301.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1476159...245
Read 1 LTL properties
Checking formula 0 : !((X(G(G(F(X(F((G("(((i3.u8.pl_P168_23==0)||(u48.pl_P16_21==0))||(i2.i1.u6.pl_P30_1==0))"))||("(((i3.u8.pl_P168_25==1)&&(u35.pl_P16_43...195
Formula 0 simplified : !XGFXF("(((i3.u8.pl_P168_25==1)&&(u35.pl_P16_43==1))&&(i2.i1.u6.pl_P30_1==1))" | G"(((i3.u8.pl_P168_23==0)||(u48.pl_P16_21==0))||(i2...177
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12746884637438452282
[2022-05-20 21:40:20] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12746884637438452282
Running compilation step : cd /tmp/ltsmin12746884637438452282;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12746884637438452282;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12746884637438452282;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Railroad-PT-050-LTLFireability-08 finished in 57809 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 316 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 2706/2706 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 315 transition count 2706
Applied a total of 1 rules in 9 ms. Remains 315 /316 variables (removed 1) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 315 cols
[2022-05-20 21:40:23] [INFO ] Invariants computation overflowed in 3 ms
[2022-05-20 21:40:23] [INFO ] Implicit Places using invariants in 277 ms returned []
// Phase 1: matrix 2706 rows 315 cols
[2022-05-20 21:40:23] [INFO ] Invariants computation overflowed in 4 ms
[2022-05-20 21:40:25] [INFO ] Implicit Places using invariants and state equation in 1375 ms returned [0, 1, 6, 7, 8, 11, 12, 17, 18, 19, 24, 25, 26, 29, 35, 137, 138, 144, 145, 146, 148, 149, 151, 156, 157, 159, 163, 164, 165, 167, 168, 170, 172, 175, 228, 231, 235, 245, 246, 247, 248, 252, 265, 269, 271, 273, 275, 277, 278, 279, 281, 291, 294, 301, 302]
Discarding 55 places :
Implicit Place search using SMT with State Equation took 1670 ms to find 55 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 260/316 places, 2706/2706 transitions.
Applied a total of 0 rules in 18 ms. Remains 260 /260 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 260/316 places, 2706/2706 transitions.
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-050-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s60 1) (EQ s100 1) (EQ s214 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Railroad-PT-050-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-050-LTLFireability-10 finished in 1784 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 5 out of 316 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 2706/2706 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 315 transition count 2706
Applied a total of 1 rules in 14 ms. Remains 315 /316 variables (removed 1) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 315 cols
[2022-05-20 21:40:25] [INFO ] Invariants computation overflowed in 16 ms
[2022-05-20 21:40:25] [INFO ] Implicit Places using invariants in 270 ms returned []
// Phase 1: matrix 2706 rows 315 cols
[2022-05-20 21:40:25] [INFO ] Invariants computation overflowed in 3 ms
[2022-05-20 21:40:27] [INFO ] Implicit Places using invariants and state equation in 1371 ms returned [0, 1, 6, 7, 8, 11, 12, 17, 18, 19, 24, 25, 26, 29, 35, 137, 138, 144, 145, 146, 148, 149, 151, 156, 157, 159, 163, 164, 165, 167, 168, 170, 172, 175, 228, 231, 235, 245, 246, 247, 248, 252, 265, 269, 271, 273, 275, 277, 278, 279, 281, 291, 294, 301, 302]
Discarding 55 places :
Implicit Place search using SMT with State Equation took 1670 ms to find 55 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 260/316 places, 2706/2706 transitions.
Applied a total of 0 rules in 10 ms. Remains 260 /260 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 260/316 places, 2706/2706 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : Railroad-PT-050-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s44 1) (EQ s102 1) (EQ s214 1)), p0:(AND (EQ s26 1) (EQ s105 1) (EQ s214 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Railroad-PT-050-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-050-LTLFireability-11 finished in 1803 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 316/316 places, 2706/2706 transitions.
Ensure Unique test removed 1 places
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 4 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 0 with 98 rules applied. Total rules applied 98 place count 266 transition count 2657
Applied a total of 98 rules in 642 ms. Remains 266 /316 variables (removed 50) and now considering 2657/2706 (removed 49) transitions.
// Phase 1: matrix 2657 rows 266 cols
[2022-05-20 21:40:27] [INFO ] Invariants computation overflowed in 11 ms
[2022-05-20 21:40:28] [INFO ] Implicit Places using invariants in 320 ms returned []
// Phase 1: matrix 2657 rows 266 cols
[2022-05-20 21:40:28] [INFO ] Invariants computation overflowed in 6 ms
[2022-05-20 21:40:30] [INFO ] Implicit Places using invariants and state equation in 2079 ms returned [0, 1, 6, 7, 8, 11, 12, 16, 17, 18, 22, 23, 24, 27, 31, 133, 134, 137, 138, 139, 141, 142, 144, 148, 149, 150, 153, 154, 155, 157, 158, 160, 161, 163, 216, 218, 220, 226, 227, 228, 229, 232, 240, 241, 243, 245, 246, 247, 248, 249, 251, 256, 258, 261, 262]
Discarding 55 places :
Implicit Place search using SMT with State Equation took 2408 ms to find 55 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 211/316 places, 2657/2706 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 211 transition count 2655
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 209 transition count 2655
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 209 transition count 2653
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 207 transition count 2653
Applied a total of 8 rules in 570 ms. Remains 207 /211 variables (removed 4) and now considering 2653/2657 (removed 4) transitions.
// Phase 1: matrix 2653 rows 207 cols
[2022-05-20 21:40:30] [INFO ] Invariants computation overflowed in 10 ms
[2022-05-20 21:40:31] [INFO ] Implicit Places using invariants in 276 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2022-05-20 21:40:31] [INFO ] Invariants computation overflowed in 6 ms
[2022-05-20 21:40:32] [INFO ] Implicit Places using invariants and state equation in 925 ms returned []
Implicit Place search using SMT with State Equation took 1206 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 207/316 places, 2653/2706 transitions.
Finished structural reductions, in 2 iterations. Remains : 207/316 places, 2653/2706 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-050-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s19 1) (EQ s107 1) (EQ s189 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1 reset in 897 ms.
Stack based approach found an accepted trace after 4468 steps with 0 reset with depth 4469 and stack size 4469 in 45 ms.
FORMULA Railroad-PT-050-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-050-LTLFireability-12 finished in 5824 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((true U p0))'
Support contains 3 out of 316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 316/316 places, 2706/2706 transitions.
Ensure Unique test removed 1 places
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 0 with 98 rules applied. Total rules applied 98 place count 266 transition count 2657
Applied a total of 98 rules in 506 ms. Remains 266 /316 variables (removed 50) and now considering 2657/2706 (removed 49) transitions.
// Phase 1: matrix 2657 rows 266 cols
[2022-05-20 21:40:33] [INFO ] Invariants computation overflowed in 11 ms
[2022-05-20 21:40:33] [INFO ] Implicit Places using invariants in 314 ms returned []
// Phase 1: matrix 2657 rows 266 cols
[2022-05-20 21:40:33] [INFO ] Invariants computation overflowed in 6 ms
[2022-05-20 21:40:35] [INFO ] Implicit Places using invariants and state equation in 1869 ms returned [0, 1, 6, 7, 8, 11, 12, 16, 17, 18, 22, 23, 24, 27, 31, 133, 134, 136, 137, 138, 140, 141, 143, 147, 148, 149, 152, 153, 154, 156, 157, 159, 161, 163, 216, 218, 220, 226, 227, 228, 229, 232, 240, 241, 243, 245, 246, 247, 248, 249, 251, 256, 258, 261, 262]
Discarding 55 places :
Implicit Place search using SMT with State Equation took 2189 ms to find 55 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 211/316 places, 2657/2706 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 211 transition count 2655
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 209 transition count 2655
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 209 transition count 2653
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 207 transition count 2653
Applied a total of 8 rules in 551 ms. Remains 207 /211 variables (removed 4) and now considering 2653/2657 (removed 4) transitions.
// Phase 1: matrix 2653 rows 207 cols
[2022-05-20 21:40:36] [INFO ] Invariants computation overflowed in 10 ms
[2022-05-20 21:40:36] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2022-05-20 21:40:36] [INFO ] Invariants computation overflowed in 5 ms
[2022-05-20 21:40:37] [INFO ] Implicit Places using invariants and state equation in 1174 ms returned []
Implicit Place search using SMT with State Equation took 1452 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 207/316 places, 2653/2706 transitions.
Finished structural reductions, in 2 iterations. Remains : 207/316 places, 2653/2706 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s62 1) (EQ s68 1) (EQ s189 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 788 ms.
Stack based approach found an accepted trace after 5410 steps with 0 reset with depth 5411 and stack size 5411 in 44 ms.
FORMULA Railroad-PT-050-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-050-LTLFireability-14 finished in 5584 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 316/316 places, 2706/2706 transitions.
Ensure Unique test removed 1 places
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 0 with 98 rules applied. Total rules applied 98 place count 266 transition count 2657
Applied a total of 98 rules in 485 ms. Remains 266 /316 variables (removed 50) and now considering 2657/2706 (removed 49) transitions.
// Phase 1: matrix 2657 rows 266 cols
[2022-05-20 21:40:39] [INFO ] Invariants computation overflowed in 11 ms
[2022-05-20 21:40:39] [INFO ] Implicit Places using invariants in 324 ms returned []
// Phase 1: matrix 2657 rows 266 cols
[2022-05-20 21:40:39] [INFO ] Invariants computation overflowed in 5 ms
[2022-05-20 21:40:40] [INFO ] Implicit Places using invariants and state equation in 1323 ms returned [0, 1, 6, 7, 8, 11, 12, 16, 17, 18, 22, 23, 24, 27, 31, 133, 134, 136, 137, 138, 140, 141, 143, 147, 148, 149, 152, 153, 154, 156, 157, 159, 160, 162, 215, 217, 219, 225, 226, 227, 228, 231, 239, 240, 242, 244, 245, 246, 247, 248, 250, 256, 258, 261, 262]
Discarding 55 places :
Implicit Place search using SMT with State Equation took 1668 ms to find 55 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 211/316 places, 2657/2706 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 211 transition count 2655
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 209 transition count 2655
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 209 transition count 2653
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 207 transition count 2653
Applied a total of 8 rules in 455 ms. Remains 207 /211 variables (removed 4) and now considering 2653/2657 (removed 4) transitions.
// Phase 1: matrix 2653 rows 207 cols
[2022-05-20 21:40:41] [INFO ] Invariants computation overflowed in 11 ms
[2022-05-20 21:40:41] [INFO ] Implicit Places using invariants in 292 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2022-05-20 21:40:41] [INFO ] Invariants computation overflowed in 4 ms
[2022-05-20 21:40:42] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 1075 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 207/316 places, 2653/2706 transitions.
Finished structural reductions, in 2 iterations. Remains : 207/316 places, 2653/2706 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-050-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s65 1) (EQ s103 1) (EQ s188 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 865 ms.
Stack based approach found an accepted trace after 132 steps with 0 reset with depth 133 and stack size 133 in 1 ms.
FORMULA Railroad-PT-050-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-050-LTLFireability-15 finished in 4613 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(G(F(X(F((G(p0)||p1))))))))'
[2022-05-20 21:40:43] [INFO ] Flatten gal took : 119 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1648329503247157438
[2022-05-20 21:40:43] [INFO ] Too many transitions (2706) to apply POR reductions. Disabling POR matrices.
[2022-05-20 21:40:43] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1648329503247157438
Running compilation step : cd /tmp/ltsmin1648329503247157438;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-20 21:40:43] [INFO ] Applying decomposition
[2022-05-20 21:40:43] [INFO ] Flatten gal took : 123 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13486434524668223075.txt' '-o' '/tmp/graph13486434524668223075.bin' '-w' '/tmp/graph13486434524668223075.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13486434524668223075.bin' '-l' '-1' '-v' '-w' '/tmp/graph13486434524668223075.weights' '-q' '0' '-e' '0.001'
[2022-05-20 21:40:44] [INFO ] Decomposing Gal with order
[2022-05-20 21:40:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 21:40:44] [INFO ] Removed a total of 8420 redundant transitions.
[2022-05-20 21:40:44] [INFO ] Flatten gal took : 221 ms
[2022-05-20 21:40:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 42 ms.
[2022-05-20 21:40:44] [INFO ] Time to serialize gal into /tmp/LTLFireability14312972242519471781.gal : 9 ms
[2022-05-20 21:40:44] [INFO ] Time to serialize properties into /tmp/LTLFireability12593741489154770610.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14312972242519471781.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12593741489154770610.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 2 LTL properties
Checking formula 0 : !((G(F("((i35.u115.pl_P146_1!=1)||(i35.u113.pl_P69_1!=1))"))))
Formula 0 simplified : !GF"((i35.u115.pl_P146_1!=1)||(i35.u113.pl_P69_1!=1))"
Compilation finished in 6907 ms.
Running link step : cd /tmp/ltsmin1648329503247157438;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 95 ms.
Running LTSmin : cd /tmp/ltsmin1648329503247157438;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-20 22:01:56] [INFO ] Applying decomposition
[2022-05-20 22:01:58] [INFO ] Flatten gal took : 1971 ms
[2022-05-20 22:01:59] [INFO ] Decomposing Gal with order
[2022-05-20 22:01:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 22:02:07] [INFO ] Removed a total of 7691 redundant transitions.
[2022-05-20 22:02:07] [INFO ] Flatten gal took : 5777 ms
[2022-05-20 22:02:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 159 ms.
[2022-05-20 22:02:08] [INFO ] Time to serialize gal into /tmp/LTLFireability3851475981322783642.gal : 46 ms
[2022-05-20 22:02:08] [INFO ] Time to serialize properties into /tmp/LTLFireability14364176523840246123.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3851475981322783642.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14364176523840246123.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 2 LTL properties
Checking formula 0 : !((G(F("((u52.pl_P146_1!=1)||(u25.pl_P69_1!=1))"))))
Formula 0 simplified : !GF"((u52.pl_P146_1!=1)||(u25.pl_P69_1!=1))"
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin1648329503247157438;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1648329503247157438;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]([](<>(X(<>(([]((LTLAPp1==true))||(LTLAPp2==true))))))))' '--buchi-type=spotba'
LTSmin run took 2369 ms.
FORMULA Railroad-PT-050-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin1648329503247157438;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-20 22:23:17] [INFO ] Flatten gal took : 788 ms
[2022-05-20 22:23:22] [INFO ] Input system was already deterministic with 2706 transitions.
[2022-05-20 22:23:23] [INFO ] Transformed 316 places.
[2022-05-20 22:23:23] [INFO ] Transformed 2706 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-20 22:23:23] [INFO ] Time to serialize gal into /tmp/LTLFireability10660837299656765839.gal : 51 ms
[2022-05-20 22:23:23] [INFO ] Time to serialize properties into /tmp/LTLFireability5760820534156830609.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10660837299656765839.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5760820534156830609.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((pl_P146_1!=1)||(pl_P69_1!=1))"))))
Formula 0 simplified : !GF"((pl_P146_1!=1)||(pl_P69_1!=1))"

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Railroad-PT-050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Railroad-PT-050, 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 r186-tajo-165281572100316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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