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-165251919000748.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-192, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251919000748
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 7.4K Apr 30 07:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 30 07:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 30 07:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 30 07:14 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 3.8K May 9 07:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:13 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 147K 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-192-LTLFireability-00
FORMULA_NAME CircularTrains-PT-192-LTLFireability-01
FORMULA_NAME CircularTrains-PT-192-LTLFireability-02
FORMULA_NAME CircularTrains-PT-192-LTLFireability-03
FORMULA_NAME CircularTrains-PT-192-LTLFireability-04
FORMULA_NAME CircularTrains-PT-192-LTLFireability-05
FORMULA_NAME CircularTrains-PT-192-LTLFireability-06
FORMULA_NAME CircularTrains-PT-192-LTLFireability-07
FORMULA_NAME CircularTrains-PT-192-LTLFireability-08
FORMULA_NAME CircularTrains-PT-192-LTLFireability-09
FORMULA_NAME CircularTrains-PT-192-LTLFireability-10
FORMULA_NAME CircularTrains-PT-192-LTLFireability-11
FORMULA_NAME CircularTrains-PT-192-LTLFireability-12
FORMULA_NAME CircularTrains-PT-192-LTLFireability-13
FORMULA_NAME CircularTrains-PT-192-LTLFireability-14
FORMULA_NAME CircularTrains-PT-192-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652683793674

Running Version 202205111006
[2022-05-16 06:49:54] [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 06:49:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 06:49:55] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2022-05-16 06:49:55] [INFO ] Transformed 384 places.
[2022-05-16 06:49:55] [INFO ] Transformed 192 transitions.
[2022-05-16 06:49:55] [INFO ] Parsed PT model containing 384 places and 192 transitions in 186 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 2 formulas.
FORMULA CircularTrains-PT-192-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-192-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 192/192 transitions.
Applied a total of 0 rules in 50 ms. Remains 384 /384 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 384 cols
[2022-05-16 06:49:55] [INFO ] Computed 193 place invariants in 35 ms
[2022-05-16 06:49:55] [INFO ] Implicit Places using invariants in 420 ms returned [1, 7, 10, 18, 21, 28, 37, 44, 47, 48, 62, 64, 65, 75, 78, 81, 89, 101, 108, 133, 138, 141, 144, 146, 160, 163, 167, 196, 217, 230, 231, 245, 247, 261, 283, 284, 285, 293, 311, 313, 314, 324, 327, 332, 333, 346, 350, 354, 360, 366, 369, 371, 374, 375, 376, 378, 382]
Discarding 57 places :
Implicit Place search using SMT only with invariants took 449 ms to find 57 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 327/384 places, 192/192 transitions.
Applied a total of 0 rules in 10 ms. Remains 327 /327 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 327/384 places, 192/192 transitions.
Support contains 66 out of 327 places after structural reductions.
[2022-05-16 06:49:55] [INFO ] Flatten gal took : 41 ms
[2022-05-16 06:49:55] [INFO ] Flatten gal took : 20 ms
[2022-05-16 06:49:55] [INFO ] Input system was already deterministic with 192 transitions.
Support contains 58 out of 327 places (down from 66) after GAL structural reductions.
Finished random walk after 395 steps, including 0 resets, run visited all 26 properties in 60 ms. (steps per millisecond=6 )
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' '!(X(X(F(p0))))'
Support contains 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Applied a total of 0 rules in 11 ms. Remains 327 /327 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 327 cols
[2022-05-16 06:49:56] [INFO ] Computed 136 place invariants in 13 ms
[2022-05-16 06:49:56] [INFO ] Implicit Places using invariants in 192 ms returned [84, 213, 260, 287, 309, 324]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 194 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 321/327 places, 192/192 transitions.
Applied a total of 0 rules in 19 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 321/327 places, 192/192 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-00 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:(OR (LT s47 1) (LT s304 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 21484 reset in 961 ms.
Product exploration explored 100000 steps with 21690 reset in 903 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 82 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 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 66 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=33 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 100 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 90 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 192/192 transitions.
Applied a total of 0 rules in 10 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 321 cols
[2022-05-16 06:49:59] [INFO ] Computed 130 place invariants in 13 ms
[2022-05-16 06:49:59] [INFO ] Implicit Places using invariants in 244 ms returned []
// Phase 1: matrix 192 rows 321 cols
[2022-05-16 06:49:59] [INFO ] Computed 130 place invariants in 14 ms
[2022-05-16 06:49:59] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
// Phase 1: matrix 192 rows 321 cols
[2022-05-16 06:49:59] [INFO ] Computed 130 place invariants in 7 ms
[2022-05-16 06:49:59] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 321/321 places, 192/192 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 83 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 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 106 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 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20667 reset in 730 ms.
Product exploration explored 100000 steps with 21297 reset in 794 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 192/192 transitions.
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 321 transition count 192
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 63 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 321 transition count 192
Deduced a syphon composed of 63 places in 0 ms
Applied a total of 63 rules in 44 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2022-05-16 06:50:02] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 192 rows 321 cols
[2022-05-16 06:50:02] [INFO ] Computed 130 place invariants in 2 ms
[2022-05-16 06:50:02] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 321/321 places, 192/192 transitions.
Finished structural reductions, in 1 iterations. Remains : 321/321 places, 192/192 transitions.
Product exploration explored 100000 steps with 22846 reset in 1566 ms.
Product exploration explored 100000 steps with 22631 reset in 1560 ms.
Built C files in :
/tmp/ltsmin16774508943084449354
[2022-05-16 06:50:05] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16774508943084449354
Running compilation step : cd /tmp/ltsmin16774508943084449354;'/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 417 ms.
Running link step : cd /tmp/ltsmin16774508943084449354;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16774508943084449354;'/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/stateBased434939719948576054.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 192/192 transitions.
Applied a total of 0 rules in 11 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 321 cols
[2022-05-16 06:50:20] [INFO ] Computed 130 place invariants in 3 ms
[2022-05-16 06:50:20] [INFO ] Implicit Places using invariants in 154 ms returned []
// Phase 1: matrix 192 rows 321 cols
[2022-05-16 06:50:20] [INFO ] Computed 130 place invariants in 2 ms
[2022-05-16 06:50:21] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
// Phase 1: matrix 192 rows 321 cols
[2022-05-16 06:50:21] [INFO ] Computed 130 place invariants in 5 ms
[2022-05-16 06:50:21] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 321/321 places, 192/192 transitions.
Built C files in :
/tmp/ltsmin15503367026594390747
[2022-05-16 06:50:21] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15503367026594390747
Running compilation step : cd /tmp/ltsmin15503367026594390747;'/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 320 ms.
Running link step : cd /tmp/ltsmin15503367026594390747;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin15503367026594390747;'/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/stateBased12300816046849045021.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 06:50:36] [INFO ] Flatten gal took : 13 ms
[2022-05-16 06:50:36] [INFO ] Flatten gal took : 13 ms
[2022-05-16 06:50:36] [INFO ] Time to serialize gal into /tmp/LTL4734023253111857022.gal : 4 ms
[2022-05-16 06:50:36] [INFO ] Time to serialize properties into /tmp/LTL11792894855261150581.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/LTL4734023253111857022.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11792894855261150581.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/LTL4734023...267
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((Section_55<1)||(F56<1))")))))
Formula 0 simplified : !XXF"((Section_55<1)||(F56<1))"
Detected timeout of ITS tools.
[2022-05-16 06:50:51] [INFO ] Flatten gal took : 13 ms
[2022-05-16 06:50:51] [INFO ] Applying decomposition
[2022-05-16 06:50:51] [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/graph14380273430969220629.txt' '-o' '/tmp/graph14380273430969220629.bin' '-w' '/tmp/graph14380273430969220629.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14380273430969220629.bin' '-l' '-1' '-v' '-w' '/tmp/graph14380273430969220629.weights' '-q' '0' '-e' '0.001'
[2022-05-16 06:50:51] [INFO ] Decomposing Gal with order
[2022-05-16 06:50:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 06:50:51] [INFO ] Flatten gal took : 62 ms
[2022-05-16 06:50:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-16 06:50:51] [INFO ] Time to serialize gal into /tmp/LTL2981186677649797180.gal : 3 ms
[2022-05-16 06:50:51] [INFO ] Time to serialize properties into /tmp/LTL1310983484587279401.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/LTL2981186677649797180.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1310983484587279401.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/LTL2981186...245
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((i20.u8.Section_55<1)||(i20.u56.F56<1))")))))
Formula 0 simplified : !XXF"((i20.u8.Section_55<1)||(i20.u56.F56<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12843577845307571736
[2022-05-16 06:51:06] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12843577845307571736
Running compilation step : cd /tmp/ltsmin12843577845307571736;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 331 ms.
Running link step : cd /tmp/ltsmin12843577845307571736;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12843577845307571736;'/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-192-LTLFireability-00 finished in 85510 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 327 transition count 142
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 277 transition count 142
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 100 place count 277 transition count 135
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 114 place count 270 transition count 135
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 124 place count 265 transition count 130
Applied a total of 124 rules in 43 ms. Remains 265 /327 variables (removed 62) and now considering 130/192 (removed 62) transitions.
// Phase 1: matrix 130 rows 265 cols
[2022-05-16 06:51:21] [INFO ] Computed 136 place invariants in 1 ms
[2022-05-16 06:51:21] [INFO ] Implicit Places using invariants in 153 ms returned [70, 174, 208, 230, 248, 249, 262]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 155 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/327 places, 130/192 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 258 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 256 transition count 128
Applied a total of 4 rules in 11 ms. Remains 256 /258 variables (removed 2) and now considering 128/130 (removed 2) transitions.
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:51:22] [INFO ] Computed 129 place invariants in 1 ms
[2022-05-16 06:51:22] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:51:22] [INFO ] Computed 129 place invariants in 2 ms
[2022-05-16 06:51:22] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 256/327 places, 128/192 transitions.
Finished structural reductions, in 2 iterations. Remains : 256/327 places, 128/192 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-02 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 s4 1) (GEQ s240 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 637 ms.
Product exploration explored 100000 steps with 0 reset in 814 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 131 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 41 ms :[(NOT p0)]
Finished random walk after 44 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=11 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 103 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:51:24] [INFO ] Computed 129 place invariants in 1 ms
[2022-05-16 06:51:24] [INFO ] [Real]Absence check using 127 positive place invariants in 24 ms returned sat
[2022-05-16 06:51:24] [INFO ] [Real]Absence check using 127 positive and 2 generalized place invariants in 5 ms returned sat
[2022-05-16 06:51:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:51:24] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2022-05-16 06:51:24] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 06:51:24] [INFO ] Added : 62 causal constraints over 13 iterations in 306 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 128/128 transitions.
Applied a total of 0 rules in 10 ms. Remains 256 /256 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:51:24] [INFO ] Computed 129 place invariants in 1 ms
[2022-05-16 06:51:24] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:51:24] [INFO ] Computed 129 place invariants in 1 ms
[2022-05-16 06:51:25] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2022-05-16 06:51:25] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:51:25] [INFO ] Computed 129 place invariants in 2 ms
[2022-05-16 06:51:25] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 256/256 places, 128/128 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), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 114 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 p0)]
Finished random walk after 31 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 120 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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0)]
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:51:25] [INFO ] Computed 129 place invariants in 5 ms
[2022-05-16 06:51:25] [INFO ] [Real]Absence check using 127 positive place invariants in 25 ms returned sat
[2022-05-16 06:51:25] [INFO ] [Real]Absence check using 127 positive and 2 generalized place invariants in 6 ms returned sat
[2022-05-16 06:51:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:51:25] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2022-05-16 06:51:26] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 06:51:26] [INFO ] Added : 62 causal constraints over 13 iterations in 264 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 628 ms.
Product exploration explored 100000 steps with 0 reset in 779 ms.
Built C files in :
/tmp/ltsmin3526643386107383806
[2022-05-16 06:51:27] [INFO ] Computing symmetric may disable matrix : 128 transitions.
[2022-05-16 06:51:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:51:27] [INFO ] Computing symmetric may enable matrix : 128 transitions.
[2022-05-16 06:51:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:51:27] [INFO ] Computing Do-Not-Accords matrix : 128 transitions.
[2022-05-16 06:51:27] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:51:27] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3526643386107383806
Running compilation step : cd /tmp/ltsmin3526643386107383806;'/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 288 ms.
Running link step : cd /tmp/ltsmin3526643386107383806;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3526643386107383806;'/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/stateBased5763043941160499807.hoa' '--buchi-type=spotba'
LTSmin run took 257 ms.
FORMULA CircularTrains-PT-192-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-192-LTLFireability-02 finished in 6557 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((!X(p0) U X(p0))))))'
Support contains 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Applied a total of 0 rules in 5 ms. Remains 327 /327 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 327 cols
[2022-05-16 06:51:28] [INFO ] Computed 136 place invariants in 3 ms
[2022-05-16 06:51:28] [INFO ] Implicit Places using invariants in 166 ms returned [84, 213, 260, 287, 308, 309, 324]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 167 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 320/327 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 320/327 places, 192/192 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-03 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}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (GEQ s212 1) (GEQ s310 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 735 reset in 728 ms.
Product exploration explored 100000 steps with 748 reset in 775 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 199 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=39 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 192 rows 320 cols
[2022-05-16 06:51:30] [INFO ] Computed 129 place invariants in 1 ms
[2022-05-16 06:51:31] [INFO ] [Real]Absence check using 127 positive place invariants in 30 ms returned sat
[2022-05-16 06:51:31] [INFO ] [Real]Absence check using 127 positive and 2 generalized place invariants in 15 ms returned sat
[2022-05-16 06:51:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:51:31] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2022-05-16 06:51:31] [INFO ] Computed and/alt/rep : 128/192/128 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-16 06:51:32] [INFO ] Added : 125 causal constraints over 25 iterations in 866 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 320 cols
[2022-05-16 06:51:32] [INFO ] Computed 129 place invariants in 4 ms
[2022-05-16 06:51:32] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 192 rows 320 cols
[2022-05-16 06:51:32] [INFO ] Computed 129 place invariants in 1 ms
[2022-05-16 06:51:32] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
// Phase 1: matrix 192 rows 320 cols
[2022-05-16 06:51:32] [INFO ] Computed 129 place invariants in 6 ms
[2022-05-16 06:51:32] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 320/320 places, 192/192 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 95 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=47 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 192 rows 320 cols
[2022-05-16 06:51:33] [INFO ] Computed 129 place invariants in 4 ms
[2022-05-16 06:51:33] [INFO ] [Real]Absence check using 127 positive place invariants in 29 ms returned sat
[2022-05-16 06:51:33] [INFO ] [Real]Absence check using 127 positive and 2 generalized place invariants in 10 ms returned sat
[2022-05-16 06:51:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:51:34] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2022-05-16 06:51:34] [INFO ] Computed and/alt/rep : 128/192/128 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-16 06:51:35] [INFO ] Added : 125 causal constraints over 25 iterations in 851 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 752 reset in 743 ms.
Product exploration explored 100000 steps with 733 reset in 783 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 192/192 transitions.
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 320 transition count 192
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 62 place count 320 transition count 192
Deduced a syphon composed of 64 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 320 transition count 192
Deduced a syphon composed of 64 places in 0 ms
Applied a total of 64 rules in 16 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2022-05-16 06:51:37] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 192 rows 320 cols
[2022-05-16 06:51:37] [INFO ] Computed 129 place invariants in 2 ms
[2022-05-16 06:51:37] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 320/320 places, 192/192 transitions.
Finished structural reductions, in 1 iterations. Remains : 320/320 places, 192/192 transitions.
Product exploration explored 100000 steps with 1375 reset in 843 ms.
Product exploration explored 100000 steps with 1384 reset in 901 ms.
Built C files in :
/tmp/ltsmin3461923548246800129
[2022-05-16 06:51:39] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3461923548246800129
Running compilation step : cd /tmp/ltsmin3461923548246800129;'/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 325 ms.
Running link step : cd /tmp/ltsmin3461923548246800129;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin3461923548246800129;'/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/stateBased3085235895236007485.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 192/192 transitions.
Applied a total of 0 rules in 7 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 320 cols
[2022-05-16 06:51:54] [INFO ] Computed 129 place invariants in 4 ms
[2022-05-16 06:51:54] [INFO ] Implicit Places using invariants in 151 ms returned []
// Phase 1: matrix 192 rows 320 cols
[2022-05-16 06:51:54] [INFO ] Computed 129 place invariants in 1 ms
[2022-05-16 06:51:54] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
// Phase 1: matrix 192 rows 320 cols
[2022-05-16 06:51:54] [INFO ] Computed 129 place invariants in 2 ms
[2022-05-16 06:51:54] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 320/320 places, 192/192 transitions.
Built C files in :
/tmp/ltsmin2024961272791743278
[2022-05-16 06:51:54] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2024961272791743278
Running compilation step : cd /tmp/ltsmin2024961272791743278;'/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 312 ms.
Running link step : cd /tmp/ltsmin2024961272791743278;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2024961272791743278;'/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/stateBased8454841381155287204.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 06:52:09] [INFO ] Flatten gal took : 16 ms
[2022-05-16 06:52:09] [INFO ] Flatten gal took : 10 ms
[2022-05-16 06:52:09] [INFO ] Time to serialize gal into /tmp/LTL8412031516526678024.gal : 13 ms
[2022-05-16 06:52:09] [INFO ] Time to serialize properties into /tmp/LTL12155117647692311343.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/LTL8412031516526678024.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12155117647692311343.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/LTL8412031...267
Read 1 LTL properties
Checking formula 0 : !((X(X(X((!(X("((F63>=1)&&(Section_62>=1))")))U(X("((F63>=1)&&(Section_62>=1))")))))))
Formula 0 simplified : !XXX(!X"((F63>=1)&&(Section_62>=1))" U X"((F63>=1)&&(Section_62>=1))")
Detected timeout of ITS tools.
[2022-05-16 06:52:24] [INFO ] Flatten gal took : 11 ms
[2022-05-16 06:52:24] [INFO ] Applying decomposition
[2022-05-16 06:52:24] [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/graph15179046384551160057.txt' '-o' '/tmp/graph15179046384551160057.bin' '-w' '/tmp/graph15179046384551160057.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15179046384551160057.bin' '-l' '-1' '-v' '-w' '/tmp/graph15179046384551160057.weights' '-q' '0' '-e' '0.001'
[2022-05-16 06:52:24] [INFO ] Decomposing Gal with order
[2022-05-16 06:52:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 06:52:24] [INFO ] Flatten gal took : 14 ms
[2022-05-16 06:52:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-16 06:52:24] [INFO ] Time to serialize gal into /tmp/LTL7377970921615304404.gal : 3 ms
[2022-05-16 06:52:24] [INFO ] Time to serialize properties into /tmp/LTL16178609893806429664.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/LTL7377970921615304404.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16178609893806429664.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/LTL7377970...246
Read 1 LTL properties
Checking formula 0 : !((X(X(X((!(X("((i0.i0.u4.F63>=1)&&(i0.i1.u51.Section_62>=1))")))U(X("((i0.i0.u4.F63>=1)&&(i0.i1.u51.Section_62>=1))")))))))
Formula 0 simplified : !XXX(!X"((i0.i0.u4.F63>=1)&&(i0.i1.u51.Section_62>=1))" U X"((i0.i0.u4.F63>=1)&&(i0.i1.u51.Section_62>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12909085303343078814
[2022-05-16 06:52:39] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12909085303343078814
Running compilation step : cd /tmp/ltsmin12909085303343078814;'/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 312 ms.
Running link step : cd /tmp/ltsmin12909085303343078814;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin12909085303343078814;'/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((!X((LTLAPp0==true)) U X((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-192-LTLFireability-03 finished in 86755 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(p0))))'
Support contains 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 327 transition count 141
Reduce places removed 51 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 52 rules applied. Total rules applied 103 place count 276 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 275 transition count 140
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 104 place count 275 transition count 135
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 114 place count 270 transition count 135
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 124 place count 265 transition count 130
Applied a total of 124 rules in 25 ms. Remains 265 /327 variables (removed 62) and now considering 130/192 (removed 62) transitions.
// Phase 1: matrix 130 rows 265 cols
[2022-05-16 06:52:55] [INFO ] Computed 136 place invariants in 1 ms
[2022-05-16 06:52:55] [INFO ] Implicit Places using invariants in 148 ms returned [70, 174, 208, 230, 248, 249, 262]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 149 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/327 places, 130/192 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 258 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 256 transition count 128
Applied a total of 4 rules in 8 ms. Remains 256 /258 variables (removed 2) and now considering 128/130 (removed 2) transitions.
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:52:55] [INFO ] Computed 129 place invariants in 1 ms
[2022-05-16 06:52:55] [INFO ] Implicit Places using invariants in 124 ms returned []
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:52:55] [INFO ] Computed 129 place invariants in 1 ms
[2022-05-16 06:52:55] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 256/327 places, 128/192 transitions.
Finished structural reductions, in 2 iterations. Remains : 256/327 places, 128/192 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s207 1) (LT s243 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 639 ms.
Product exploration explored 100000 steps with 0 reset in 742 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 p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 129 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 43 ms :[(NOT p0)]
Finished random walk after 172 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=24 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 140 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 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:52:57] [INFO ] Computed 129 place invariants in 3 ms
[2022-05-16 06:52:57] [INFO ] [Real]Absence check using 127 positive place invariants in 25 ms returned sat
[2022-05-16 06:52:57] [INFO ] [Real]Absence check using 127 positive and 2 generalized place invariants in 5 ms returned sat
[2022-05-16 06:52:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:52:57] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2022-05-16 06:52:57] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 06:52:58] [INFO ] Added : 62 causal constraints over 13 iterations in 307 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 128/128 transitions.
Applied a total of 0 rules in 11 ms. Remains 256 /256 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:52:58] [INFO ] Computed 129 place invariants in 1 ms
[2022-05-16 06:52:58] [INFO ] Implicit Places using invariants in 130 ms returned []
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:52:58] [INFO ] Computed 129 place invariants in 1 ms
[2022-05-16 06:52:58] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2022-05-16 06:52:58] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:52:58] [INFO ] Computed 129 place invariants in 4 ms
[2022-05-16 06:52:58] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 256/256 places, 128/128 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 p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 86 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 24 ms :[(NOT p0)]
Finished random walk after 60 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=20 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 136 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:52:58] [INFO ] Computed 129 place invariants in 3 ms
[2022-05-16 06:52:58] [INFO ] [Real]Absence check using 127 positive place invariants in 24 ms returned sat
[2022-05-16 06:52:58] [INFO ] [Real]Absence check using 127 positive and 2 generalized place invariants in 5 ms returned sat
[2022-05-16 06:52:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:52:59] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2022-05-16 06:52:59] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 06:52:59] [INFO ] Added : 62 causal constraints over 13 iterations in 295 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 636 ms.
Product exploration explored 100000 steps with 0 reset in 770 ms.
Built C files in :
/tmp/ltsmin716587612426834428
[2022-05-16 06:53:00] [INFO ] Computing symmetric may disable matrix : 128 transitions.
[2022-05-16 06:53:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:53:00] [INFO ] Computing symmetric may enable matrix : 128 transitions.
[2022-05-16 06:53:00] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:53:00] [INFO ] Computing Do-Not-Accords matrix : 128 transitions.
[2022-05-16 06:53:00] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:53:00] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin716587612426834428
Running compilation step : cd /tmp/ltsmin716587612426834428;'/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 271 ms.
Running link step : cd /tmp/ltsmin716587612426834428;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin716587612426834428;'/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/stateBased5659945955903416772.hoa' '--buchi-type=spotba'
LTSmin run took 390 ms.
FORMULA CircularTrains-PT-192-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-192-LTLFireability-04 finished in 6547 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p0))||G(p1))))'
Support contains 8 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Applied a total of 0 rules in 5 ms. Remains 327 /327 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 327 cols
[2022-05-16 06:53:01] [INFO ] Computed 136 place invariants in 4 ms
[2022-05-16 06:53:01] [INFO ] Implicit Places using invariants in 162 ms returned [84, 213, 287, 308, 309, 324]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 162 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 321/327 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 321/327 places, 192/192 transitions.
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 4}, { cond=(AND p1 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(OR (LT s10 1) (LT s108 1)), p0:(AND (OR (LT s248 1) (LT s293 1)) (GEQ s172 1) (GEQ s258 1) (GEQ s203 1) (GEQ s288 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-192-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-192-LTLFireability-06 finished in 427 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)||p1))))'
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Applied a total of 0 rules in 4 ms. Remains 327 /327 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 327 cols
[2022-05-16 06:53:02] [INFO ] Computed 136 place invariants in 3 ms
[2022-05-16 06:53:02] [INFO ] Implicit Places using invariants in 147 ms returned [84, 213, 260, 287, 308, 309, 324]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 148 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 320/327 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 320/327 places, 192/192 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s244 1) (GEQ s277 1)), p1:(AND (GEQ s175 1) (GEQ s238 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 0 ms.
FORMULA CircularTrains-PT-192-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-192-LTLFireability-07 finished in 311 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(F((G(p0)||F(p1)))))))'
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 327 transition count 140
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 104 place count 275 transition count 140
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 104 place count 275 transition count 136
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 112 place count 271 transition count 136
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 122 place count 266 transition count 131
Applied a total of 122 rules in 23 ms. Remains 266 /327 variables (removed 61) and now considering 131/192 (removed 61) transitions.
// Phase 1: matrix 131 rows 266 cols
[2022-05-16 06:53:02] [INFO ] Computed 136 place invariants in 1 ms
[2022-05-16 06:53:02] [INFO ] Implicit Places using invariants in 129 ms returned [70, 209, 231, 249, 250, 263]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 130 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 260/327 places, 131/192 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 260 transition count 130
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 259 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 258 transition count 129
Applied a total of 4 rules in 8 ms. Remains 258 /260 variables (removed 2) and now considering 129/131 (removed 2) transitions.
// Phase 1: matrix 129 rows 258 cols
[2022-05-16 06:53:02] [INFO ] Computed 130 place invariants in 2 ms
[2022-05-16 06:53:02] [INFO ] Implicit Places using invariants in 127 ms returned []
// Phase 1: matrix 129 rows 258 cols
[2022-05-16 06:53:02] [INFO ] Computed 130 place invariants in 1 ms
[2022-05-16 06:53:02] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 258/327 places, 129/192 transitions.
Finished structural reductions, in 2 iterations. Remains : 258/327 places, 129/192 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s31 1) (GEQ s184 1)), p1:(AND (GEQ s130 1) (GEQ s172 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 761 reset in 760 ms.
Product exploration explored 100000 steps with 760 reset in 810 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))]
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 215 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 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 96 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND 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 (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 198 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 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 258 cols
[2022-05-16 06:53:05] [INFO ] Computed 130 place invariants in 2 ms
[2022-05-16 06:53:05] [INFO ] Implicit Places using invariants in 144 ms returned []
// Phase 1: matrix 129 rows 258 cols
[2022-05-16 06:53:05] [INFO ] Computed 130 place invariants in 1 ms
[2022-05-16 06:53:05] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2022-05-16 06:53:05] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 129 rows 258 cols
[2022-05-16 06:53:05] [INFO ] Computed 130 place invariants in 3 ms
[2022-05-16 06:53:05] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 129/129 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
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 199 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 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 148 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND 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 (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 267 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 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 732 reset in 811 ms.
Product exploration explored 100000 steps with 758 reset in 809 ms.
Built C files in :
/tmp/ltsmin16556828427501014412
[2022-05-16 06:53:08] [INFO ] Computing symmetric may disable matrix : 129 transitions.
[2022-05-16 06:53:08] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:53:08] [INFO ] Computing symmetric may enable matrix : 129 transitions.
[2022-05-16 06:53:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:53:08] [INFO ] Computing Do-Not-Accords matrix : 129 transitions.
[2022-05-16 06:53:08] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:53:08] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16556828427501014412
Running compilation step : cd /tmp/ltsmin16556828427501014412;'/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 270 ms.
Running link step : cd /tmp/ltsmin16556828427501014412;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16556828427501014412;'/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/stateBased3755752509215320258.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 258 cols
[2022-05-16 06:53:23] [INFO ] Computed 130 place invariants in 1 ms
[2022-05-16 06:53:23] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 129 rows 258 cols
[2022-05-16 06:53:23] [INFO ] Computed 130 place invariants in 1 ms
[2022-05-16 06:53:23] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2022-05-16 06:53:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 129 rows 258 cols
[2022-05-16 06:53:23] [INFO ] Computed 130 place invariants in 2 ms
[2022-05-16 06:53:23] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 129/129 transitions.
Built C files in :
/tmp/ltsmin17498190692396607087
[2022-05-16 06:53:23] [INFO ] Computing symmetric may disable matrix : 129 transitions.
[2022-05-16 06:53:23] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:53:23] [INFO ] Computing symmetric may enable matrix : 129 transitions.
[2022-05-16 06:53:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:53:23] [INFO ] Computing Do-Not-Accords matrix : 129 transitions.
[2022-05-16 06:53:23] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:53:23] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17498190692396607087
Running compilation step : cd /tmp/ltsmin17498190692396607087;'/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 280 ms.
Running link step : cd /tmp/ltsmin17498190692396607087;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17498190692396607087;'/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/stateBased5001014947531749651.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 06:53:38] [INFO ] Flatten gal took : 12 ms
[2022-05-16 06:53:38] [INFO ] Flatten gal took : 7 ms
[2022-05-16 06:53:38] [INFO ] Time to serialize gal into /tmp/LTL827918636302827650.gal : 1 ms
[2022-05-16 06:53:38] [INFO ] Time to serialize properties into /tmp/LTL17947784568196321440.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/LTL827918636302827650.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17947784568196321440.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/LTL8279186...266
Read 1 LTL properties
Checking formula 0 : !((G(X(G(F((G("((Section_9>=1)&&(F10>=1))"))||(F("((Section_154>=1)&&(F155>=1))"))))))))
Formula 0 simplified : !GXGF(G"((Section_9>=1)&&(F10>=1))" | F"((Section_154>=1)&&(F155>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-16 06:53:53] [INFO ] Flatten gal took : 9 ms
[2022-05-16 06:53:53] [INFO ] Applying decomposition
[2022-05-16 06:53:53] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7631360742689141003.txt' '-o' '/tmp/graph7631360742689141003.bin' '-w' '/tmp/graph7631360742689141003.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7631360742689141003.bin' '-l' '-1' '-v' '-w' '/tmp/graph7631360742689141003.weights' '-q' '0' '-e' '0.001'
[2022-05-16 06:53:53] [INFO ] Decomposing Gal with order
[2022-05-16 06:53:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 06:53:53] [INFO ] Flatten gal took : 12 ms
[2022-05-16 06:53:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 06:53:53] [INFO ] Time to serialize gal into /tmp/LTL458732668935019911.gal : 3 ms
[2022-05-16 06:53:53] [INFO ] Time to serialize properties into /tmp/LTL16053893218611960564.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/LTL458732668935019911.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16053893218611960564.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/LTL4587326...245
Read 1 LTL properties
Checking formula 0 : !((G(X(G(F((G("((i4.i0.i1.u21.Section_9>=1)&&(i4.i0.i1.u34.F10>=1))"))||(F("((i7.u29.Section_154>=1)&&(i7.u29.F155>=1))"))))))))
Formula 0 simplified : !GXGF(G"((i4.i0.i1.u21.Section_9>=1)&&(i4.i0.i1.u34.F10>=1))" | F"((i7.u29.Section_154>=1)&&(i7.u29.F155>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2687413079776616361
[2022-05-16 06:54:08] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2687413079776616361
Running compilation step : cd /tmp/ltsmin2687413079776616361;'/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 262 ms.
Running link step : cd /tmp/ltsmin2687413079776616361;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2687413079776616361;'/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)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-192-LTLFireability-08 finished in 81678 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 327 transition count 141
Reduce places removed 51 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 52 rules applied. Total rules applied 103 place count 276 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 275 transition count 140
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 104 place count 275 transition count 135
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 114 place count 270 transition count 135
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 124 place count 265 transition count 130
Applied a total of 124 rules in 31 ms. Remains 265 /327 variables (removed 62) and now considering 130/192 (removed 62) transitions.
// Phase 1: matrix 130 rows 265 cols
[2022-05-16 06:54:24] [INFO ] Computed 136 place invariants in 1 ms
[2022-05-16 06:54:24] [INFO ] Implicit Places using invariants in 140 ms returned [70, 174, 208, 230, 248, 249, 262]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 141 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/327 places, 130/192 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 258 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 256 transition count 128
Applied a total of 4 rules in 6 ms. Remains 256 /258 variables (removed 2) and now considering 128/130 (removed 2) transitions.
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:54:24] [INFO ] Computed 129 place invariants in 2 ms
[2022-05-16 06:54:24] [INFO ] Implicit Places using invariants in 144 ms returned []
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:54:24] [INFO ] Computed 129 place invariants in 1 ms
[2022-05-16 06:54:24] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 256/327 places, 128/192 transitions.
Finished structural reductions, in 2 iterations. Remains : 256/327 places, 128/192 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s113 1) (LT s177 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 630 ms.
Product exploration explored 100000 steps with 0 reset in 735 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 p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 109 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 p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 116 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 p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:54:26] [INFO ] Computed 129 place invariants in 2 ms
[2022-05-16 06:54:26] [INFO ] [Real]Absence check using 127 positive place invariants in 24 ms returned sat
[2022-05-16 06:54:26] [INFO ] [Real]Absence check using 127 positive and 2 generalized place invariants in 7 ms returned sat
[2022-05-16 06:54:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:54:26] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2022-05-16 06:54:26] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 06:54:26] [INFO ] Added : 62 causal constraints over 13 iterations in 289 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 256 /256 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:54:26] [INFO ] Computed 129 place invariants in 1 ms
[2022-05-16 06:54:27] [INFO ] Implicit Places using invariants in 158 ms returned []
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:54:27] [INFO ] Computed 129 place invariants in 2 ms
[2022-05-16 06:54:27] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2022-05-16 06:54:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:54:27] [INFO ] Computed 129 place invariants in 1 ms
[2022-05-16 06:54:27] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 256/256 places, 128/128 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 p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 104 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 29 ms :[(NOT p0)]
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 133 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:54:27] [INFO ] Computed 129 place invariants in 2 ms
[2022-05-16 06:54:27] [INFO ] [Real]Absence check using 127 positive place invariants in 28 ms returned sat
[2022-05-16 06:54:27] [INFO ] [Real]Absence check using 127 positive and 2 generalized place invariants in 7 ms returned sat
[2022-05-16 06:54:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:54:28] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2022-05-16 06:54:28] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 06:54:28] [INFO ] Added : 62 causal constraints over 13 iterations in 302 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 634 ms.
Product exploration explored 100000 steps with 0 reset in 761 ms.
Built C files in :
/tmp/ltsmin4232596571348637974
[2022-05-16 06:54:29] [INFO ] Computing symmetric may disable matrix : 128 transitions.
[2022-05-16 06:54:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:54:29] [INFO ] Computing symmetric may enable matrix : 128 transitions.
[2022-05-16 06:54:29] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:54:29] [INFO ] Computing Do-Not-Accords matrix : 128 transitions.
[2022-05-16 06:54:29] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:54:29] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4232596571348637974
Running compilation step : cd /tmp/ltsmin4232596571348637974;'/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 264 ms.
Running link step : cd /tmp/ltsmin4232596571348637974;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4232596571348637974;'/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/stateBased2523718441751467514.hoa' '--buchi-type=spotba'
LTSmin run took 262 ms.
FORMULA CircularTrains-PT-192-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-192-LTLFireability-09 finished in 6393 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X((X(p0)&&p1)))&&F(p2)))'
Support contains 6 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Applied a total of 0 rules in 5 ms. Remains 327 /327 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 327 cols
[2022-05-16 06:54:30] [INFO ] Computed 136 place invariants in 3 ms
[2022-05-16 06:54:30] [INFO ] Implicit Places using invariants in 164 ms returned [84, 213, 260, 308, 309, 324]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 164 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 321/327 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 321/327 places, 192/192 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p0)), true, (AND p1 (NOT p0))]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s151 1) (GEQ s240 1)), p1:(OR (LT s201 1) (LT s278 1)), p0:(OR (LT s206 1) (LT s284 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 234 steps with 54 reset in 5 ms.
FORMULA CircularTrains-PT-192-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-192-LTLFireability-10 finished in 458 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((G(!p0) U G((p1 U p0))))||G(p2))))'
Support contains 6 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 327 transition count 144
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 49 rules applied. Total rules applied 97 place count 279 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 278 transition count 143
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 98 place count 278 transition count 135
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 114 place count 270 transition count 135
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 122 place count 266 transition count 131
Applied a total of 122 rules in 20 ms. Remains 266 /327 variables (removed 61) and now considering 131/192 (removed 61) transitions.
// Phase 1: matrix 131 rows 266 cols
[2022-05-16 06:54:30] [INFO ] Computed 136 place invariants in 2 ms
[2022-05-16 06:54:31] [INFO ] Implicit Places using invariants in 150 ms returned [70, 174, 209, 231, 249, 250, 263]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 151 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 259/327 places, 131/192 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 259 transition count 129
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 257 transition count 129
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 257 transition count 128
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 256 transition count 128
Applied a total of 6 rules in 6 ms. Remains 256 /259 variables (removed 3) and now considering 128/131 (removed 3) transitions.
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:54:31] [INFO ] Computed 129 place invariants in 1 ms
[2022-05-16 06:54:31] [INFO ] Implicit Places using invariants in 127 ms returned []
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:54:31] [INFO ] Computed 129 place invariants in 1 ms
[2022-05-16 06:54:31] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 256/327 places, 128/192 transitions.
Finished structural reductions, in 2 iterations. Remains : 256/327 places, 128/192 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p2 p1)), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(AND (GEQ s106 1) (GEQ s212 1)), p0:(AND (GEQ s4 1) (GEQ s240 1)), p1:(AND (GEQ s36 1) (GEQ s209 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 220 reset in 779 ms.
Product exploration explored 100000 steps with 226 reset in 832 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 p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (NOT (OR (AND p2 p0) (AND p2 p1)))), (X (NOT (AND p2 (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))))]
False Knowledge obtained : [(X (AND p2 (NOT p0) (NOT p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (OR (AND p2 p0) (AND p2 p1)))), (X (X (NOT (OR (AND p2 p0) (AND p2 p1))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1))))]
Knowledge based reduction with 7 factoid took 501 ms. Reduced automaton from 2 states, 10 edges and 3 AP to 2 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 86 steps, including 0 resets, run visited all 6 properties in 4 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (NOT (OR (AND p2 p0) (AND p2 p1)))), (X (NOT (AND p2 (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))))]
False Knowledge obtained : [(X (AND p2 (NOT p0) (NOT p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (OR (AND p2 p0) (AND p2 p1)))), (X (X (NOT (OR (AND p2 p0) (AND p2 p1))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (F (AND (NOT p0) p2 p1)), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) p1)), (F (OR (AND p0 p2) (AND p2 p1))), (F (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))), (F (NOT (AND (NOT p0) p2 (NOT p1))))]
Knowledge based reduction with 7 factoid took 572 ms. Reduced automaton from 2 states, 10 edges and 3 AP to 2 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 128/128 transitions.
Applied a total of 0 rules in 10 ms. Remains 256 /256 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:54:34] [INFO ] Computed 129 place invariants in 2 ms
[2022-05-16 06:54:34] [INFO ] Implicit Places using invariants in 127 ms returned []
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:54:34] [INFO ] Computed 129 place invariants in 1 ms
[2022-05-16 06:54:34] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2022-05-16 06:54:34] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:54:34] [INFO ] Computed 129 place invariants in 7 ms
[2022-05-16 06:54:34] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 256/256 places, 128/128 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 (NOT p1)), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (OR (AND p0 p2) (AND p2 p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR (AND p0 p2) (AND p2 p1)))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
Knowledge based reduction with 7 factoid took 519 ms. Reduced automaton from 2 states, 10 edges and 3 AP to 2 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 70 steps, including 0 resets, run visited all 6 properties in 9 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (OR (AND p0 p2) (AND p2 p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR (AND p0 p2) (AND p2 p1)))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (OR (AND p0 p2) (AND p1 p2))), (F (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) p2)))]
Knowledge based reduction with 7 factoid took 636 ms. Reduced automaton from 2 states, 10 edges and 3 AP to 2 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 207 reset in 756 ms.
Product exploration explored 100000 steps with 197 reset in 816 ms.
Built C files in :
/tmp/ltsmin14857089755537590535
[2022-05-16 06:54:37] [INFO ] Computing symmetric may disable matrix : 128 transitions.
[2022-05-16 06:54:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:54:37] [INFO ] Computing symmetric may enable matrix : 128 transitions.
[2022-05-16 06:54:37] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:54:37] [INFO ] Computing Do-Not-Accords matrix : 128 transitions.
[2022-05-16 06:54:37] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:54:37] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14857089755537590535
Running compilation step : cd /tmp/ltsmin14857089755537590535;'/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 276 ms.
Running link step : cd /tmp/ltsmin14857089755537590535;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin14857089755537590535;'/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/stateBased6729450381892961358.hoa' '--buchi-type=spotba'
LTSmin run took 488 ms.
FORMULA CircularTrains-PT-192-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-192-LTLFireability-11 finished in 7829 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(F(p0))||p1))))'
Support contains 6 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 327 transition count 142
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 277 transition count 142
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 100 place count 277 transition count 136
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 112 place count 271 transition count 136
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 120 place count 267 transition count 132
Applied a total of 120 rules in 18 ms. Remains 267 /327 variables (removed 60) and now considering 132/192 (removed 60) transitions.
// Phase 1: matrix 132 rows 267 cols
[2022-05-16 06:54:38] [INFO ] Computed 136 place invariants in 1 ms
[2022-05-16 06:54:38] [INFO ] Implicit Places using invariants in 143 ms returned [70, 175, 209, 231, 249, 264]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 144 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 261/327 places, 132/192 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 261 transition count 130
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 259 transition count 130
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 6 place count 258 transition count 129
Applied a total of 6 rules in 8 ms. Remains 258 /261 variables (removed 3) and now considering 129/132 (removed 3) transitions.
// Phase 1: matrix 129 rows 258 cols
[2022-05-16 06:54:38] [INFO ] Computed 130 place invariants in 1 ms
[2022-05-16 06:54:39] [INFO ] Implicit Places using invariants in 127 ms returned []
// Phase 1: matrix 129 rows 258 cols
[2022-05-16 06:54:39] [INFO ] Computed 130 place invariants in 1 ms
[2022-05-16 06:54:39] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 258/327 places, 129/192 transitions.
Finished structural reductions, in 2 iterations. Remains : 258/327 places, 129/192 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (OR (LT s146 1) (LT s228 1)) (OR (LT s242 1) (LT s246 1))), p0:(OR (LT s12 1) (LT s181 1) (LT s242 1) (LT s246 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 411 reset in 719 ms.
Product exploration explored 100000 steps with 432 reset in 773 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 p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 231 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))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 129 rows 258 cols
[2022-05-16 06:54:41] [INFO ] Computed 130 place invariants in 1 ms
[2022-05-16 06:54:41] [INFO ] After 49ms 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 p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 195 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 258 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 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 258 cols
[2022-05-16 06:54:41] [INFO ] Computed 130 place invariants in 3 ms
[2022-05-16 06:54:41] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 129 rows 258 cols
[2022-05-16 06:54:41] [INFO ] Computed 130 place invariants in 1 ms
[2022-05-16 06:54:41] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2022-05-16 06:54:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 129 rows 258 cols
[2022-05-16 06:54:41] [INFO ] Computed 130 place invariants in 1 ms
[2022-05-16 06:54:42] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 129/129 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 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 49 ms :[(NOT p0), (NOT p0)]
Finished random walk after 314 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=44 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 425 reset in 715 ms.
Product exploration explored 100000 steps with 407 reset in 756 ms.
Built C files in :
/tmp/ltsmin16812959465909658796
[2022-05-16 06:54:44] [INFO ] Computing symmetric may disable matrix : 129 transitions.
[2022-05-16 06:54:44] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:54:44] [INFO ] Computing symmetric may enable matrix : 129 transitions.
[2022-05-16 06:54:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:54:44] [INFO ] Computing Do-Not-Accords matrix : 129 transitions.
[2022-05-16 06:54:44] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:54:44] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16812959465909658796
Running compilation step : cd /tmp/ltsmin16812959465909658796;'/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 278 ms.
Running link step : cd /tmp/ltsmin16812959465909658796;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin16812959465909658796;'/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/stateBased12769303759287634726.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 17 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 258 cols
[2022-05-16 06:54:59] [INFO ] Computed 130 place invariants in 2 ms
[2022-05-16 06:54:59] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 129 rows 258 cols
[2022-05-16 06:54:59] [INFO ] Computed 130 place invariants in 2 ms
[2022-05-16 06:54:59] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2022-05-16 06:54:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 129 rows 258 cols
[2022-05-16 06:54:59] [INFO ] Computed 130 place invariants in 1 ms
[2022-05-16 06:54:59] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 129/129 transitions.
Built C files in :
/tmp/ltsmin8171440952605826475
[2022-05-16 06:54:59] [INFO ] Computing symmetric may disable matrix : 129 transitions.
[2022-05-16 06:54:59] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:54:59] [INFO ] Computing symmetric may enable matrix : 129 transitions.
[2022-05-16 06:54:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:54:59] [INFO ] Computing Do-Not-Accords matrix : 129 transitions.
[2022-05-16 06:54:59] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:54:59] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8171440952605826475
Running compilation step : cd /tmp/ltsmin8171440952605826475;'/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 266 ms.
Running link step : cd /tmp/ltsmin8171440952605826475;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8171440952605826475;'/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/stateBased8631975631695317331.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 06:55:14] [INFO ] Flatten gal took : 8 ms
[2022-05-16 06:55:14] [INFO ] Flatten gal took : 6 ms
[2022-05-16 06:55:14] [INFO ] Time to serialize gal into /tmp/LTL16810574983580947600.gal : 2 ms
[2022-05-16 06:55:14] [INFO ] Time to serialize properties into /tmp/LTL357540574309967854.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/LTL16810574983580947600.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL357540574309967854.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/LTL1681057...266
Read 1 LTL properties
Checking formula 0 : !((F(G((G(F("(((F156<1)||(Section_155<1))||((F53<1)||(Section_52<1)))")))||("(((Section_164<1)||(F165<1))&&((F53<1)||(Section_52<1)))"...160
Formula 0 simplified : !FG("(((Section_164<1)||(F165<1))&&((F53<1)||(Section_52<1)))" | GF"(((F156<1)||(Section_155<1))||((F53<1)||(Section_52<1)))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-16 06:55:29] [INFO ] Flatten gal took : 11 ms
[2022-05-16 06:55:29] [INFO ] Applying decomposition
[2022-05-16 06:55:29] [INFO ] Flatten gal took : 6 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/graph3855362395985100071.txt' '-o' '/tmp/graph3855362395985100071.bin' '-w' '/tmp/graph3855362395985100071.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3855362395985100071.bin' '-l' '-1' '-v' '-w' '/tmp/graph3855362395985100071.weights' '-q' '0' '-e' '0.001'
[2022-05-16 06:55:29] [INFO ] Decomposing Gal with order
[2022-05-16 06:55:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 06:55:29] [INFO ] Flatten gal took : 9 ms
[2022-05-16 06:55:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 06:55:29] [INFO ] Time to serialize gal into /tmp/LTL5420269669118227244.gal : 3 ms
[2022-05-16 06:55:29] [INFO ] Time to serialize properties into /tmp/LTL12538174941251172680.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/LTL5420269669118227244.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12538174941251172680.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/LTL5420269...246
Read 1 LTL properties
Checking formula 0 : !((F(G((G(F("(((i0.i1.i0.u23.F156<1)||(i0.i1.i1.u100.Section_155<1))||((i2.i1.i1.u122.F53<1)||(i2.i1.i1.u122.Section_52<1)))")))||("((...268
Formula 0 simplified : !FG("(((i0.i0.i0.u83.Section_164<1)||(i0.i0.i0.u3.F165<1))&&((i2.i1.i1.u122.F53<1)||(i2.i1.i1.u122.Section_52<1)))" | GF"(((i0.i1.i0...257
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9460986924296768861
[2022-05-16 06:55:44] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9460986924296768861
Running compilation step : cd /tmp/ltsmin9460986924296768861;'/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 245 ms.
Running link step : cd /tmp/ltsmin9460986924296768861;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9460986924296768861;'/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-192-LTLFireability-12 finished in 81223 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (X(p1)&&X(p2))))'
Support contains 8 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Applied a total of 0 rules in 11 ms. Remains 327 /327 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 327 cols
[2022-05-16 06:56:00] [INFO ] Computed 136 place invariants in 5 ms
[2022-05-16 06:56:00] [INFO ] Implicit Places using invariants in 177 ms returned [84, 213, 260, 287, 308, 309, 324]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 178 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 320/327 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 320/327 places, 192/192 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (NOT p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=2 dest: 3}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s14 1) (GEQ s282 1)), p1:(OR (AND (GEQ s122 1) (GEQ s183 1)) (NOT (AND (GEQ s248 1) (GEQ s292 1)))), p2:(AND (GEQ s90 1) (GEQ s255 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 327 steps with 163 reset in 5 ms.
FORMULA CircularTrains-PT-192-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-192-LTLFireability-13 finished in 397 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(!(p0 U p1))||p2))))'
Support contains 6 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 327 /327 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 327 cols
[2022-05-16 06:56:00] [INFO ] Computed 136 place invariants in 2 ms
[2022-05-16 06:56:00] [INFO ] Implicit Places using invariants in 151 ms returned [213, 260, 287, 308, 309, 324]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 152 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 321/327 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 321/327 places, 192/192 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (AND p1 (NOT p2)), p1, (AND p1 (NOT p2))]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s250 1) (GEQ s312 1)), p2:(AND (GEQ s24 1) (GEQ s85 1) (GEQ s84 1) (GEQ s169 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 68 steps with 0 reset in 2 ms.
FORMULA CircularTrains-PT-192-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-192-LTLFireability-14 finished in 276 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G(p1)))'
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 327 transition count 142
Reduce places removed 50 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 52 rules applied. Total rules applied 102 place count 277 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 104 place count 275 transition count 140
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 104 place count 275 transition count 135
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 114 place count 270 transition count 135
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 124 place count 265 transition count 130
Applied a total of 124 rules in 17 ms. Remains 265 /327 variables (removed 62) and now considering 130/192 (removed 62) transitions.
// Phase 1: matrix 130 rows 265 cols
[2022-05-16 06:56:00] [INFO ] Computed 136 place invariants in 3 ms
[2022-05-16 06:56:00] [INFO ] Implicit Places using invariants in 148 ms returned [70, 174, 208, 230, 248, 249, 262]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 149 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/327 places, 130/192 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 258 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 256 transition count 128
Applied a total of 4 rules in 5 ms. Remains 256 /258 variables (removed 2) and now considering 128/130 (removed 2) transitions.
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:56:00] [INFO ] Computed 129 place invariants in 1 ms
[2022-05-16 06:56:00] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:56:00] [INFO ] Computed 129 place invariants in 3 ms
[2022-05-16 06:56:01] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 256/327 places, 128/192 transitions.
Finished structural reductions, in 2 iterations. Remains : 256/327 places, 128/192 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s35 1) (GEQ s93 1)), p0:(AND (GEQ s122 1) (GEQ s188 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 680 reset in 727 ms.
Product exploration explored 100000 steps with 667 reset in 784 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 p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 242 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Finished random walk after 108 steps, including 0 resets, run visited all 3 properties in 8 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 3 factoid took 327 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 128/128 transitions.
Applied a total of 0 rules in 7 ms. Remains 256 /256 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:56:03] [INFO ] Computed 129 place invariants in 3 ms
[2022-05-16 06:56:03] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:56:03] [INFO ] Computed 129 place invariants in 3 ms
[2022-05-16 06:56:03] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2022-05-16 06:56:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:56:03] [INFO ] Computed 129 place invariants in 2 ms
[2022-05-16 06:56:04] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 256/256 places, 128/128 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 p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 300 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Finished random walk after 88 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 3 factoid took 323 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 663 reset in 722 ms.
Product exploration explored 100000 steps with 690 reset in 832 ms.
Built C files in :
/tmp/ltsmin14439604251293181664
[2022-05-16 06:56:06] [INFO ] Computing symmetric may disable matrix : 128 transitions.
[2022-05-16 06:56:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:56:06] [INFO ] Computing symmetric may enable matrix : 128 transitions.
[2022-05-16 06:56:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:56:06] [INFO ] Computing Do-Not-Accords matrix : 128 transitions.
[2022-05-16 06:56:06] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:56:06] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14439604251293181664
Running compilation step : cd /tmp/ltsmin14439604251293181664;'/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 272 ms.
Running link step : cd /tmp/ltsmin14439604251293181664;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin14439604251293181664;'/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/stateBased16452082587160502291.hoa' '--buchi-type=spotba'
LTSmin run took 1713 ms.
FORMULA CircularTrains-PT-192-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-192-LTLFireability-15 finished in 8246 ms.
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-192-LTLFireability-00
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 327 transition count 140
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 104 place count 275 transition count 140
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 104 place count 275 transition count 135
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 114 place count 270 transition count 135
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 124 place count 265 transition count 130
Applied a total of 124 rules in 24 ms. Remains 265 /327 variables (removed 62) and now considering 130/192 (removed 62) transitions.
// Phase 1: matrix 130 rows 265 cols
[2022-05-16 06:56:09] [INFO ] Computed 136 place invariants in 2 ms
[2022-05-16 06:56:09] [INFO ] Implicit Places using invariants in 136 ms returned [70, 174, 208, 230, 249, 262]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 137 ms to find 6 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 259/327 places, 130/192 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 259 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 258 transition count 129
Applied a total of 2 rules in 12 ms. Remains 258 /259 variables (removed 1) and now considering 129/130 (removed 1) transitions.
// Phase 1: matrix 129 rows 258 cols
[2022-05-16 06:56:09] [INFO ] Computed 130 place invariants in 1 ms
[2022-05-16 06:56:09] [INFO ] Implicit Places using invariants in 129 ms returned []
// Phase 1: matrix 129 rows 258 cols
[2022-05-16 06:56:09] [INFO ] Computed 130 place invariants in 1 ms
[2022-05-16 06:56:09] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 258/327 places, 129/192 transitions.
Finished structural reductions, in 2 iterations. Remains : 258/327 places, 129/192 transitions.
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-00 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:(OR (LT s42 1) (LT s243 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 22875 reset in 780 ms.
Product exploration explored 100000 steps with 21842 reset in 839 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 79 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 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 70 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=23 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 101 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 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 5 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 258 cols
[2022-05-16 06:56:11] [INFO ] Computed 130 place invariants in 1 ms
[2022-05-16 06:56:11] [INFO ] Implicit Places using invariants in 257 ms returned []
// Phase 1: matrix 129 rows 258 cols
[2022-05-16 06:56:11] [INFO ] Computed 130 place invariants in 4 ms
[2022-05-16 06:56:12] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
// Phase 1: matrix 129 rows 258 cols
[2022-05-16 06:56:12] [INFO ] Computed 130 place invariants in 5 ms
[2022-05-16 06:56:12] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 129/129 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 86 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 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 107 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=35 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 90 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 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22213 reset in 782 ms.
Product exploration explored 100000 steps with 22573 reset in 838 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 5 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2022-05-16 06:56:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 129 rows 258 cols
[2022-05-16 06:56:15] [INFO ] Computed 130 place invariants in 1 ms
[2022-05-16 06:56:15] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 129/129 transitions.
Product exploration explored 100000 steps with 22559 reset in 1363 ms.
Product exploration explored 100000 steps with 22369 reset in 1408 ms.
Built C files in :
/tmp/ltsmin1509433617418879298
[2022-05-16 06:56:17] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1509433617418879298
Running compilation step : cd /tmp/ltsmin1509433617418879298;'/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 237 ms.
Running link step : cd /tmp/ltsmin1509433617418879298;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin1509433617418879298;'/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/stateBased5362220056645752747.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 258 cols
[2022-05-16 06:56:32] [INFO ] Computed 130 place invariants in 2 ms
[2022-05-16 06:56:33] [INFO ] Implicit Places using invariants in 144 ms returned []
// Phase 1: matrix 129 rows 258 cols
[2022-05-16 06:56:33] [INFO ] Computed 130 place invariants in 1 ms
[2022-05-16 06:56:33] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
// Phase 1: matrix 129 rows 258 cols
[2022-05-16 06:56:33] [INFO ] Computed 130 place invariants in 1 ms
[2022-05-16 06:56:33] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 129/129 transitions.
Built C files in :
/tmp/ltsmin1321802382845716148
[2022-05-16 06:56:33] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1321802382845716148
Running compilation step : cd /tmp/ltsmin1321802382845716148;'/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 246 ms.
Running link step : cd /tmp/ltsmin1321802382845716148;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin1321802382845716148;'/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/stateBased316588717522997258.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 06:56:48] [INFO ] Flatten gal took : 6 ms
[2022-05-16 06:56:48] [INFO ] Flatten gal took : 5 ms
[2022-05-16 06:56:48] [INFO ] Time to serialize gal into /tmp/LTL2586920997141118807.gal : 1 ms
[2022-05-16 06:56:48] [INFO ] Time to serialize properties into /tmp/LTL4545094881761781634.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/LTL2586920997141118807.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4545094881761781634.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/LTL2586920...266
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((Section_55<1)||(F56<1))")))))
Formula 0 simplified : !XXF"((Section_55<1)||(F56<1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-16 06:57:03] [INFO ] Flatten gal took : 10 ms
[2022-05-16 06:57:03] [INFO ] Applying decomposition
[2022-05-16 06:57:03] [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/graph11543932988457810422.txt' '-o' '/tmp/graph11543932988457810422.bin' '-w' '/tmp/graph11543932988457810422.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11543932988457810422.bin' '-l' '-1' '-v' '-w' '/tmp/graph11543932988457810422.weights' '-q' '0' '-e' '0.001'
[2022-05-16 06:57:03] [INFO ] Decomposing Gal with order
[2022-05-16 06:57:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 06:57:03] [INFO ] Flatten gal took : 9 ms
[2022-05-16 06:57:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 06:57:03] [INFO ] Time to serialize gal into /tmp/LTL7986931456747659748.gal : 2 ms
[2022-05-16 06:57:03] [INFO ] Time to serialize properties into /tmp/LTL5726825919638968969.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/LTL7986931456747659748.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5726825919638968969.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/LTL7986931...245
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((i13.u17.Section_55<1)||(i13.u17.F56<1))")))))
Formula 0 simplified : !XXF"((i13.u17.Section_55<1)||(i13.u17.F56<1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16560167947970127098
[2022-05-16 06:57:18] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16560167947970127098
Running compilation step : cd /tmp/ltsmin16560167947970127098;'/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 247 ms.
Running link step : cd /tmp/ltsmin16560167947970127098;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16560167947970127098;'/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-192-LTLFireability-00 finished in 84905 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((!X(p0) U X(p0))))))'
Found a CL insensitive property : CircularTrains-PT-192-LTLFireability-03
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 327 transition count 142
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 277 transition count 142
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 100 place count 277 transition count 135
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 114 place count 270 transition count 135
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 124 place count 265 transition count 130
Applied a total of 124 rules in 11 ms. Remains 265 /327 variables (removed 62) and now considering 130/192 (removed 62) transitions.
// Phase 1: matrix 130 rows 265 cols
[2022-05-16 06:57:34] [INFO ] Computed 136 place invariants in 3 ms
[2022-05-16 06:57:34] [INFO ] Implicit Places using invariants in 144 ms returned [70, 174, 208, 230, 248, 249, 262]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 146 ms to find 7 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 258/327 places, 130/192 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 258 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 256 transition count 128
Applied a total of 4 rules in 5 ms. Remains 256 /258 variables (removed 2) and now considering 128/130 (removed 2) transitions.
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:57:34] [INFO ] Computed 129 place invariants in 0 ms
[2022-05-16 06:57:34] [INFO ] Implicit Places using invariants in 125 ms returned []
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:57:34] [INFO ] Computed 129 place invariants in 1 ms
[2022-05-16 06:57:34] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 256/327 places, 128/192 transitions.
Finished structural reductions, in 2 iterations. Remains : 256/327 places, 128/192 transitions.
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-03 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}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (GEQ s171 1) (GEQ s247 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1476 reset in 787 ms.
Product exploration explored 100000 steps with 1428 reset in 823 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:57:36] [INFO ] Computed 129 place invariants in 1 ms
[2022-05-16 06:57:36] [INFO ] [Real]Absence check using 127 positive place invariants in 24 ms returned sat
[2022-05-16 06:57:36] [INFO ] [Real]Absence check using 127 positive and 2 generalized place invariants in 6 ms returned sat
[2022-05-16 06:57:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:57:37] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2022-05-16 06:57:37] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 06:57:37] [INFO ] Added : 62 causal constraints over 13 iterations in 353 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 256 /256 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:57:37] [INFO ] Computed 129 place invariants in 1 ms
[2022-05-16 06:57:37] [INFO ] Implicit Places using invariants in 124 ms returned []
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:57:37] [INFO ] Computed 129 place invariants in 1 ms
[2022-05-16 06:57:37] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:57:37] [INFO ] Computed 129 place invariants in 1 ms
[2022-05-16 06:57:37] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 256/256 places, 128/128 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 73 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=36 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:57:38] [INFO ] Computed 129 place invariants in 1 ms
[2022-05-16 06:57:38] [INFO ] [Real]Absence check using 127 positive place invariants in 24 ms returned sat
[2022-05-16 06:57:38] [INFO ] [Real]Absence check using 127 positive and 2 generalized place invariants in 6 ms returned sat
[2022-05-16 06:57:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:57:38] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2022-05-16 06:57:38] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 06:57:39] [INFO ] Added : 62 causal constraints over 13 iterations in 350 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1445 reset in 788 ms.
Product exploration explored 100000 steps with 1483 reset in 820 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 128/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 256 /256 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2022-05-16 06:57:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:57:41] [INFO ] Computed 129 place invariants in 1 ms
[2022-05-16 06:57:41] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 256/256 places, 128/128 transitions.
Product exploration explored 100000 steps with 1407 reset in 791 ms.
Product exploration explored 100000 steps with 1468 reset in 860 ms.
Built C files in :
/tmp/ltsmin6983864180599523873
[2022-05-16 06:57:43] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6983864180599523873
Running compilation step : cd /tmp/ltsmin6983864180599523873;'/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 241 ms.
Running link step : cd /tmp/ltsmin6983864180599523873;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin6983864180599523873;'/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/stateBased1094700803485700244.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 128/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 256 /256 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:57:58] [INFO ] Computed 129 place invariants in 4 ms
[2022-05-16 06:57:58] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:57:58] [INFO ] Computed 129 place invariants in 4 ms
[2022-05-16 06:57:58] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
// Phase 1: matrix 128 rows 256 cols
[2022-05-16 06:57:58] [INFO ] Computed 129 place invariants in 1 ms
[2022-05-16 06:57:58] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 256/256 places, 128/128 transitions.
Built C files in :
/tmp/ltsmin2756742314021084929
[2022-05-16 06:57:58] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2756742314021084929
Running compilation step : cd /tmp/ltsmin2756742314021084929;'/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 262 ms.
Running link step : cd /tmp/ltsmin2756742314021084929;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2756742314021084929;'/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/stateBased4329765940859162192.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 06:58:13] [INFO ] Flatten gal took : 6 ms
[2022-05-16 06:58:13] [INFO ] Flatten gal took : 6 ms
[2022-05-16 06:58:13] [INFO ] Time to serialize gal into /tmp/LTL3229152748619069717.gal : 1 ms
[2022-05-16 06:58:13] [INFO ] Time to serialize properties into /tmp/LTL17603413551373695634.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/LTL3229152748619069717.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17603413551373695634.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/LTL3229152...267
Read 1 LTL properties
Checking formula 0 : !((X(X(X((!(X("((F63>=1)&&(Section_62>=1))")))U(X("((F63>=1)&&(Section_62>=1))")))))))
Formula 0 simplified : !XXX(!X"((F63>=1)&&(Section_62>=1))" U X"((F63>=1)&&(Section_62>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-16 06:58:28] [INFO ] Flatten gal took : 6 ms
[2022-05-16 06:58:28] [INFO ] Applying decomposition
[2022-05-16 06:58:28] [INFO ] Flatten gal took : 5 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/graph16174512245268605511.txt' '-o' '/tmp/graph16174512245268605511.bin' '-w' '/tmp/graph16174512245268605511.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16174512245268605511.bin' '-l' '-1' '-v' '-w' '/tmp/graph16174512245268605511.weights' '-q' '0' '-e' '0.001'
[2022-05-16 06:58:28] [INFO ] Decomposing Gal with order
[2022-05-16 06:58:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 06:58:28] [INFO ] Flatten gal took : 9 ms
[2022-05-16 06:58:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 06:58:28] [INFO ] Time to serialize gal into /tmp/LTL15301678691764799765.gal : 2 ms
[2022-05-16 06:58:28] [INFO ] Time to serialize properties into /tmp/LTL11347614622072023413.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/LTL15301678691764799765.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11347614622072023413.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/LTL1530167...247
Read 1 LTL properties
Checking formula 0 : !((X(X(X((!(X("((i1.u80.F63>=1)&&(i7.i1.i1.u79.Section_62>=1))")))U(X("((i1.u80.F63>=1)&&(i7.i1.i1.u79.Section_62>=1))")))))))
Formula 0 simplified : !XXX(!X"((i1.u80.F63>=1)&&(i7.i1.i1.u79.Section_62>=1))" U X"((i1.u80.F63>=1)&&(i7.i1.i1.u79.Section_62>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5054772987390204341
[2022-05-16 06:58:43] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5054772987390204341
Running compilation step : cd /tmp/ltsmin5054772987390204341;'/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 244 ms.
Running link step : cd /tmp/ltsmin5054772987390204341;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5054772987390204341;'/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((!X((LTLAPp0==true)) U X((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-192-LTLFireability-03 finished in 85197 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(F((G(p0)||F(p1)))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(F(p0))||p1))))'
[2022-05-16 06:58:59] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12767449747569371899
[2022-05-16 06:58:59] [INFO ] Applying decomposition
[2022-05-16 06:58:59] [INFO ] Computing symmetric may disable matrix : 192 transitions.
[2022-05-16 06:58:59] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:58:59] [INFO ] Computing symmetric may enable matrix : 192 transitions.
[2022-05-16 06:58:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:58:59] [INFO ] Flatten gal took : 7 ms
[2022-05-16 06:58:59] [INFO ] Computing Do-Not-Accords matrix : 192 transitions.
[2022-05-16 06:58:59] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:58:59] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12767449747569371899
Running compilation step : cd /tmp/ltsmin12767449747569371899;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/graph16591164734862968741.txt' '-o' '/tmp/graph16591164734862968741.bin' '-w' '/tmp/graph16591164734862968741.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16591164734862968741.bin' '-l' '-1' '-v' '-w' '/tmp/graph16591164734862968741.weights' '-q' '0' '-e' '0.001'
[2022-05-16 06:58:59] [INFO ] Decomposing Gal with order
[2022-05-16 06:58:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 06:58:59] [INFO ] Flatten gal took : 9 ms
[2022-05-16 06:58:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 06:58:59] [INFO ] Time to serialize gal into /tmp/LTLFireability3700935846197365575.gal : 1 ms
[2022-05-16 06:58:59] [INFO ] Time to serialize properties into /tmp/LTLFireability246661188297335305.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/LTLFireability3700935846197365575.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability246661188297335305.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...266
Read 4 LTL properties
Checking formula 0 : !((X(X(F("((i3.i1.u11.Section_55<1)||(i3.i0.u6.F56<1))")))))
Formula 0 simplified : !XXF"((i3.i1.u11.Section_55<1)||(i3.i0.u6.F56<1))"
Compilation finished in 381 ms.
Running link step : cd /tmp/ltsmin12767449747569371899;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin12767449747569371899;'/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'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin12767449747569371899;'/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'
Running LTSmin : cd /tmp/ltsmin12767449747569371899;'/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((!X((LTLAPp1==true)) U X((LTLAPp1==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
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.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: LTL layer: formula: X(X(X((!X((LTLAPp1==true)) U X((LTLAPp1==true))))))
pins2lts-mc-linux64( 0/ 8), 0.006: "X(X(X((!X((LTLAPp1==true)) U X((LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.006: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: completed 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( 2/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.020: buchi has 5 states
pins2lts-mc-linux64( 0/ 8), 0.022: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.085: DFS-FIFO for weak LTL, using special progress label 199
pins2lts-mc-linux64( 0/ 8), 0.085: There are 200 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.085: State length is 328, there are 197 groups
pins2lts-mc-linux64( 0/ 8), 0.085: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.085: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.085: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.085: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.527: ~1 levels ~960 states ~61408 transitions
pins2lts-mc-linux64( 7/ 8), 0.699: ~1 levels ~1920 states ~122824 transitions
pins2lts-mc-linux64( 0/ 8), 0.981: ~458 levels ~3840 states ~160616 transitions
pins2lts-mc-linux64( 3/ 8), 1.383: ~936 levels ~7680 states ~279648 transitions
pins2lts-mc-linux64( 0/ 8), 1.857: ~1850 levels ~15360 states ~479856 transitions
pins2lts-mc-linux64( 0/ 8), 2.183: ~3040 levels ~30720 states ~643488 transitions
pins2lts-mc-linux64( 0/ 8), 2.399: ~3040 levels ~61440 states ~715616 transitions
pins2lts-mc-linux64( 4/ 8), 2.716: ~3040 levels ~122880 states ~919696 transitions
pins2lts-mc-linux64( 4/ 8), 3.373: ~3040 levels ~245760 states ~1253120 transitions
pins2lts-mc-linux64( 4/ 8), 4.619: ~3040 levels ~491520 states ~1930496 transitions
pins2lts-mc-linux64( 4/ 8), 7.186: ~3040 levels ~983040 states ~3395856 transitions
pins2lts-mc-linux64( 4/ 8), 12.195: ~3040 levels ~1966080 states ~6417176 transitions
pins2lts-mc-linux64( 4/ 8), 22.560: ~3040 levels ~3932160 states ~12671496 transitions
pins2lts-mc-linux64( 4/ 8), 43.749: ~3040 levels ~7864320 states ~26012328 transitions
pins2lts-mc-linux64( 4/ 8), 87.067: ~3040 levels ~15728640 states ~53017880 transitions
pins2lts-mc-linux64( 0/ 8), 153.878: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 153.913:
pins2lts-mc-linux64( 0/ 8), 153.914: mean standard work distribution: 3.7% (states) 4.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 153.914:
pins2lts-mc-linux64( 0/ 8), 153.914: Explored 25472219 states 93988274 transitions, fanout: 3.690
pins2lts-mc-linux64( 0/ 8), 153.914: Total exploration time 153.810 sec (153.750 sec minimum, 153.789 sec on average)
pins2lts-mc-linux64( 0/ 8), 153.914: States per second: 165608, Transitions per second: 611067
pins2lts-mc-linux64( 0/ 8), 153.914:
pins2lts-mc-linux64( 0/ 8), 153.914: Progress states detected: 47707
pins2lts-mc-linux64( 0/ 8), 153.914: Redundant explorations: -2.5499
pins2lts-mc-linux64( 0/ 8), 153.914:
pins2lts-mc-linux64( 0/ 8), 153.914: Queue width: 8B, total height: 115658, memory: 0.88MB
pins2lts-mc-linux64( 0/ 8), 153.914: Tree memory: 455.4MB, 18.3 B/state, compr.: 1.4%
pins2lts-mc-linux64( 0/ 8), 153.914: Tree fill ratio (roots/leafs): 19.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 153.914: Stored 192 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 153.914: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 153.914: Est. total memory use: 456.3MB (~1024.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12767449747569371899;'/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((!X((LTLAPp1==true)) U X((LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12767449747569371899;'/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((!X((LTLAPp1==true)) U X((LTLAPp1==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 07:22:00] [INFO ] Flatten gal took : 7 ms
[2022-05-16 07:22:00] [INFO ] Time to serialize gal into /tmp/LTLFireability8770749630517143768.gal : 1 ms
[2022-05-16 07:22:00] [INFO ] Time to serialize properties into /tmp/LTLFireability4904855657947677989.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/LTLFireability8770749630517143768.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4904855657947677989.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...288
Read 4 LTL properties
Checking formula 0 : !((X(X(F("((Section_55<1)||(F56<1))")))))
Formula 0 simplified : !XXF"((Section_55<1)||(F56<1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-16 07:45:01] [INFO ] Flatten gal took : 9 ms
[2022-05-16 07:45:01] [INFO ] Input system was already deterministic with 192 transitions.
[2022-05-16 07:45:01] [INFO ] Transformed 327 places.
[2022-05-16 07:45:01] [INFO ] Transformed 192 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 07:45:01] [INFO ] Time to serialize gal into /tmp/LTLFireability5071451112646026817.gal : 1 ms
[2022-05-16 07:45:01] [INFO ] Time to serialize properties into /tmp/LTLFireability7248850514996371445.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/LTLFireability5071451112646026817.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7248850514996371445.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...333
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(F("((Section_55<1)||(F56<1))")))))
Formula 0 simplified : !XXF"((Section_55<1)||(F56<1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

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-192"
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-192, 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-165251919000748"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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