Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 10K Apr 30 07:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 30 07:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 30 07:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 30 07:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 9 07:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 293K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652686123664

Running Version 202205111006
[2022-05-16 07:28:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 07:28:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 07:28:44] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2022-05-16 07:28:44] [INFO ] Transformed 768 places.
[2022-05-16 07:28:44] [INFO ] Transformed 384 transitions.
[2022-05-16 07:28:44] [INFO ] Parsed PT model containing 768 places and 384 transitions in 214 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CircularTrains-PT-384-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 62 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 384/384 transitions.
Applied a total of 0 rules in 84 ms. Remains 768 /768 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 768 cols
[2022-05-16 07:28:45] [INFO ] Computed 385 place invariants in 77 ms
[2022-05-16 07:28:46] [INFO ] Implicit Places using invariants in 831 ms returned [1, 7, 9, 17, 21, 42, 46, 48, 58, 63, 64, 71, 85, 86, 88, 98, 103, 107, 108, 109, 133, 135, 137, 158, 162, 167, 174, 179, 185, 193, 198, 203, 215, 220, 221, 230, 245, 246, 254, 270, 276, 287, 293, 301, 303, 331, 334, 340, 346, 347, 350, 351, 353, 357, 365, 390, 397, 411, 412, 422, 426, 433, 447, 448, 449, 470, 475, 476, 485, 496, 502, 504, 505, 507, 508, 522, 525, 538, 539, 545, 579, 580, 586, 600, 607, 619, 622, 625, 628, 638, 643, 644, 647, 648, 662, 666, 671, 674, 677, 689, 693, 700, 708, 719, 735, 740, 741, 743, 746, 747, 749, 755, 758, 759, 760, 763, 764]
Discarding 117 places :
Implicit Place search using SMT only with invariants took 878 ms to find 117 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 651/768 places, 384/384 transitions.
Applied a total of 0 rules in 38 ms. Remains 651 /651 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 651/768 places, 384/384 transitions.
Support contains 62 out of 651 places after structural reductions.
[2022-05-16 07:28:46] [INFO ] Flatten gal took : 65 ms
[2022-05-16 07:28:46] [INFO ] Flatten gal took : 29 ms
[2022-05-16 07:28:46] [INFO ] Input system was already deterministic with 384 transitions.
Finished random walk after 369 steps, including 0 resets, run visited all 33 properties in 84 ms. (steps per millisecond=4 )
FORMULA CircularTrains-PT-384-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CircularTrains-PT-384-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(F(G(p0)))'
Support contains 2 out of 651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 651/651 places, 384/384 transitions.
Drop transitions removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 106 place count 651 transition count 278
Reduce places removed 106 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 107 rules applied. Total rules applied 213 place count 545 transition count 277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 214 place count 544 transition count 277
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 214 place count 544 transition count 267
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 234 place count 534 transition count 267
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 254 place count 524 transition count 257
Applied a total of 254 rules in 66 ms. Remains 524 /651 variables (removed 127) and now considering 257/384 (removed 127) transitions.
// Phase 1: matrix 257 rows 524 cols
[2022-05-16 07:28:47] [INFO ] Computed 268 place invariants in 19 ms
[2022-05-16 07:28:47] [INFO ] Implicit Places using invariants in 318 ms returned [18, 24, 248, 270, 284, 380, 396, 491, 494, 498, 506]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 319 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 513/651 places, 257/384 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 513 transition count 256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 512 transition count 256
Applied a total of 2 rules in 28 ms. Remains 512 /513 variables (removed 1) and now considering 256/257 (removed 1) transitions.
// Phase 1: matrix 256 rows 512 cols
[2022-05-16 07:28:47] [INFO ] Computed 257 place invariants in 3 ms
[2022-05-16 07:28:47] [INFO ] Implicit Places using invariants in 277 ms returned []
// Phase 1: matrix 256 rows 512 cols
[2022-05-16 07:28:47] [INFO ] Computed 257 place invariants in 3 ms
[2022-05-16 07:28:47] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 512/651 places, 256/384 transitions.
Finished structural reductions, in 2 iterations. Remains : 512/651 places, 256/384 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s28 1) (GEQ s426 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1380 ms.
Product exploration explored 100000 steps with 0 reset in 1484 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]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 123 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 34 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=11 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 124 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 2 out of 512 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 512/512 places, 256/256 transitions.
Applied a total of 0 rules in 15 ms. Remains 512 /512 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 512 cols
[2022-05-16 07:28:51] [INFO ] Computed 257 place invariants in 7 ms
[2022-05-16 07:28:51] [INFO ] Implicit Places using invariants in 283 ms returned []
// Phase 1: matrix 256 rows 512 cols
[2022-05-16 07:28:51] [INFO ] Computed 257 place invariants in 2 ms
[2022-05-16 07:28:52] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
[2022-05-16 07:28:52] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 256 rows 512 cols
[2022-05-16 07:28:52] [INFO ] Computed 257 place invariants in 3 ms
[2022-05-16 07:28:52] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 512/512 places, 256/256 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]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=5 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 223 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1224 ms.
Product exploration explored 100000 steps with 0 reset in 1441 ms.
Built C files in :
/tmp/ltsmin10678434863652984392
[2022-05-16 07:28:55] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2022-05-16 07:28:55] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:28:55] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2022-05-16 07:28:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:28:55] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2022-05-16 07:28:55] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:28:55] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10678434863652984392
Running compilation step : cd /tmp/ltsmin10678434863652984392;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 626 ms.
Running link step : cd /tmp/ltsmin10678434863652984392;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin10678434863652984392;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16810041070474546426.hoa' '--buchi-type=spotba'
LTSmin run took 1164 ms.
FORMULA CircularTrains-PT-384-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-384-LTLFireability-01 finished in 10623 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(!p0 U (X(F(X(!p0)))&&p1)))'
Support contains 4 out of 651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 384/384 transitions.
Applied a total of 0 rules in 17 ms. Remains 651 /651 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 651 cols
[2022-05-16 07:28:57] [INFO ] Computed 268 place invariants in 11 ms
[2022-05-16 07:28:57] [INFO ] Implicit Places using invariants in 320 ms returned [21, 27, 301, 328, 346, 471, 496, 612, 619, 628]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 321 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 641/651 places, 384/384 transitions.
Applied a total of 0 rules in 10 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 641/651 places, 384/384 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (AND p1 (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s104 1) (GEQ s607 1)), p1:(OR (AND (GEQ s104 1) (GEQ s607 1)) (AND (GEQ s71 1) (GEQ s275 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-384-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLFireability-02 finished in 465 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 651/651 places, 384/384 transitions.
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 107 place count 651 transition count 277
Reduce places removed 107 places and 0 transitions.
Iterating post reduction 1 with 107 rules applied. Total rules applied 214 place count 544 transition count 277
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 214 place count 544 transition count 268
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 232 place count 535 transition count 268
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 252 place count 525 transition count 258
Applied a total of 252 rules in 53 ms. Remains 525 /651 variables (removed 126) and now considering 258/384 (removed 126) transitions.
// Phase 1: matrix 258 rows 525 cols
[2022-05-16 07:28:58] [INFO ] Computed 268 place invariants in 3 ms
[2022-05-16 07:28:58] [INFO ] Implicit Places using invariants in 305 ms returned [18, 24, 249, 271, 381, 397, 492, 495, 499, 507]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 310 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 515/651 places, 258/384 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 515 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 514 transition count 257
Applied a total of 2 rules in 28 ms. Remains 514 /515 variables (removed 1) and now considering 257/258 (removed 1) transitions.
// Phase 1: matrix 257 rows 514 cols
[2022-05-16 07:28:58] [INFO ] Computed 258 place invariants in 2 ms
[2022-05-16 07:28:58] [INFO ] Implicit Places using invariants in 284 ms returned []
// Phase 1: matrix 257 rows 514 cols
[2022-05-16 07:28:58] [INFO ] Computed 258 place invariants in 2 ms
[2022-05-16 07:28:59] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 514/651 places, 257/384 transitions.
Finished structural reductions, in 2 iterations. Remains : 514/651 places, 257/384 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s148 1) (GEQ s280 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 1012 reset in 1705 ms.
Product exploration explored 100000 steps with 1100 reset in 1809 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 80 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=26 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 128 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
// Phase 1: matrix 257 rows 514 cols
[2022-05-16 07:29:03] [INFO ] Computed 258 place invariants in 2 ms
[2022-05-16 07:29:03] [INFO ] [Real]Absence check using 255 positive place invariants in 84 ms returned sat
[2022-05-16 07:29:03] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 24 ms returned sat
[2022-05-16 07:29:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:29:04] [INFO ] [Real]Absence check using state equation in 793 ms returned sat
[2022-05-16 07:29:04] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 12 ms.
[2022-05-16 07:29:05] [INFO ] Added : 126 causal constraints over 26 iterations in 1733 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 22 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 514 cols
[2022-05-16 07:29:05] [INFO ] Computed 258 place invariants in 6 ms
[2022-05-16 07:29:06] [INFO ] Implicit Places using invariants in 310 ms returned []
// Phase 1: matrix 257 rows 514 cols
[2022-05-16 07:29:06] [INFO ] Computed 258 place invariants in 3 ms
[2022-05-16 07:29:06] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
[2022-05-16 07:29:06] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 257 rows 514 cols
[2022-05-16 07:29:06] [INFO ] Computed 258 place invariants in 2 ms
[2022-05-16 07:29:06] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 514/514 places, 257/257 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 110 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 55 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=18 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
// Phase 1: matrix 257 rows 514 cols
[2022-05-16 07:29:07] [INFO ] Computed 258 place invariants in 4 ms
[2022-05-16 07:29:07] [INFO ] [Real]Absence check using 255 positive place invariants in 81 ms returned sat
[2022-05-16 07:29:07] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 24 ms returned sat
[2022-05-16 07:29:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:29:08] [INFO ] [Real]Absence check using state equation in 806 ms returned sat
[2022-05-16 07:29:08] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-16 07:29:10] [INFO ] Added : 126 causal constraints over 26 iterations in 1715 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1053 reset in 1763 ms.
Product exploration explored 100000 steps with 1064 reset in 1827 ms.
Built C files in :
/tmp/ltsmin17597357988173452027
[2022-05-16 07:29:13] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2022-05-16 07:29:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:29:13] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2022-05-16 07:29:13] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:29:13] [INFO ] Computing Do-Not-Accords matrix : 257 transitions.
[2022-05-16 07:29:13] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:29:13] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17597357988173452027
Running compilation step : cd /tmp/ltsmin17597357988173452027;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 529 ms.
Running link step : cd /tmp/ltsmin17597357988173452027;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin17597357988173452027;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10506918877652433634.hoa' '--buchi-type=spotba'
LTSmin run took 1208 ms.
FORMULA CircularTrains-PT-384-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-384-LTLFireability-03 finished in 17637 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(G(p0) U G(!p1)) U G(p2)))'
Support contains 6 out of 651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 651/651 places, 384/384 transitions.
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 107 place count 651 transition count 277
Reduce places removed 107 places and 0 transitions.
Iterating post reduction 1 with 107 rules applied. Total rules applied 214 place count 544 transition count 277
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 214 place count 544 transition count 270
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 228 place count 537 transition count 270
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 248 place count 527 transition count 260
Applied a total of 248 rules in 31 ms. Remains 527 /651 variables (removed 124) and now considering 260/384 (removed 124) transitions.
// Phase 1: matrix 260 rows 527 cols
[2022-05-16 07:29:15] [INFO ] Computed 268 place invariants in 6 ms
[2022-05-16 07:29:15] [INFO ] Implicit Places using invariants in 281 ms returned [18, 24, 251, 287, 399, 497, 501, 509]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 282 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 519/651 places, 260/384 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 519 transition count 259
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 518 transition count 259
Applied a total of 2 rules in 13 ms. Remains 518 /519 variables (removed 1) and now considering 259/260 (removed 1) transitions.
// Phase 1: matrix 259 rows 518 cols
[2022-05-16 07:29:15] [INFO ] Computed 260 place invariants in 2 ms
[2022-05-16 07:29:16] [INFO ] Implicit Places using invariants in 275 ms returned []
// Phase 1: matrix 259 rows 518 cols
[2022-05-16 07:29:16] [INFO ] Computed 260 place invariants in 4 ms
[2022-05-16 07:29:16] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 518/651 places, 259/384 transitions.
Finished structural reductions, in 2 iterations. Remains : 518/651 places, 259/384 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p2), (NOT p1), (AND p0 (NOT p1)), (AND (NOT p1) p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s240 1) (GEQ s378 1)), p1:(AND (GEQ s160 1) (GEQ s488 1)), p0:(AND (GEQ s117 1) (GEQ s269 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1007 reset in 1747 ms.
Product exploration explored 100000 steps with 1070 reset in 1886 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 p1) (NOT p0)), (X (NOT (AND p2 p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT p1)), (X p1), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 561 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 149 ms :[(NOT p2), (NOT p1), (AND p0 (NOT p1)), (AND (NOT p1) p0)]
Finished random walk after 152 steps, including 0 resets, run visited all 6 properties in 37 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p2 p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT p1)), (X p1), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p1))), (X (X p1)), (F (AND p0 p2)), (F p1), (F (AND (NOT p1) p0)), (F p2), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 2 factoid took 566 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 132 ms :[(NOT p2), (NOT p1), (AND p0 (NOT p1)), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p2), (NOT p1), (AND p0 (NOT p1)), (AND (NOT p1) p0)]
// Phase 1: matrix 259 rows 518 cols
[2022-05-16 07:29:22] [INFO ] Computed 260 place invariants in 8 ms
[2022-05-16 07:29:22] [INFO ] [Real]Absence check using 254 positive place invariants in 81 ms returned sat
[2022-05-16 07:29:22] [INFO ] [Real]Absence check using 254 positive and 6 generalized place invariants in 41 ms returned sat
[2022-05-16 07:29:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:29:23] [INFO ] [Real]Absence check using state equation in 750 ms returned sat
[2022-05-16 07:29:23] [INFO ] Computed and/alt/rep : 131/259/131 causal constraints (skipped 0 transitions) in 17 ms.
[2022-05-16 07:29:24] [INFO ] Added : 128 causal constraints over 26 iterations in 1520 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 6 out of 518 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 518/518 places, 259/259 transitions.
Applied a total of 0 rules in 10 ms. Remains 518 /518 variables (removed 0) and now considering 259/259 (removed 0) transitions.
// Phase 1: matrix 259 rows 518 cols
[2022-05-16 07:29:24] [INFO ] Computed 260 place invariants in 4 ms
[2022-05-16 07:29:24] [INFO ] Implicit Places using invariants in 293 ms returned []
// Phase 1: matrix 259 rows 518 cols
[2022-05-16 07:29:25] [INFO ] Computed 260 place invariants in 2 ms
[2022-05-16 07:29:25] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
[2022-05-16 07:29:25] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 259 rows 518 cols
[2022-05-16 07:29:25] [INFO ] Computed 260 place invariants in 3 ms
[2022-05-16 07:29:25] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 518/518 places, 259/259 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p0 p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X p1), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 2 factoid took 430 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (NOT p1), (AND p0 (NOT p1)), (AND (NOT p1) p0)]
Finished random walk after 147 steps, including 0 resets, run visited all 6 properties in 9 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p0 p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X p1), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (AND p0 p2)), (F p1), (F (AND (NOT p1) p0)), (F p2), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 2 factoid took 562 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (NOT p1), (AND p0 (NOT p1)), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p2), (NOT p1), (AND p0 (NOT p1)), (AND (NOT p1) p0)]
// Phase 1: matrix 259 rows 518 cols
[2022-05-16 07:29:27] [INFO ] Computed 260 place invariants in 8 ms
[2022-05-16 07:29:27] [INFO ] [Real]Absence check using 254 positive place invariants in 82 ms returned sat
[2022-05-16 07:29:27] [INFO ] [Real]Absence check using 254 positive and 6 generalized place invariants in 33 ms returned sat
[2022-05-16 07:29:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:29:28] [INFO ] [Real]Absence check using state equation in 748 ms returned sat
[2022-05-16 07:29:28] [INFO ] Computed and/alt/rep : 131/259/131 causal constraints (skipped 0 transitions) in 20 ms.
[2022-05-16 07:29:29] [INFO ] Added : 128 causal constraints over 26 iterations in 1653 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (NOT p1), (AND p0 (NOT p1)), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 1053 reset in 1817 ms.
Product exploration explored 100000 steps with 1003 reset in 1923 ms.
Built C files in :
/tmp/ltsmin2412161977763079598
[2022-05-16 07:29:33] [INFO ] Computing symmetric may disable matrix : 259 transitions.
[2022-05-16 07:29:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:29:33] [INFO ] Computing symmetric may enable matrix : 259 transitions.
[2022-05-16 07:29:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:29:33] [INFO ] Computing Do-Not-Accords matrix : 259 transitions.
[2022-05-16 07:29:33] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:29:33] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2412161977763079598
Running compilation step : cd /tmp/ltsmin2412161977763079598;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 557 ms.
Running link step : cd /tmp/ltsmin2412161977763079598;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2412161977763079598;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16369496573578892348.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 518 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 518/518 places, 259/259 transitions.
Applied a total of 0 rules in 17 ms. Remains 518 /518 variables (removed 0) and now considering 259/259 (removed 0) transitions.
// Phase 1: matrix 259 rows 518 cols
[2022-05-16 07:29:48] [INFO ] Computed 260 place invariants in 17 ms
[2022-05-16 07:29:49] [INFO ] Implicit Places using invariants in 443 ms returned []
// Phase 1: matrix 259 rows 518 cols
[2022-05-16 07:29:49] [INFO ] Computed 260 place invariants in 8 ms
[2022-05-16 07:29:49] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 871 ms to find 0 implicit places.
[2022-05-16 07:29:49] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 259 rows 518 cols
[2022-05-16 07:29:49] [INFO ] Computed 260 place invariants in 3 ms
[2022-05-16 07:29:49] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 518/518 places, 259/259 transitions.
Built C files in :
/tmp/ltsmin4373643989097393794
[2022-05-16 07:29:49] [INFO ] Computing symmetric may disable matrix : 259 transitions.
[2022-05-16 07:29:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:29:49] [INFO ] Computing symmetric may enable matrix : 259 transitions.
[2022-05-16 07:29:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:29:49] [INFO ] Computing Do-Not-Accords matrix : 259 transitions.
[2022-05-16 07:29:49] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:29:49] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4373643989097393794
Running compilation step : cd /tmp/ltsmin4373643989097393794;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 583 ms.
Running link step : cd /tmp/ltsmin4373643989097393794;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin4373643989097393794;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15826797943577314243.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 07:30:05] [INFO ] Flatten gal took : 21 ms
[2022-05-16 07:30:05] [INFO ] Flatten gal took : 19 ms
[2022-05-16 07:30:05] [INFO ] Time to serialize gal into /tmp/LTL9541712852536105340.gal : 4 ms
[2022-05-16 07:30:05] [INFO ] Time to serialize properties into /tmp/LTL15366925657871388262.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/LTL9541712852536105340.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15366925657871388262.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/LTL9541712...267
Read 1 LTL properties
Checking formula 0 : !(((!((G("((Section_334>=1)&&(F335>=1))"))U(G(!("((Section_178>=1)&&(F179>=1))")))))U(G("((Section_313>=1)&&(F314>=1))"))))
Formula 0 simplified : !(!(G"((Section_334>=1)&&(F335>=1))" U G!"((Section_178>=1)&&(F179>=1))") U G"((Section_313>=1)&&(F314>=1))")
Detected timeout of ITS tools.
[2022-05-16 07:30:20] [INFO ] Flatten gal took : 17 ms
[2022-05-16 07:30:20] [INFO ] Applying decomposition
[2022-05-16 07:30:20] [INFO ] Flatten gal took : 17 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/graph12230981375408084154.txt' '-o' '/tmp/graph12230981375408084154.bin' '-w' '/tmp/graph12230981375408084154.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12230981375408084154.bin' '-l' '-1' '-v' '-w' '/tmp/graph12230981375408084154.weights' '-q' '0' '-e' '0.001'
[2022-05-16 07:30:20] [INFO ] Decomposing Gal with order
[2022-05-16 07:30:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 07:30:20] [INFO ] Flatten gal took : 58 ms
[2022-05-16 07:30:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-16 07:30:20] [INFO ] Time to serialize gal into /tmp/LTL1972200546267551061.gal : 8 ms
[2022-05-16 07:30:20] [INFO ] Time to serialize properties into /tmp/LTL16448580814241862785.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/LTL1972200546267551061.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16448580814241862785.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/LTL1972200...246
Read 1 LTL properties
Checking formula 0 : !(((!((G("((i5.i1.i1.u24.Section_334>=1)&&(i5.i1.i1.u24.F335>=1))"))U(G(!("((i16.u178.Section_178>=1)&&(i16.u178.F179>=1))")))))U(G("(...206
Formula 0 simplified : !(!(G"((i5.i1.i1.u24.Section_334>=1)&&(i5.i1.i1.u24.F335>=1))" U G!"((i16.u178.Section_178>=1)&&(i16.u178.F179>=1))") U G"((i20.u118...194
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14789415263126506840
[2022-05-16 07:30:35] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14789415263126506840
Running compilation step : cd /tmp/ltsmin14789415263126506840;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 441 ms.
Running link step : cd /tmp/ltsmin14789415263126506840;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin14789415263126506840;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!([]((LTLAPp0==true)) U [](!(LTLAPp1==true))) U []((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-384-LTLFireability-05 finished in 95058 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 384/384 transitions.
Applied a total of 0 rules in 14 ms. Remains 651 /651 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 651 cols
[2022-05-16 07:30:50] [INFO ] Computed 268 place invariants in 5 ms
[2022-05-16 07:30:51] [INFO ] Implicit Places using invariants in 348 ms returned [21, 27, 301, 328, 346, 471, 496, 612, 615, 619, 628]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 351 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 640/651 places, 384/384 transitions.
Applied a total of 0 rules in 10 ms. Remains 640 /640 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 640/651 places, 384/384 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s322 1) (GEQ s525 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 11175 reset in 1676 ms.
Product exploration explored 100000 steps with 10533 reset in 1754 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]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 133 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 110 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 640/640 places, 384/384 transitions.
Applied a total of 0 rules in 13 ms. Remains 640 /640 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 640 cols
[2022-05-16 07:30:55] [INFO ] Computed 257 place invariants in 3 ms
[2022-05-16 07:30:55] [INFO ] Implicit Places using invariants in 357 ms returned []
// Phase 1: matrix 384 rows 640 cols
[2022-05-16 07:30:55] [INFO ] Computed 257 place invariants in 3 ms
[2022-05-16 07:30:56] [INFO ] Implicit Places using invariants and state equation in 912 ms returned []
Implicit Place search using SMT with State Equation took 1274 ms to find 0 implicit places.
// Phase 1: matrix 384 rows 640 cols
[2022-05-16 07:30:56] [INFO ] Computed 257 place invariants in 6 ms
[2022-05-16 07:30:56] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 640/640 places, 384/384 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]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 112 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 66 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=22 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 152 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11647 reset in 1762 ms.
Product exploration explored 100000 steps with 12284 reset in 1815 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 640/640 places, 384/384 transitions.
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 640 transition count 384
Deduced a syphon composed of 128 places in 0 ms
Applied a total of 128 rules in 51 ms. Remains 640 /640 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2022-05-16 07:31:01] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 384 rows 640 cols
[2022-05-16 07:31:01] [INFO ] Computed 257 place invariants in 11 ms
[2022-05-16 07:31:01] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 640/640 places, 384/384 transitions.
Finished structural reductions, in 1 iterations. Remains : 640/640 places, 384/384 transitions.
Product exploration explored 100000 steps with 13751 reset in 2877 ms.
Product exploration explored 100000 steps with 14190 reset in 3024 ms.
Built C files in :
/tmp/ltsmin6518318956653046214
[2022-05-16 07:31:07] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6518318956653046214
Running compilation step : cd /tmp/ltsmin6518318956653046214;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 613 ms.
Running link step : cd /tmp/ltsmin6518318956653046214;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6518318956653046214;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16020532198538930021.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 640/640 places, 384/384 transitions.
Applied a total of 0 rules in 18 ms. Remains 640 /640 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 640 cols
[2022-05-16 07:31:22] [INFO ] Computed 257 place invariants in 12 ms
[2022-05-16 07:31:23] [INFO ] Implicit Places using invariants in 305 ms returned []
// Phase 1: matrix 384 rows 640 cols
[2022-05-16 07:31:23] [INFO ] Computed 257 place invariants in 3 ms
[2022-05-16 07:31:23] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
// Phase 1: matrix 384 rows 640 cols
[2022-05-16 07:31:23] [INFO ] Computed 257 place invariants in 8 ms
[2022-05-16 07:31:23] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 640/640 places, 384/384 transitions.
Built C files in :
/tmp/ltsmin13017152157877839489
[2022-05-16 07:31:23] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13017152157877839489
Running compilation step : cd /tmp/ltsmin13017152157877839489;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 618 ms.
Running link step : cd /tmp/ltsmin13017152157877839489;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13017152157877839489;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2221677721833840518.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 07:31:39] [INFO ] Flatten gal took : 23 ms
[2022-05-16 07:31:39] [INFO ] Flatten gal took : 17 ms
[2022-05-16 07:31:39] [INFO ] Time to serialize gal into /tmp/LTL4275593867994365905.gal : 2 ms
[2022-05-16 07:31:39] [INFO ] Time to serialize properties into /tmp/LTL11352023718773809126.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/LTL4275593867994365905.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11352023718773809126.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/LTL4275593...267
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((F103>=1)&&(Section_102>=1))")))))
Formula 0 simplified : !XXF"((F103>=1)&&(Section_102>=1))"
Detected timeout of ITS tools.
[2022-05-16 07:31:54] [INFO ] Flatten gal took : 19 ms
[2022-05-16 07:31:54] [INFO ] Applying decomposition
[2022-05-16 07:31:54] [INFO ] Flatten gal took : 18 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/graph15042467449955774444.txt' '-o' '/tmp/graph15042467449955774444.bin' '-w' '/tmp/graph15042467449955774444.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15042467449955774444.bin' '-l' '-1' '-v' '-w' '/tmp/graph15042467449955774444.weights' '-q' '0' '-e' '0.001'
[2022-05-16 07:31:54] [INFO ] Decomposing Gal with order
[2022-05-16 07:31:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 07:31:54] [INFO ] Flatten gal took : 22 ms
[2022-05-16 07:31:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 07:31:54] [INFO ] Time to serialize gal into /tmp/LTL7100152444658813959.gal : 4 ms
[2022-05-16 07:31:54] [INFO ] Time to serialize properties into /tmp/LTL9646736806726977299.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/LTL7100152444658813959.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9646736806726977299.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/LTL7100152...245
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((i19.i1.u15.F103>=1)&&(i19.i1.u15.Section_102>=1))")))))
Formula 0 simplified : !XXF"((i19.i1.u15.F103>=1)&&(i19.i1.u15.Section_102>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1591758442077068230
[2022-05-16 07:32:09] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1591758442077068230
Running compilation step : cd /tmp/ltsmin1591758442077068230;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 613 ms.
Running link step : cd /tmp/ltsmin1591758442077068230;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin1591758442077068230;'/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(<>((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-384-LTLFireability-06 finished in 93759 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!(G((G(p1)&&p0)) U !X(p2)))))'
Support contains 4 out of 651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 651/651 places, 384/384 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 651 transition count 280
Reduce places removed 104 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 105 rules applied. Total rules applied 209 place count 547 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 210 place count 546 transition count 279
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 210 place count 546 transition count 267
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 234 place count 534 transition count 267
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 254 place count 524 transition count 257
Applied a total of 254 rules in 39 ms. Remains 524 /651 variables (removed 127) and now considering 257/384 (removed 127) transitions.
// Phase 1: matrix 257 rows 524 cols
[2022-05-16 07:32:24] [INFO ] Computed 268 place invariants in 5 ms
[2022-05-16 07:32:24] [INFO ] Implicit Places using invariants in 313 ms returned [18, 24, 248, 270, 284, 380, 396, 491, 494, 498, 506]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 315 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 513/651 places, 257/384 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 513 transition count 256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 512 transition count 256
Applied a total of 2 rules in 14 ms. Remains 512 /513 variables (removed 1) and now considering 256/257 (removed 1) transitions.
// Phase 1: matrix 256 rows 512 cols
[2022-05-16 07:32:24] [INFO ] Computed 257 place invariants in 4 ms
[2022-05-16 07:32:25] [INFO ] Implicit Places using invariants in 291 ms returned []
// Phase 1: matrix 256 rows 512 cols
[2022-05-16 07:32:25] [INFO ] Computed 257 place invariants in 5 ms
[2022-05-16 07:32:25] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 512/651 places, 256/384 transitions.
Finished structural reductions, in 2 iterations. Remains : 512/651 places, 256/384 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p2), (NOT p2), (AND p1 p0 (NOT p2)), (AND (NOT p2) p1 p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s66 1) (GEQ s446 1)), p1:(AND (GEQ s262 1) (GEQ s274 1)), p0:(AND (GEQ s66 1) (GEQ s446 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 15103 reset in 1799 ms.
Product exploration explored 100000 steps with 15513 reset in 1937 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 p2 (NOT p1) p0), (X (NOT (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2)))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 3 factoid took 233 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), (NOT p2), (AND p0 p1 (NOT p2)), (AND (NOT p2) p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 256 rows 512 cols
[2022-05-16 07:32:30] [INFO ] Computed 257 place invariants in 6 ms
[2022-05-16 07:32:30] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (G (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p2))), (X (X p2)), (F (NOT p2)), (F (AND p0 p1))]
Knowledge based reduction with 4 factoid took 310 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p2), (NOT p2)]
Support contains 2 out of 512 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 512/512 places, 256/256 transitions.
Applied a total of 0 rules in 15 ms. Remains 512 /512 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 512 cols
[2022-05-16 07:32:30] [INFO ] Computed 257 place invariants in 6 ms
[2022-05-16 07:32:30] [INFO ] Implicit Places using invariants in 295 ms returned []
// Phase 1: matrix 256 rows 512 cols
[2022-05-16 07:32:31] [INFO ] Computed 257 place invariants in 2 ms
[2022-05-16 07:32:31] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
[2022-05-16 07:32:31] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 256 rows 512 cols
[2022-05-16 07:32:31] [INFO ] Computed 257 place invariants in 2 ms
[2022-05-16 07:32:31] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 512/512 places, 256/256 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 : [p2]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 1 factoid took 94 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 77 ms :[(NOT p2), (NOT p2)]
Finished random walk after 28 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=9 )
Knowledge obtained : [p2]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F (NOT p2))]
Knowledge based reduction with 1 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 56 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 15616 reset in 1787 ms.
Product exploration explored 100000 steps with 15289 reset in 1890 ms.
Built C files in :
/tmp/ltsmin1216133267646653648
[2022-05-16 07:32:35] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2022-05-16 07:32:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:32:35] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2022-05-16 07:32:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:32:35] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2022-05-16 07:32:35] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:32:35] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1216133267646653648
Running compilation step : cd /tmp/ltsmin1216133267646653648;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 545 ms.
Running link step : cd /tmp/ltsmin1216133267646653648;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1216133267646653648;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11893093634216690516.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 512 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 512/512 places, 256/256 transitions.
Applied a total of 0 rules in 17 ms. Remains 512 /512 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 512 cols
[2022-05-16 07:32:50] [INFO ] Computed 257 place invariants in 4 ms
[2022-05-16 07:32:51] [INFO ] Implicit Places using invariants in 306 ms returned []
// Phase 1: matrix 256 rows 512 cols
[2022-05-16 07:32:51] [INFO ] Computed 257 place invariants in 7 ms
[2022-05-16 07:32:51] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
[2022-05-16 07:32:51] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 256 rows 512 cols
[2022-05-16 07:32:51] [INFO ] Computed 257 place invariants in 3 ms
[2022-05-16 07:32:51] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 512/512 places, 256/256 transitions.
Built C files in :
/tmp/ltsmin7094927054605132922
[2022-05-16 07:32:51] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2022-05-16 07:32:51] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:32:51] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2022-05-16 07:32:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:32:51] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2022-05-16 07:32:51] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:32:51] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7094927054605132922
Running compilation step : cd /tmp/ltsmin7094927054605132922;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 570 ms.
Running link step : cd /tmp/ltsmin7094927054605132922;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7094927054605132922;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5867205001433053748.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 07:33:07] [INFO ] Flatten gal took : 19 ms
[2022-05-16 07:33:07] [INFO ] Flatten gal took : 12 ms
[2022-05-16 07:33:07] [INFO ] Time to serialize gal into /tmp/LTL3670711084378671599.gal : 2 ms
[2022-05-16 07:33:07] [INFO ] Time to serialize properties into /tmp/LTL14149518449637034616.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/LTL3670711084378671599.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14149518449637034616.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/LTL3670711...267
Read 1 LTL properties
Checking formula 0 : !((G(F(!((G(((G("((F273>=1)&&(Section_272>=1))"))&&("(F289>=1)"))&&("(Section_288>=1)")))U(!(X("((F289>=1)&&(Section_288>=1))"))))))))
Formula 0 simplified : !GF!(G("(F289>=1)" & "(Section_288>=1)" & G"((F273>=1)&&(Section_272>=1))") U !X"((F289>=1)&&(Section_288>=1))")
Detected timeout of ITS tools.
[2022-05-16 07:33:22] [INFO ] Flatten gal took : 15 ms
[2022-05-16 07:33:22] [INFO ] Applying decomposition
[2022-05-16 07:33:22] [INFO ] Flatten gal took : 12 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/graph7205789266406547150.txt' '-o' '/tmp/graph7205789266406547150.bin' '-w' '/tmp/graph7205789266406547150.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7205789266406547150.bin' '-l' '-1' '-v' '-w' '/tmp/graph7205789266406547150.weights' '-q' '0' '-e' '0.001'
[2022-05-16 07:33:22] [INFO ] Decomposing Gal with order
[2022-05-16 07:33:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 07:33:22] [INFO ] Flatten gal took : 22 ms
[2022-05-16 07:33:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-16 07:33:22] [INFO ] Time to serialize gal into /tmp/LTL14282348555118599572.gal : 5 ms
[2022-05-16 07:33:22] [INFO ] Time to serialize properties into /tmp/LTL712205530947048418.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/LTL14282348555118599572.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL712205530947048418.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/LTL1428234...245
Read 1 LTL properties
Checking formula 0 : !((G(F(!((G(((G("((i3.i0.i2.u39.F273>=1)&&(i3.i0.i0.u44.Section_272>=1))"))&&("(i4.i0.i1.u246.F289>=1)"))&&("(i4.i0.i1.u167.Section_28...237
Formula 0 simplified : !GF!(G("(i4.i0.i1.u167.Section_288>=1)" & "(i4.i0.i1.u246.F289>=1)" & G"((i3.i0.i2.u39.F273>=1)&&(i3.i0.i0.u44.Section_272>=1))") U ...217
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16101006535873848708
[2022-05-16 07:33:37] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16101006535873848708
Running compilation step : cd /tmp/ltsmin16101006535873848708;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 460 ms.
Running link step : cd /tmp/ltsmin16101006535873848708;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16101006535873848708;'/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' '[](<>(!([](([]((LTLAPp1==true))&&(LTLAPp0==true))) U !X((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-384-LTLFireability-07 finished in 87952 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 4 out of 651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 651/651 places, 384/384 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 651 transition count 280
Reduce places removed 104 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 105 rules applied. Total rules applied 209 place count 547 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 210 place count 546 transition count 279
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 210 place count 546 transition count 267
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 234 place count 534 transition count 267
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 254 place count 524 transition count 257
Applied a total of 254 rules in 38 ms. Remains 524 /651 variables (removed 127) and now considering 257/384 (removed 127) transitions.
// Phase 1: matrix 257 rows 524 cols
[2022-05-16 07:33:52] [INFO ] Computed 268 place invariants in 6 ms
[2022-05-16 07:33:52] [INFO ] Implicit Places using invariants in 290 ms returned [18, 24, 248, 270, 284, 380, 396, 491, 494, 498, 506]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 292 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 513/651 places, 257/384 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 513 transition count 256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 512 transition count 256
Applied a total of 2 rules in 13 ms. Remains 512 /513 variables (removed 1) and now considering 256/257 (removed 1) transitions.
// Phase 1: matrix 256 rows 512 cols
[2022-05-16 07:33:52] [INFO ] Computed 257 place invariants in 3 ms
[2022-05-16 07:33:53] [INFO ] Implicit Places using invariants in 277 ms returned []
// Phase 1: matrix 256 rows 512 cols
[2022-05-16 07:33:53] [INFO ] Computed 257 place invariants in 6 ms
[2022-05-16 07:33:53] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 512/651 places, 256/384 transitions.
Finished structural reductions, in 2 iterations. Remains : 512/651 places, 256/384 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s399 1) (LT s495 1)), p1:(OR (LT s124 1) (LT s451 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 1305 ms.
Product exploration explored 100000 steps with 0 reset in 1456 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 p0)]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0)]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F p1)]
Knowledge based reduction with 2 factoid took 212 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
// Phase 1: matrix 256 rows 512 cols
[2022-05-16 07:33:56] [INFO ] Computed 257 place invariants in 4 ms
[2022-05-16 07:33:57] [INFO ] [Real]Absence check using 255 positive place invariants in 79 ms returned sat
[2022-05-16 07:33:57] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 33 ms returned sat
[2022-05-16 07:33:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:33:57] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2022-05-16 07:33:57] [INFO ] Computed and/alt/rep : 128/256/128 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-16 07:33:59] [INFO ] Added : 126 causal constraints over 26 iterations in 1778 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 512 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 512/512 places, 256/256 transitions.
Applied a total of 0 rules in 9 ms. Remains 512 /512 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 512 cols
[2022-05-16 07:33:59] [INFO ] Computed 257 place invariants in 4 ms
[2022-05-16 07:33:59] [INFO ] Implicit Places using invariants in 269 ms returned []
// Phase 1: matrix 256 rows 512 cols
[2022-05-16 07:33:59] [INFO ] Computed 257 place invariants in 2 ms
[2022-05-16 07:34:00] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
[2022-05-16 07:34:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 256 rows 512 cols
[2022-05-16 07:34:00] [INFO ] Computed 257 place invariants in 4 ms
[2022-05-16 07:34:00] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 512/512 places, 256/256 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 : [(NOT p1)]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Finished random walk after 58 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=14 )
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F p1)]
Knowledge based reduction with 1 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
// Phase 1: matrix 256 rows 512 cols
[2022-05-16 07:34:00] [INFO ] Computed 257 place invariants in 6 ms
[2022-05-16 07:34:00] [INFO ] [Real]Absence check using 255 positive place invariants in 75 ms returned sat
[2022-05-16 07:34:00] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 23 ms returned sat
[2022-05-16 07:34:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:34:01] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2022-05-16 07:34:01] [INFO ] Computed and/alt/rep : 128/256/128 causal constraints (skipped 0 transitions) in 12 ms.
[2022-05-16 07:34:03] [INFO ] Added : 126 causal constraints over 26 iterations in 1772 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 1323 ms.
Product exploration explored 100000 steps with 0 reset in 1482 ms.
Built C files in :
/tmp/ltsmin9745983555148166147
[2022-05-16 07:34:06] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2022-05-16 07:34:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:34:06] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2022-05-16 07:34:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:34:06] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2022-05-16 07:34:06] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:34:06] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9745983555148166147
Running compilation step : cd /tmp/ltsmin9745983555148166147;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 520 ms.
Running link step : cd /tmp/ltsmin9745983555148166147;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9745983555148166147;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2753785618661585499.hoa' '--buchi-type=spotba'
LTSmin run took 1157 ms.
FORMULA CircularTrains-PT-384-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-384-LTLFireability-08 finished in 15413 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(F(G(p0))))||(F(p1)&&F(p2))))'
Support contains 6 out of 651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 651/651 places, 384/384 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 651 transition count 280
Reduce places removed 104 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 105 rules applied. Total rules applied 209 place count 547 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 210 place count 546 transition count 279
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 210 place count 546 transition count 268
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 232 place count 535 transition count 268
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 252 place count 525 transition count 258
Applied a total of 252 rules in 29 ms. Remains 525 /651 variables (removed 126) and now considering 258/384 (removed 126) transitions.
// Phase 1: matrix 258 rows 525 cols
[2022-05-16 07:34:07] [INFO ] Computed 268 place invariants in 2 ms
[2022-05-16 07:34:08] [INFO ] Implicit Places using invariants in 278 ms returned [18, 24, 249, 271, 285, 381, 397, 492, 495, 507]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 279 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 515/651 places, 258/384 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 514 transition count 257
Applied a total of 2 rules in 15 ms. Remains 514 /515 variables (removed 1) and now considering 257/258 (removed 1) transitions.
// Phase 1: matrix 257 rows 514 cols
[2022-05-16 07:34:08] [INFO ] Computed 258 place invariants in 3 ms
[2022-05-16 07:34:08] [INFO ] Implicit Places using invariants in 269 ms returned []
// Phase 1: matrix 257 rows 514 cols
[2022-05-16 07:34:08] [INFO ] Computed 258 place invariants in 3 ms
[2022-05-16 07:34:08] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 514/651 places, 257/384 transitions.
Finished structural reductions, in 2 iterations. Remains : 514/651 places, 257/384 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s102 1) (GEQ s489 1)), p1:(AND (GEQ s40 1) (GEQ s209 1)), p2:(AND (GEQ s179 1) (GEQ s365 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 735 reset in 1743 ms.
Product exploration explored 100000 steps with 721 reset in 1835 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) p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 5 factoid took 688 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 72 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 597 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 257 rows 514 cols
[2022-05-16 07:34:14] [INFO ] Computed 258 place invariants in 2 ms
[2022-05-16 07:34:14] [INFO ] [Real]Absence check using 254 positive place invariants in 77 ms returned sat
[2022-05-16 07:34:14] [INFO ] [Real]Absence check using 254 positive and 4 generalized place invariants in 10 ms returned sat
[2022-05-16 07:34:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:34:15] [INFO ] [Real]Absence check using state equation in 883 ms returned sat
[2022-05-16 07:34:15] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 16 ms.
[2022-05-16 07:34:16] [INFO ] Added : 127 causal constraints over 26 iterations in 1719 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 514 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 7 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 514 cols
[2022-05-16 07:34:16] [INFO ] Computed 258 place invariants in 4 ms
[2022-05-16 07:34:17] [INFO ] Implicit Places using invariants in 283 ms returned []
// Phase 1: matrix 257 rows 514 cols
[2022-05-16 07:34:17] [INFO ] Computed 258 place invariants in 3 ms
[2022-05-16 07:34:17] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
// Phase 1: matrix 257 rows 514 cols
[2022-05-16 07:34:17] [INFO ] Computed 258 place invariants in 2 ms
[2022-05-16 07:34:17] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 514/514 places, 257/257 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 1 factoid took 259 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 107 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 227 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 257 rows 514 cols
[2022-05-16 07:34:18] [INFO ] Computed 258 place invariants in 5 ms
[2022-05-16 07:34:18] [INFO ] [Real]Absence check using 254 positive place invariants in 83 ms returned sat
[2022-05-16 07:34:18] [INFO ] [Real]Absence check using 254 positive and 4 generalized place invariants in 11 ms returned sat
[2022-05-16 07:34:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:34:19] [INFO ] [Real]Absence check using state equation in 883 ms returned sat
[2022-05-16 07:34:19] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 12 ms.
[2022-05-16 07:34:21] [INFO ] Added : 127 causal constraints over 26 iterations in 1684 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 758 reset in 1748 ms.
Product exploration explored 100000 steps with 693 reset in 1854 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 9 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2022-05-16 07:34:25] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 257 rows 514 cols
[2022-05-16 07:34:25] [INFO ] Computed 258 place invariants in 2 ms
[2022-05-16 07:34:25] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 514/514 places, 257/257 transitions.
Product exploration explored 100000 steps with 726 reset in 1757 ms.
Product exploration explored 100000 steps with 707 reset in 1862 ms.
Built C files in :
/tmp/ltsmin17157206093295183466
[2022-05-16 07:34:29] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17157206093295183466
Running compilation step : cd /tmp/ltsmin17157206093295183466;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 456 ms.
Running link step : cd /tmp/ltsmin17157206093295183466;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17157206093295183466;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9966009605613328950.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 11 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 514 cols
[2022-05-16 07:34:44] [INFO ] Computed 258 place invariants in 7 ms
[2022-05-16 07:34:44] [INFO ] Implicit Places using invariants in 286 ms returned []
// Phase 1: matrix 257 rows 514 cols
[2022-05-16 07:34:44] [INFO ] Computed 258 place invariants in 2 ms
[2022-05-16 07:34:44] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
// Phase 1: matrix 257 rows 514 cols
[2022-05-16 07:34:44] [INFO ] Computed 258 place invariants in 7 ms
[2022-05-16 07:34:45] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 514/514 places, 257/257 transitions.
Built C files in :
/tmp/ltsmin12816152354927070881
[2022-05-16 07:34:45] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12816152354927070881
Running compilation step : cd /tmp/ltsmin12816152354927070881;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 477 ms.
Running link step : cd /tmp/ltsmin12816152354927070881;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12816152354927070881;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7740577490846995826.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 07:35:00] [INFO ] Flatten gal took : 11 ms
[2022-05-16 07:35:00] [INFO ] Flatten gal took : 11 ms
[2022-05-16 07:35:00] [INFO ] Time to serialize gal into /tmp/LTL6402510493061199588.gal : 2 ms
[2022-05-16 07:35:00] [INFO ] Time to serialize properties into /tmp/LTL3299178912408342832.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/LTL6402510493061199588.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3299178912408342832.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/LTL6402510...266
Read 1 LTL properties
Checking formula 0 : !(((F(X(F(G("((Section_103>=1)&&(F104>=1))")))))||((F("((F234>=1)&&(Section_233>=1))"))&&(F("((Section_174>=1)&&(F175>=1))")))))
Formula 0 simplified : !(FXFG"((Section_103>=1)&&(F104>=1))" | (F"((F234>=1)&&(Section_233>=1))" & F"((Section_174>=1)&&(F175>=1))"))
Detected timeout of ITS tools.
[2022-05-16 07:35:15] [INFO ] Flatten gal took : 10 ms
[2022-05-16 07:35:15] [INFO ] Applying decomposition
[2022-05-16 07:35:15] [INFO ] Flatten gal took : 10 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/graph10113696927538999287.txt' '-o' '/tmp/graph10113696927538999287.bin' '-w' '/tmp/graph10113696927538999287.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10113696927538999287.bin' '-l' '-1' '-v' '-w' '/tmp/graph10113696927538999287.weights' '-q' '0' '-e' '0.001'
[2022-05-16 07:35:15] [INFO ] Decomposing Gal with order
[2022-05-16 07:35:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 07:35:15] [INFO ] Flatten gal took : 17 ms
[2022-05-16 07:35:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 07:35:15] [INFO ] Time to serialize gal into /tmp/LTL18028438790693824116.gal : 4 ms
[2022-05-16 07:35:15] [INFO ] Time to serialize properties into /tmp/LTL17134138588464660259.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/LTL18028438790693824116.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17134138588464660259.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/LTL1802843...247
Read 1 LTL properties
Checking formula 0 : !(((F(X(F(G("((i5.i1.i1.u132.Section_103>=1)&&(i5.i1.i1.u132.F104>=1))")))))||((F("((i12.i0.i2.u23.F234>=1)&&(i12.i0.i2.u194.Section_2...234
Formula 0 simplified : !(FXFG"((i5.i1.i1.u132.Section_103>=1)&&(i5.i1.i1.u132.F104>=1))" | (F"((i12.i0.i2.u23.F234>=1)&&(i12.i0.i2.u194.Section_233>=1))" &...218
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16215576574250212832
[2022-05-16 07:35:30] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16215576574250212832
Running compilation step : cd /tmp/ltsmin16215576574250212832;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 458 ms.
Running link step : cd /tmp/ltsmin16215576574250212832;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16215576574250212832;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(X(<>([]((LTLAPp0==true)))))||(<>((LTLAPp1==true))&&<>((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-384-LTLFireability-09 finished in 97720 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&G((p1 U p2))))'
Support contains 6 out of 651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 384/384 transitions.
Applied a total of 0 rules in 14 ms. Remains 651 /651 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 651 cols
[2022-05-16 07:35:45] [INFO ] Computed 268 place invariants in 8 ms
[2022-05-16 07:35:45] [INFO ] Implicit Places using invariants in 341 ms returned [21, 301, 328, 346, 471, 496, 612, 615, 619, 628]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 342 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 641/651 places, 384/384 transitions.
Applied a total of 0 rules in 9 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 641/651 places, 384/384 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(OR p2 p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(OR p2 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s26 1) (GEQ s238 1)), p1:(AND (GEQ s106 1) (GEQ s508 1)), p0:(AND (GEQ s120 1) (GEQ s319 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 64 steps with 1 reset in 6 ms.
FORMULA CircularTrains-PT-384-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLFireability-10 finished in 574 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p0)))||G(p1)||G(p0)||p2)))'
Support contains 6 out of 651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 384/384 transitions.
Applied a total of 0 rules in 15 ms. Remains 651 /651 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 651 cols
[2022-05-16 07:35:46] [INFO ] Computed 268 place invariants in 5 ms
[2022-05-16 07:35:46] [INFO ] Implicit Places using invariants in 320 ms returned [21, 27, 301, 328, 346, 471, 496, 612, 615, 619, 628]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 321 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 640/651 places, 384/384 transitions.
Applied a total of 0 rules in 8 ms. Remains 640 /640 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 640/651 places, 384/384 transitions.
Stuttering acceptance computed with spot in 340 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(AND (GEQ s545 1) (GEQ s639 1)), p2:(AND (GEQ s129 1) (GEQ s271 1)), p1:(AND (GEQ s144 1) (GEQ s462 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24388 reset in 1670 ms.
Product exploration explored 100000 steps with 26090 reset in 1796 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) p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), true]
False Knowledge obtained : [(X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 185 ms. Reduced automaton from 6 states, 9 edges and 3 AP to 5 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 612 steps, including 0 resets, run visited all 5 properties in 16 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), true]
False Knowledge obtained : [(X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (X (NOT p1))), (X (X p1)), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1))), (F p0), (F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 3 factoid took 277 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 5 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 640/640 places, 384/384 transitions.
Applied a total of 0 rules in 14 ms. Remains 640 /640 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 640 cols
[2022-05-16 07:35:51] [INFO ] Computed 257 place invariants in 4 ms
[2022-05-16 07:35:51] [INFO ] Implicit Places using invariants in 287 ms returned []
// Phase 1: matrix 384 rows 640 cols
[2022-05-16 07:35:51] [INFO ] Computed 257 place invariants in 3 ms
[2022-05-16 07:35:52] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
// Phase 1: matrix 384 rows 640 cols
[2022-05-16 07:35:52] [INFO ] Computed 257 place invariants in 3 ms
[2022-05-16 07:35:52] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 640/640 places, 384/384 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 107 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 5 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 151 steps, including 0 resets, run visited all 5 properties in 13 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) p2 p1)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p1))), (X (X p1)), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1))), (F p0), (F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 1 factoid took 202 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 5 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 24221 reset in 1680 ms.
Product exploration explored 100000 steps with 23657 reset in 1774 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 640/640 places, 384/384 transitions.
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 640 transition count 384
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 126 place count 640 transition count 384
Deduced a syphon composed of 128 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 640 transition count 384
Deduced a syphon composed of 128 places in 0 ms
Applied a total of 128 rules in 25 ms. Remains 640 /640 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2022-05-16 07:35:57] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 384 rows 640 cols
[2022-05-16 07:35:57] [INFO ] Computed 257 place invariants in 7 ms
[2022-05-16 07:35:57] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 640/640 places, 384/384 transitions.
Finished structural reductions, in 1 iterations. Remains : 640/640 places, 384/384 transitions.
Product exploration explored 100000 steps with 32930 reset in 1804 ms.
Product exploration explored 100000 steps with 32287 reset in 1892 ms.
Built C files in :
/tmp/ltsmin4526377847275540408
[2022-05-16 07:36:01] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4526377847275540408
Running compilation step : cd /tmp/ltsmin4526377847275540408;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 618 ms.
Running link step : cd /tmp/ltsmin4526377847275540408;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4526377847275540408;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8272918042166080970.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 640/640 places, 384/384 transitions.
Applied a total of 0 rules in 17 ms. Remains 640 /640 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 640 cols
[2022-05-16 07:36:16] [INFO ] Computed 257 place invariants in 3 ms
[2022-05-16 07:36:16] [INFO ] Implicit Places using invariants in 322 ms returned []
// Phase 1: matrix 384 rows 640 cols
[2022-05-16 07:36:16] [INFO ] Computed 257 place invariants in 2 ms
[2022-05-16 07:36:16] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
// Phase 1: matrix 384 rows 640 cols
[2022-05-16 07:36:16] [INFO ] Computed 257 place invariants in 4 ms
[2022-05-16 07:36:17] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 640/640 places, 384/384 transitions.
Built C files in :
/tmp/ltsmin8941422920781881949
[2022-05-16 07:36:17] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8941422920781881949
Running compilation step : cd /tmp/ltsmin8941422920781881949;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 609 ms.
Running link step : cd /tmp/ltsmin8941422920781881949;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8941422920781881949;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2367991632579379329.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 07:36:32] [INFO ] Flatten gal took : 32 ms
[2022-05-16 07:36:32] [INFO ] Flatten gal took : 11 ms
[2022-05-16 07:36:32] [INFO ] Time to serialize gal into /tmp/LTL1937623849961546965.gal : 2 ms
[2022-05-16 07:36:32] [INFO ] Time to serialize properties into /tmp/LTL12465428532684765871.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/LTL1937623849961546965.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12465428532684765871.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/LTL1937623...267
Read 1 LTL properties
Checking formula 0 : !((X(((X(X(F("((F369>=1)&&(Section_368>=1))"))))||(G("((Section_135>=1)&&(F136>=1))")))||((G("((F369>=1)&&(Section_368>=1))"))||("((Se...184
Formula 0 simplified : !X("((Section_96>=1)&&(F97>=1))" | XXF"((F369>=1)&&(Section_368>=1))" | G"((Section_135>=1)&&(F136>=1))" | G"((F369>=1)&&(Section_36...163
Detected timeout of ITS tools.
[2022-05-16 07:36:47] [INFO ] Flatten gal took : 13 ms
[2022-05-16 07:36:47] [INFO ] Applying decomposition
[2022-05-16 07:36:47] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4786018909809972708.txt' '-o' '/tmp/graph4786018909809972708.bin' '-w' '/tmp/graph4786018909809972708.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4786018909809972708.bin' '-l' '-1' '-v' '-w' '/tmp/graph4786018909809972708.weights' '-q' '0' '-e' '0.001'
[2022-05-16 07:36:47] [INFO ] Decomposing Gal with order
[2022-05-16 07:36:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 07:36:47] [INFO ] Flatten gal took : 15 ms
[2022-05-16 07:36:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 07:36:47] [INFO ] Time to serialize gal into /tmp/LTL17757607951869621363.gal : 4 ms
[2022-05-16 07:36:47] [INFO ] Time to serialize properties into /tmp/LTL16643521015963823010.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/LTL17757607951869621363.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16643521015963823010.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/LTL1775760...247
Read 1 LTL properties
Checking formula 0 : !((X(((X(X(F("((i2.i1.u116.F369>=1)&&(i10.i1.u78.Section_368>=1))"))))||(G("((i15.i0.u115.Section_135>=1)&&(i15.i0.u115.F136>=1))")))|...274
Formula 0 simplified : !X("((i5.i1.u109.Section_96>=1)&&(i5.i1.u109.F97>=1))" | XXF"((i2.i1.u116.F369>=1)&&(i10.i1.u78.Section_368>=1))" | G"((i15.i0.u115....253
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8754748115141151313
[2022-05-16 07:37:02] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8754748115141151313
Running compilation step : cd /tmp/ltsmin8754748115141151313;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 591 ms.
Running link step : cd /tmp/ltsmin8754748115141151313;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin8754748115141151313;'/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(X(<>((LTLAPp0==true))))||[]((LTLAPp1==true))||[]((LTLAPp0==true))||(LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-384-LTLFireability-11 finished in 91531 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||p1))))'
Support contains 4 out of 651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 651/651 places, 384/384 transitions.
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 107 place count 651 transition count 277
Reduce places removed 107 places and 0 transitions.
Iterating post reduction 1 with 107 rules applied. Total rules applied 214 place count 544 transition count 277
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 214 place count 544 transition count 269
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 230 place count 536 transition count 269
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 250 place count 526 transition count 259
Applied a total of 250 rules in 27 ms. Remains 526 /651 variables (removed 125) and now considering 259/384 (removed 125) transitions.
// Phase 1: matrix 259 rows 526 cols
[2022-05-16 07:37:17] [INFO ] Computed 268 place invariants in 7 ms
[2022-05-16 07:37:17] [INFO ] Implicit Places using invariants in 293 ms returned [24, 249, 271, 285, 381, 398, 493, 496, 500]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 295 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 517/651 places, 259/384 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 517 transition count 258
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 516 transition count 258
Applied a total of 2 rules in 11 ms. Remains 516 /517 variables (removed 1) and now considering 258/259 (removed 1) transitions.
// Phase 1: matrix 258 rows 516 cols
[2022-05-16 07:37:17] [INFO ] Computed 259 place invariants in 5 ms
[2022-05-16 07:37:18] [INFO ] Implicit Places using invariants in 278 ms returned []
// Phase 1: matrix 258 rows 516 cols
[2022-05-16 07:37:18] [INFO ] Computed 259 place invariants in 4 ms
[2022-05-16 07:37:18] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 516/651 places, 258/384 transitions.
Finished structural reductions, in 2 iterations. Remains : 516/651 places, 258/384 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-12 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:(AND (GEQ s18 1) (GEQ s209 1)), p1:(AND (GEQ s385 1) (GEQ s498 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 987 reset in 1764 ms.
Product exploration explored 100000 steps with 1015 reset in 1880 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))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 1 factoid took 283 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 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 30 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 1 factoid took 191 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 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 258 rows 516 cols
[2022-05-16 07:37:23] [INFO ] Computed 259 place invariants in 5 ms
[2022-05-16 07:37:23] [INFO ] [Real]Absence check using 255 positive place invariants in 84 ms returned sat
[2022-05-16 07:37:23] [INFO ] [Real]Absence check using 255 positive and 4 generalized place invariants in 42 ms returned sat
[2022-05-16 07:37:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:37:24] [INFO ] [Real]Absence check using state equation in 875 ms returned sat
[2022-05-16 07:37:24] [INFO ] Computed and/alt/rep : 130/258/130 causal constraints (skipped 0 transitions) in 14 ms.
[2022-05-16 07:37:26] [INFO ] Added : 127 causal constraints over 26 iterations in 2028 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 258/258 transitions.
Applied a total of 0 rules in 11 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
// Phase 1: matrix 258 rows 516 cols
[2022-05-16 07:37:26] [INFO ] Computed 259 place invariants in 4 ms
[2022-05-16 07:37:26] [INFO ] Implicit Places using invariants in 306 ms returned []
// Phase 1: matrix 258 rows 516 cols
[2022-05-16 07:37:26] [INFO ] Computed 259 place invariants in 2 ms
[2022-05-16 07:37:27] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
[2022-05-16 07:37:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 258 rows 516 cols
[2022-05-16 07:37:27] [INFO ] Computed 259 place invariants in 2 ms
[2022-05-16 07:37:27] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 516/516 places, 258/258 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 1 factoid took 275 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 59 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 7 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 1 factoid took 229 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 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 258 rows 516 cols
[2022-05-16 07:37:28] [INFO ] Computed 259 place invariants in 3 ms
[2022-05-16 07:37:28] [INFO ] [Real]Absence check using 255 positive place invariants in 84 ms returned sat
[2022-05-16 07:37:28] [INFO ] [Real]Absence check using 255 positive and 4 generalized place invariants in 44 ms returned sat
[2022-05-16 07:37:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:37:29] [INFO ] [Real]Absence check using state equation in 894 ms returned sat
[2022-05-16 07:37:29] [INFO ] Computed and/alt/rep : 130/258/130 causal constraints (skipped 0 transitions) in 14 ms.
[2022-05-16 07:37:31] [INFO ] Added : 127 causal constraints over 26 iterations in 2083 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1045 reset in 1822 ms.
Product exploration explored 100000 steps with 1023 reset in 1925 ms.
Built C files in :
/tmp/ltsmin9001236152452746979
[2022-05-16 07:37:35] [INFO ] Computing symmetric may disable matrix : 258 transitions.
[2022-05-16 07:37:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:37:35] [INFO ] Computing symmetric may enable matrix : 258 transitions.
[2022-05-16 07:37:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:37:35] [INFO ] Computing Do-Not-Accords matrix : 258 transitions.
[2022-05-16 07:37:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:37:35] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9001236152452746979
Running compilation step : cd /tmp/ltsmin9001236152452746979;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 564 ms.
Running link step : cd /tmp/ltsmin9001236152452746979;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9001236152452746979;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16963125430608068135.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 258/258 transitions.
Applied a total of 0 rules in 17 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
// Phase 1: matrix 258 rows 516 cols
[2022-05-16 07:37:50] [INFO ] Computed 259 place invariants in 7 ms
[2022-05-16 07:37:50] [INFO ] Implicit Places using invariants in 282 ms returned []
// Phase 1: matrix 258 rows 516 cols
[2022-05-16 07:37:50] [INFO ] Computed 259 place invariants in 5 ms
[2022-05-16 07:37:51] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
[2022-05-16 07:37:51] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 258 rows 516 cols
[2022-05-16 07:37:51] [INFO ] Computed 259 place invariants in 3 ms
[2022-05-16 07:37:51] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 516/516 places, 258/258 transitions.
Built C files in :
/tmp/ltsmin15019709466527951406
[2022-05-16 07:37:51] [INFO ] Computing symmetric may disable matrix : 258 transitions.
[2022-05-16 07:37:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:37:51] [INFO ] Computing symmetric may enable matrix : 258 transitions.
[2022-05-16 07:37:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:37:51] [INFO ] Computing Do-Not-Accords matrix : 258 transitions.
[2022-05-16 07:37:51] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:37:51] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15019709466527951406
Running compilation step : cd /tmp/ltsmin15019709466527951406;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 542 ms.
Running link step : cd /tmp/ltsmin15019709466527951406;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15019709466527951406;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12246721979166508830.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 07:38:06] [INFO ] Flatten gal took : 10 ms
[2022-05-16 07:38:06] [INFO ] Flatten gal took : 9 ms
[2022-05-16 07:38:06] [INFO ] Time to serialize gal into /tmp/LTL17314803600251617412.gal : 1 ms
[2022-05-16 07:38:06] [INFO ] Time to serialize properties into /tmp/LTL4961637171700828381.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/LTL17314803600251617412.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4961637171700828381.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/LTL1731480...267
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((F380>=1)&&(Section_379>=1))"))||("((Section_19>=1)&&(F20>=1))")))))
Formula 0 simplified : !GF("((Section_19>=1)&&(F20>=1))" | G"((F380>=1)&&(Section_379>=1))")
Detected timeout of ITS tools.
[2022-05-16 07:38:21] [INFO ] Flatten gal took : 12 ms
[2022-05-16 07:38:21] [INFO ] Applying decomposition
[2022-05-16 07:38:21] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph551959367198991750.txt' '-o' '/tmp/graph551959367198991750.bin' '-w' '/tmp/graph551959367198991750.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph551959367198991750.bin' '-l' '-1' '-v' '-w' '/tmp/graph551959367198991750.weights' '-q' '0' '-e' '0.001'
[2022-05-16 07:38:21] [INFO ] Decomposing Gal with order
[2022-05-16 07:38:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 07:38:21] [INFO ] Flatten gal took : 16 ms
[2022-05-16 07:38:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-16 07:38:21] [INFO ] Time to serialize gal into /tmp/LTL17405959846446673976.gal : 4 ms
[2022-05-16 07:38:21] [INFO ] Time to serialize properties into /tmp/LTL14226276192804861280.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/LTL17405959846446673976.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14226276192804861280.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/LTL1740595...247
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((i14.i0.i0.u137.F380>=1)&&(i14.i0.i0.u137.Section_379>=1))"))||("((i13.i0.i0.u73.Section_19>=1)&&(i13.i0.i0.u73.F20>=1))")...159
Formula 0 simplified : !GF("((i13.i0.i0.u73.Section_19>=1)&&(i13.i0.i0.u73.F20>=1))" | G"((i14.i0.i0.u137.F380>=1)&&(i14.i0.i0.u137.Section_379>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10937802441489010206
[2022-05-16 07:38:36] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10937802441489010206
Running compilation step : cd /tmp/ltsmin10937802441489010206;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 472 ms.
Running link step : cd /tmp/ltsmin10937802441489010206;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10937802441489010206;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp0==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-384-LTLFireability-12 finished in 94053 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(F(X((F(p0)||p0)))))&&G(p1)))))'
Support contains 4 out of 651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 384/384 transitions.
Applied a total of 0 rules in 9 ms. Remains 651 /651 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 651 cols
[2022-05-16 07:38:51] [INFO ] Computed 268 place invariants in 6 ms
[2022-05-16 07:38:52] [INFO ] Implicit Places using invariants in 335 ms returned [21, 27, 301, 328, 346, 471, 496, 612, 615, 619, 628]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 336 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 640/651 places, 384/384 transitions.
Applied a total of 0 rules in 8 ms. Remains 640 /640 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 640/651 places, 384/384 transitions.
Stuttering acceptance computed with spot in 327 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 6}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 6}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 5}]], initial=7, aps=[p1:(AND (GEQ s332 1) (GEQ s553 1)), p0:(AND (GEQ s145 1) (GEQ s559 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 115 steps with 0 reset in 8 ms.
FORMULA CircularTrains-PT-384-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLFireability-13 finished in 712 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!(p1 U p2)||p0))))'
Support contains 6 out of 651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 384/384 transitions.
Applied a total of 0 rules in 13 ms. Remains 651 /651 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 651 cols
[2022-05-16 07:38:52] [INFO ] Computed 268 place invariants in 4 ms
[2022-05-16 07:38:52] [INFO ] Implicit Places using invariants in 322 ms returned [21, 27, 328, 346, 471, 496, 612, 615, 628]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 323 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 642/651 places, 384/384 transitions.
Applied a total of 0 rules in 10 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 642/651 places, 384/384 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p2:(AND (GEQ s29 1) (GEQ s280 1)), p1:(AND (GEQ s299 1) (GEQ s523 1)), p0:(OR (LT s118 1) (LT s611 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 1 reset in 0 ms.
FORMULA CircularTrains-PT-384-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLFireability-14 finished in 526 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(G(p0) U G(!p1)) U G(p2)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a CL insensitive property : CircularTrains-PT-384-LTLFireability-06
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 651 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 651/651 places, 384/384 transitions.
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 107 place count 651 transition count 277
Reduce places removed 107 places and 0 transitions.
Iterating post reduction 1 with 107 rules applied. Total rules applied 214 place count 544 transition count 277
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 214 place count 544 transition count 268
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 232 place count 535 transition count 268
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 252 place count 525 transition count 258
Applied a total of 252 rules in 58 ms. Remains 525 /651 variables (removed 126) and now considering 258/384 (removed 126) transitions.
// Phase 1: matrix 258 rows 525 cols
[2022-05-16 07:38:53] [INFO ] Computed 268 place invariants in 4 ms
[2022-05-16 07:38:53] [INFO ] Implicit Places using invariants in 406 ms returned [18, 24, 249, 271, 285, 381, 397, 492, 495, 499, 507]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 407 ms to find 11 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 514/651 places, 258/384 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 514 transition count 257
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 513 transition count 256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 512 transition count 256
Applied a total of 4 rules in 11 ms. Remains 512 /514 variables (removed 2) and now considering 256/258 (removed 2) transitions.
// Phase 1: matrix 256 rows 512 cols
[2022-05-16 07:38:53] [INFO ] Computed 257 place invariants in 3 ms
[2022-05-16 07:38:54] [INFO ] Implicit Places using invariants in 370 ms returned []
// Phase 1: matrix 256 rows 512 cols
[2022-05-16 07:38:54] [INFO ] Computed 257 place invariants in 5 ms
[2022-05-16 07:38:54] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 888 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 512/651 places, 256/384 transitions.
Finished structural reductions, in 2 iterations. Remains : 512/651 places, 256/384 transitions.
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s263 1) (GEQ s415 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 14475 reset in 1784 ms.
Product exploration explored 100000 steps with 14960 reset in 1911 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]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 53 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=26 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 195 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 512 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 512/512 places, 256/256 transitions.
Applied a total of 0 rules in 9 ms. Remains 512 /512 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 512 cols
[2022-05-16 07:38:59] [INFO ] Computed 257 place invariants in 5 ms
[2022-05-16 07:38:59] [INFO ] Implicit Places using invariants in 577 ms returned []
// Phase 1: matrix 256 rows 512 cols
[2022-05-16 07:38:59] [INFO ] Computed 257 place invariants in 2 ms
[2022-05-16 07:39:00] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 1003 ms to find 0 implicit places.
// Phase 1: matrix 256 rows 512 cols
[2022-05-16 07:39:00] [INFO ] Computed 257 place invariants in 2 ms
[2022-05-16 07:39:00] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 512/512 places, 256/256 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]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=6 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14606 reset in 1738 ms.
Product exploration explored 100000 steps with 16454 reset in 1872 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 512 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 512/512 places, 256/256 transitions.
Applied a total of 0 rules in 13 ms. Remains 512 /512 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2022-05-16 07:39:04] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 256 rows 512 cols
[2022-05-16 07:39:04] [INFO ] Computed 257 place invariants in 5 ms
[2022-05-16 07:39:04] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 512/512 places, 256/256 transitions.
Product exploration explored 100000 steps with 15137 reset in 2682 ms.
Product exploration explored 100000 steps with 14795 reset in 2755 ms.
Built C files in :
/tmp/ltsmin15845033740504586105
[2022-05-16 07:39:10] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15845033740504586105
Running compilation step : cd /tmp/ltsmin15845033740504586105;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 443 ms.
Running link step : cd /tmp/ltsmin15845033740504586105;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin15845033740504586105;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14199219909088108728.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 512 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 512/512 places, 256/256 transitions.
Applied a total of 0 rules in 11 ms. Remains 512 /512 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 512 cols
[2022-05-16 07:39:25] [INFO ] Computed 257 place invariants in 6 ms
[2022-05-16 07:39:25] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 256 rows 512 cols
[2022-05-16 07:39:25] [INFO ] Computed 257 place invariants in 2 ms
[2022-05-16 07:39:26] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
// Phase 1: matrix 256 rows 512 cols
[2022-05-16 07:39:26] [INFO ] Computed 257 place invariants in 3 ms
[2022-05-16 07:39:26] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 512/512 places, 256/256 transitions.
Built C files in :
/tmp/ltsmin3844177193630197540
[2022-05-16 07:39:26] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3844177193630197540
Running compilation step : cd /tmp/ltsmin3844177193630197540;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 491 ms.
Running link step : cd /tmp/ltsmin3844177193630197540;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3844177193630197540;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15204207099178074008.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 07:39:41] [INFO ] Flatten gal took : 11 ms
[2022-05-16 07:39:41] [INFO ] Flatten gal took : 9 ms
[2022-05-16 07:39:41] [INFO ] Time to serialize gal into /tmp/LTL7087666222100263251.gal : 1 ms
[2022-05-16 07:39:41] [INFO ] Time to serialize properties into /tmp/LTL3639234834332174362.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/LTL7087666222100263251.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3639234834332174362.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/LTL7087666...266
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((F103>=1)&&(Section_102>=1))")))))
Formula 0 simplified : !XXF"((F103>=1)&&(Section_102>=1))"
Detected timeout of ITS tools.
[2022-05-16 07:39:56] [INFO ] Flatten gal took : 14 ms
[2022-05-16 07:39:56] [INFO ] Applying decomposition
[2022-05-16 07:39:56] [INFO ] Flatten gal took : 8 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/graph4337818433310987078.txt' '-o' '/tmp/graph4337818433310987078.bin' '-w' '/tmp/graph4337818433310987078.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4337818433310987078.bin' '-l' '-1' '-v' '-w' '/tmp/graph4337818433310987078.weights' '-q' '0' '-e' '0.001'
[2022-05-16 07:39:56] [INFO ] Decomposing Gal with order
[2022-05-16 07:39:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 07:39:56] [INFO ] Flatten gal took : 14 ms
[2022-05-16 07:39:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 07:39:56] [INFO ] Time to serialize gal into /tmp/LTL13750204253240318341.gal : 3 ms
[2022-05-16 07:39:56] [INFO ] Time to serialize properties into /tmp/LTL11105133234607410795.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/LTL13750204253240318341.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11105133234607410795.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/LTL1375020...247
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((i9.i0.i0.u23.F103>=1)&&(i9.i0.i2.u202.Section_102>=1))")))))
Formula 0 simplified : !XXF"((i9.i0.i0.u23.F103>=1)&&(i9.i0.i2.u202.Section_102>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6908931492762035895
[2022-05-16 07:40:11] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6908931492762035895
Running compilation step : cd /tmp/ltsmin6908931492762035895;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 436 ms.
Running link step : cd /tmp/ltsmin6908931492762035895;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6908931492762035895;'/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(<>((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-384-LTLFireability-06 finished in 93742 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!(G((G(p1)&&p0)) U !X(p2)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(F(G(p0))))||(F(p1)&&F(p2))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p0)))||G(p1)||G(p0)||p2)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||p1))))'
[2022-05-16 07:40:27] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11574213529775214169
[2022-05-16 07:40:27] [INFO ] Applying decomposition
[2022-05-16 07:40:27] [INFO ] Computing symmetric may disable matrix : 384 transitions.
[2022-05-16 07:40:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:40:27] [INFO ] Computing symmetric may enable matrix : 384 transitions.
[2022-05-16 07:40:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:40:27] [INFO ] Flatten gal took : 11 ms
[2022-05-16 07:40:27] [INFO ] Computing Do-Not-Accords matrix : 384 transitions.
[2022-05-16 07:40:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:40:27] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11574213529775214169
Running compilation step : cd /tmp/ltsmin11574213529775214169;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '120' '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'
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/graph2980057661083130614.txt' '-o' '/tmp/graph2980057661083130614.bin' '-w' '/tmp/graph2980057661083130614.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2980057661083130614.bin' '-l' '-1' '-v' '-w' '/tmp/graph2980057661083130614.weights' '-q' '0' '-e' '0.001'
[2022-05-16 07:40:27] [INFO ] Decomposing Gal with order
[2022-05-16 07:40:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 07:40:27] [INFO ] Flatten gal took : 15 ms
[2022-05-16 07:40:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 07:40:27] [INFO ] Time to serialize gal into /tmp/LTLFireability8325519837502053100.gal : 3 ms
[2022-05-16 07:40:27] [INFO ] Time to serialize properties into /tmp/LTLFireability14904029335475452156.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/LTLFireability8325519837502053100.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14904029335475452156.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 6 LTL properties
Checking formula 0 : !(((!((G("((i6.i0.u18.Section_334>=1)&&(i6.i0.u25.F335>=1))"))U(G(!("((i17.i0.u53.Section_178>=1)&&(i17.i0.u66.F179>=1))")))))U(G("((i...208
Formula 0 simplified : !(!(G"((i6.i0.u18.Section_334>=1)&&(i6.i0.u25.F335>=1))" U G!"((i17.i0.u53.Section_178>=1)&&(i17.i0.u66.F179>=1))") U G"((i25.i0.u71...196
Compilation finished in 815 ms.
Running link step : cd /tmp/ltsmin11574213529775214169;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin11574213529775214169;'/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)) U [](!(LTLAPp1==true))) U []((LTLAPp2==true)))' '--buchi-type=spotba'
LTSmin run took 64987 ms.
FORMULA CircularTrains-PT-384-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin11574213529775214169;'/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(<>((LTLAPp3==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: LTL layer: formula: X(X(<>((LTLAPp3==true))))
pins2lts-mc-linux64( 1/ 8), 0.007: "X(X(<>((LTLAPp3==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.007: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.025: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.105: DFS-FIFO for weak LTL, using special progress label 400
pins2lts-mc-linux64( 0/ 8), 0.105: There are 401 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.105: State length is 652, there are 387 groups
pins2lts-mc-linux64( 0/ 8), 0.105: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.105: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.105: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.105: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.262: ~4 levels ~960 states ~5120 transitions
pins2lts-mc-linux64( 5/ 8), 1.057: ~124 levels ~1920 states ~115504 transitions
pins2lts-mc-linux64( 5/ 8), 1.747: ~364 levels ~3840 states ~281016 transitions
pins2lts-mc-linux64( 1/ 8), 2.739: ~880 levels ~7680 states ~597808 transitions
pins2lts-mc-linux64( 5/ 8), 3.914: ~1791 levels ~15360 states ~1111112 transitions
pins2lts-mc-linux64( 2/ 8), 5.633: ~3733 levels ~30720 states ~2161280 transitions
pins2lts-mc-linux64( 2/ 8), 8.255: ~7482 levels ~61440 states ~3832056 transitions
pins2lts-mc-linux64( 2/ 8), 10.602: ~12417 levels ~122880 states ~5098760 transitions
pins2lts-mc-linux64( 2/ 8), 12.195: ~12417 levels ~245760 states ~5429968 transitions
pins2lts-mc-linux64( 1/ 8), 15.462: ~12417 levels ~491520 states ~6106128 transitions
pins2lts-mc-linux64( 4/ 8), 22.186: ~12406 levels ~983040 states ~7527360 transitions
pins2lts-mc-linux64( 4/ 8), 35.404: ~12406 levels ~1966080 states ~10431272 transitions
pins2lts-mc-linux64( 4/ 8), 62.103: ~12406 levels ~3932160 states ~16347176 transitions
pins2lts-mc-linux64( 4/ 8), 116.934: ~12406 levels ~7864320 states ~29395272 transitions
pins2lts-mc-linux64( 1/ 8), 229.366: ~12417 levels ~15728640 states ~57221712 transitions
pins2lts-mc-linux64( 7/ 8), 345.591: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 345.605:
pins2lts-mc-linux64( 0/ 8), 345.605: mean standard work distribution: 77.5% (states) 77.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 345.605:
pins2lts-mc-linux64( 0/ 8), 345.605: Explored 14457170 states 52561081 transitions, fanout: 3.636
pins2lts-mc-linux64( 0/ 8), 345.605: Total exploration time 345.500 sec (345.470 sec minimum, 345.487 sec on average)
pins2lts-mc-linux64( 0/ 8), 345.606: States per second: 41844, Transitions per second: 152130
pins2lts-mc-linux64( 0/ 8), 345.606:
pins2lts-mc-linux64( 0/ 8), 345.606: Progress states detected: 32
pins2lts-mc-linux64( 0/ 8), 345.606: Redundant explorations: -17.6441
pins2lts-mc-linux64( 0/ 8), 345.606:
pins2lts-mc-linux64( 0/ 8), 345.606: Queue width: 8B, total height: 62322, memory: 0.48MB
pins2lts-mc-linux64( 0/ 8), 345.606: Tree memory: 389.9MB, 23.3 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 345.606: Tree fill ratio (roots/leafs): 13.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 345.606: Stored 386 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 345.606: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 345.606: Est. total memory use: 390.4MB (~1024.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11574213529775214169;'/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(<>((LTLAPp3==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11574213529775214169;'/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(<>((LTLAPp3==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-16 08:04:34] [INFO ] Flatten gal took : 604 ms
[2022-05-16 08:04:34] [INFO ] Time to serialize gal into /tmp/LTLFireability10763192258312871162.gal : 29 ms
[2022-05-16 08:04:34] [INFO ] Time to serialize properties into /tmp/LTLFireability5269326436502636414.ltl : 9 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/LTLFireability10763192258312871162.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5269326436502636414.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/LTLFireabi...289
Read 5 LTL properties
Checking formula 0 : !((X(X(F("((F103>=1)&&(Section_102>=1))")))))
Formula 0 simplified : !XXF"((F103>=1)&&(Section_102>=1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-16 08:28:29] [INFO ] Flatten gal took : 55 ms
[2022-05-16 08:28:29] [INFO ] Input system was already deterministic with 384 transitions.
[2022-05-16 08:28:29] [INFO ] Transformed 651 places.
[2022-05-16 08:28:29] [INFO ] Transformed 384 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 08:28:30] [INFO ] Time to serialize gal into /tmp/LTLFireability18132326977055566294.gal : 4 ms
[2022-05-16 08:28:30] [INFO ] Time to serialize properties into /tmp/LTLFireability18438112923147148656.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/LTLFireability18132326977055566294.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18438112923147148656.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...335
Read 5 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(F("((F103>=1)&&(Section_102>=1))")))))
Formula 0 simplified : !XXF"((F103>=1)&&(Section_102>=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="CircularTrains-PT-384"
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 CircularTrains-PT-384, 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 r024-tall-165251919000756"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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