Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 14:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 14:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Apr 12 14:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 73K May 18 16:42 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-096-LTLFireability-00
FORMULA_NAME CircularTrains-PT-096-LTLFireability-01
FORMULA_NAME CircularTrains-PT-096-LTLFireability-02
FORMULA_NAME CircularTrains-PT-096-LTLFireability-03
FORMULA_NAME CircularTrains-PT-096-LTLFireability-04
FORMULA_NAME CircularTrains-PT-096-LTLFireability-05
FORMULA_NAME CircularTrains-PT-096-LTLFireability-06
FORMULA_NAME CircularTrains-PT-096-LTLFireability-07
FORMULA_NAME CircularTrains-PT-096-LTLFireability-08
FORMULA_NAME CircularTrains-PT-096-LTLFireability-09
FORMULA_NAME CircularTrains-PT-096-LTLFireability-10
FORMULA_NAME CircularTrains-PT-096-LTLFireability-11
FORMULA_NAME CircularTrains-PT-096-LTLFireability-12
FORMULA_NAME CircularTrains-PT-096-LTLFireability-13
FORMULA_NAME CircularTrains-PT-096-LTLFireability-14
FORMULA_NAME CircularTrains-PT-096-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716249265059

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-096
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-20 23:54:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 23:54:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 23:54:26] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2024-05-20 23:54:26] [INFO ] Transformed 192 places.
[2024-05-20 23:54:26] [INFO ] Transformed 96 transitions.
[2024-05-20 23:54:26] [INFO ] Parsed PT model containing 192 places and 96 transitions and 384 arcs in 106 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CircularTrains-PT-096-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-096-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 96/96 transitions.
Applied a total of 0 rules in 40 ms. Remains 192 /192 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 192 cols
[2024-05-20 23:54:27] [INFO ] Computed 97 invariants in 18 ms
[2024-05-20 23:54:27] [INFO ] Implicit Places using invariants in 382 ms returned [1, 4, 8, 10, 14, 20, 27, 29, 39, 49, 109, 115, 116, 123, 125, 144, 155, 162, 174, 177, 182, 183, 186, 189]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 422 ms to find 24 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 168/192 places, 96/96 transitions.
Applied a total of 0 rules in 7 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 469 ms. Remains : 168/192 places, 96/96 transitions.
Support contains 50 out of 168 places after structural reductions.
[2024-05-20 23:54:27] [INFO ] Flatten gal took : 28 ms
[2024-05-20 23:54:27] [INFO ] Flatten gal took : 18 ms
[2024-05-20 23:54:27] [INFO ] Input system was already deterministic with 96 transitions.
Support contains 48 out of 168 places (down from 50) after GAL structural reductions.
Finished random walk after 100 steps, including 0 resets, run visited all 27 properties in 26 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CircularTrains-PT-096-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||(F((G(p2)&&p1))&&F(p0))))'
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 168 transition count 80
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 33 place count 152 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 151 transition count 79
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 34 place count 151 transition count 73
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 46 place count 145 transition count 73
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 58 place count 139 transition count 67
Applied a total of 58 rules in 29 ms. Remains 139 /168 variables (removed 29) and now considering 67/96 (removed 29) transitions.
// Phase 1: matrix 67 rows 139 cols
[2024-05-20 23:54:28] [INFO ] Computed 73 invariants in 6 ms
[2024-05-20 23:54:28] [INFO ] Implicit Places using invariants in 135 ms returned [2, 23, 120, 122, 124, 130, 135, 136]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 137 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/168 places, 67/96 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 131 transition count 65
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 129 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 128 transition count 64
Applied a total of 6 rules in 8 ms. Remains 128 /131 variables (removed 3) and now considering 64/67 (removed 3) transitions.
// Phase 1: matrix 64 rows 128 cols
[2024-05-20 23:54:28] [INFO ] Computed 65 invariants in 1 ms
[2024-05-20 23:54:28] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-20 23:54:28] [INFO ] Invariant cache hit.
[2024-05-20 23:54:28] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 128/168 places, 64/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 373 ms. Remains : 128/168 places, 64/96 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 480 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 p2), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={1} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s122 1)), p2:(AND (GEQ s37 1) (GEQ s84 1)), p0:(AND (GEQ s8 1) (GEQ s30 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 515 ms.
Product exploration explored 100000 steps with 0 reset in 542 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND p1 p2 p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0)))))]
False Knowledge obtained : [(X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X p0), (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (OR (AND (NOT p1) p0) (AND (NOT p2) p0))), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))))]
Knowledge based reduction with 5 factoid took 919 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 236 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false, false]
Finished random walk after 44 steps, including 0 resets, run visited all 8 properties in 7 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND p1 p2 p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0)))))]
False Knowledge obtained : [(X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X p0), (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (OR (AND (NOT p1) p0) (AND (NOT p2) p0))), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0))))), (F (AND p0 (NOT p2))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (F (NOT (AND p0 p2))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (F (AND p0 p1 p2)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 5 factoid took 1233 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 289 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 252 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false, false]
Support contains 6 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 12 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-20 23:54:33] [INFO ] Invariant cache hit.
[2024-05-20 23:54:33] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-20 23:54:33] [INFO ] Invariant cache hit.
[2024-05-20 23:54:33] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2024-05-20 23:54:33] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-20 23:54:33] [INFO ] Invariant cache hit.
[2024-05-20 23:54:33] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 425 ms. Remains : 128/128 places, 64/64 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) p2), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 5 factoid took 889 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 221 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false, false]
Finished random walk after 302 steps, including 0 resets, run visited all 8 properties in 20 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (AND p0 (NOT p2))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (F (NOT (AND p0 p2))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (F (AND p0 p1 p2)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 5 factoid took 1050 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 222 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 220 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 225 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false, false]
Product exploration explored 100000 steps with 0 reset in 398 ms.
Product exploration explored 100000 steps with 0 reset in 455 ms.
Built C files in :
/tmp/ltsmin11848442881422221794
[2024-05-20 23:54:37] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2024-05-20 23:54:37] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:54:37] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2024-05-20 23:54:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:54:37] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2024-05-20 23:54:37] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:54:37] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11848442881422221794
Running compilation step : cd /tmp/ltsmin11848442881422221794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 271 ms.
Running link step : cd /tmp/ltsmin11848442881422221794;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin11848442881422221794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1741309412133866889.hoa' '--buchi-type=spotba'
LTSmin run took 188 ms.
FORMULA CircularTrains-PT-096-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-096-LTLFireability-00 finished in 9693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)&&p0))))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 7 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2024-05-20 23:54:38] [INFO ] Computed 73 invariants in 3 ms
[2024-05-20 23:54:38] [INFO ] Implicit Places using invariants in 95 ms returned [3, 29, 146, 148, 150, 163, 164]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 96 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/168 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106 ms. Remains : 161/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s153 1) (GEQ s155 1)), p1:(AND (GEQ s72 1) (GEQ s109 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-096-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-096-LTLFireability-01 finished in 241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(G(p0))))))'
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-20 23:54:38] [INFO ] Invariant cache hit.
[2024-05-20 23:54:38] [INFO ] Implicit Places using invariants in 98 ms returned [3, 29, 146, 148, 150, 158, 163, 164]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 105 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/168 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110 ms. Remains : 160/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s3 1) (LT s116 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 83 steps with 0 reset in 2 ms.
FORMULA CircularTrains-PT-096-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-096-LTLFireability-02 finished in 213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(F(p2)&&p1))))'
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-20 23:54:38] [INFO ] Invariant cache hit.
[2024-05-20 23:54:38] [INFO ] Implicit Places using invariants in 88 ms returned [3, 29, 146, 158, 163, 164]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 90 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 162 /162 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 94 ms. Remains : 162/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s34 1) (GEQ s90 1)), p1:(AND (GEQ s106 1) (GEQ s145 1)), p2:(AND (GEQ s120 1) (GEQ s147 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][false, false, false, false]]
Product exploration explored 100000 steps with 1484 reset in 435 ms.
Product exploration explored 100000 steps with 1512 reset in 437 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 166 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Finished random walk after 43 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=21 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p1 (NOT p0) (NOT p2))), (F p0)]
Knowledge based reduction with 2 factoid took 307 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
// Phase 1: matrix 96 rows 162 cols
[2024-05-20 23:54:40] [INFO ] Computed 67 invariants in 2 ms
[2024-05-20 23:54:40] [INFO ] [Real]Absence check using 61 positive place invariants in 10 ms returned sat
[2024-05-20 23:54:40] [INFO ] [Real]Absence check using 61 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-20 23:54:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:54:40] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2024-05-20 23:54:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:54:40] [INFO ] [Nat]Absence check using 61 positive place invariants in 23 ms returned sat
[2024-05-20 23:54:41] [INFO ] [Nat]Absence check using 61 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-20 23:54:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 23:54:41] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2024-05-20 23:54:41] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-20 23:54:41] [INFO ] Added : 61 causal constraints over 13 iterations in 162 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2024-05-20 23:54:41] [INFO ] Invariant cache hit.
[2024-05-20 23:54:41] [INFO ] [Real]Absence check using 61 positive place invariants in 10 ms returned sat
[2024-05-20 23:54:41] [INFO ] [Real]Absence check using 61 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-20 23:54:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:54:41] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2024-05-20 23:54:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:54:41] [INFO ] [Nat]Absence check using 61 positive place invariants in 10 ms returned sat
[2024-05-20 23:54:41] [INFO ] [Nat]Absence check using 61 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-20 23:54:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 23:54:41] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-05-20 23:54:41] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-20 23:54:41] [INFO ] Added : 61 causal constraints over 13 iterations in 147 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 6 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 162 /162 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-20 23:54:41] [INFO ] Invariant cache hit.
[2024-05-20 23:54:41] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-20 23:54:41] [INFO ] Invariant cache hit.
[2024-05-20 23:54:41] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-20 23:54:41] [INFO ] Invariant cache hit.
[2024-05-20 23:54:42] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 270 ms. Remains : 162/162 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 225 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Finished random walk after 38 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p1 (NOT p0) (NOT p2))), (F p0)]
Knowledge based reduction with 2 factoid took 303 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
[2024-05-20 23:54:43] [INFO ] Invariant cache hit.
[2024-05-20 23:54:43] [INFO ] [Real]Absence check using 61 positive place invariants in 13 ms returned sat
[2024-05-20 23:54:43] [INFO ] [Real]Absence check using 61 positive and 6 generalized place invariants in 15 ms returned sat
[2024-05-20 23:54:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:54:43] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2024-05-20 23:54:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:54:43] [INFO ] [Nat]Absence check using 61 positive place invariants in 10 ms returned sat
[2024-05-20 23:54:43] [INFO ] [Nat]Absence check using 61 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-20 23:54:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 23:54:43] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-20 23:54:43] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-20 23:54:43] [INFO ] Added : 61 causal constraints over 13 iterations in 136 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2024-05-20 23:54:43] [INFO ] Invariant cache hit.
[2024-05-20 23:54:43] [INFO ] [Real]Absence check using 61 positive place invariants in 10 ms returned sat
[2024-05-20 23:54:43] [INFO ] [Real]Absence check using 61 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-20 23:54:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:54:43] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2024-05-20 23:54:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:54:43] [INFO ] [Nat]Absence check using 61 positive place invariants in 10 ms returned sat
[2024-05-20 23:54:43] [INFO ] [Nat]Absence check using 61 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-20 23:54:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 23:54:43] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-20 23:54:43] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-20 23:54:44] [INFO ] Added : 61 causal constraints over 13 iterations in 142 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 259 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 1494 reset in 394 ms.
Product exploration explored 100000 steps with 1496 reset in 425 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 6 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 96/96 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 162 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 162 transition count 96
Deduced a syphon composed of 29 places in 0 ms
Applied a total of 29 rules in 24 ms. Remains 162 /162 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-20 23:54:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 96 rows 162 cols
[2024-05-20 23:54:45] [INFO ] Computed 67 invariants in 3 ms
[2024-05-20 23:54:45] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/162 places, 96/96 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 162/162 places, 96/96 transitions.
Built C files in :
/tmp/ltsmin9944755615856729584
[2024-05-20 23:54:45] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9944755615856729584
Running compilation step : cd /tmp/ltsmin9944755615856729584;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 191 ms.
Running link step : cd /tmp/ltsmin9944755615856729584;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9944755615856729584;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16927702288434087736.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 96/96 transitions.
Applied a total of 0 rules in 8 ms. Remains 162 /162 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 162 cols
[2024-05-20 23:55:00] [INFO ] Computed 67 invariants in 1 ms
[2024-05-20 23:55:00] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-20 23:55:00] [INFO ] Invariant cache hit.
[2024-05-20 23:55:00] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-05-20 23:55:00] [INFO ] Invariant cache hit.
[2024-05-20 23:55:00] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 304 ms. Remains : 162/162 places, 96/96 transitions.
Built C files in :
/tmp/ltsmin8780340657784052697
[2024-05-20 23:55:00] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8780340657784052697
Running compilation step : cd /tmp/ltsmin8780340657784052697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 188 ms.
Running link step : cd /tmp/ltsmin8780340657784052697;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8780340657784052697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9798677266361589071.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-20 23:55:16] [INFO ] Flatten gal took : 9 ms
[2024-05-20 23:55:16] [INFO ] Flatten gal took : 7 ms
[2024-05-20 23:55:16] [INFO ] Time to serialize gal into /tmp/LTL3673870766149087399.gal : 2 ms
[2024-05-20 23:55:16] [INFO ] Time to serialize properties into /tmp/LTL17876660222680951311.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3673870766149087399.gal' '-t' 'CGAL' '-hoa' '/tmp/aut359543953285869305.hoa' '-atoms' '/tmp/LTL17876660222680951311.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL17876660222680951311.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut359543953285869305.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-20 23:55:31] [INFO ] Flatten gal took : 7 ms
[2024-05-20 23:55:31] [INFO ] Flatten gal took : 6 ms
[2024-05-20 23:55:31] [INFO ] Time to serialize gal into /tmp/LTL13154101726492736530.gal : 1 ms
[2024-05-20 23:55:31] [INFO ] Time to serialize properties into /tmp/LTL12837452870624870618.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13154101726492736530.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12837452870624870618.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((F("((Section_11>=1)&&(F12>=1))"))||(("((Section_10>=1)&&(F11>=1))")&&(F("((Section_70>=1)&&(F71>=1))"))))))
Formula 0 simplified : X(G!"((Section_11>=1)&&(F12>=1))" & (!"((Section_10>=1)&&(F11>=1))" | G!"((Section_70>=1)&&(F71>=1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-20 23:55:46] [INFO ] Flatten gal took : 6 ms
[2024-05-20 23:55:46] [INFO ] Applying decomposition
[2024-05-20 23:55:46] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11494980119927760216.txt' '-o' '/tmp/graph11494980119927760216.bin' '-w' '/tmp/graph11494980119927760216.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11494980119927760216.bin' '-l' '-1' '-v' '-w' '/tmp/graph11494980119927760216.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:55:46] [INFO ] Decomposing Gal with order
[2024-05-20 23:55:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:55:46] [INFO ] Flatten gal took : 28 ms
[2024-05-20 23:55:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-20 23:55:46] [INFO ] Time to serialize gal into /tmp/LTL11716465934034263061.gal : 2 ms
[2024-05-20 23:55:46] [INFO ] Time to serialize properties into /tmp/LTL15740440896207291258.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11716465934034263061.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15740440896207291258.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X((F("((i8.u18.Section_11>=1)&&(i8.u28.F12>=1))"))||(("((i8.u6.Section_10>=1)&&(i8.u18.F11>=1))")&&(F("((i10.u22.Section_70>=1)&&(i...177
Formula 0 simplified : X(G!"((i8.u18.Section_11>=1)&&(i8.u28.F12>=1))" & (!"((i8.u6.Section_10>=1)&&(i8.u18.F11>=1))" | G!"((i10.u22.Section_70>=1)&&(i10.u...169
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16074528737420562922
[2024-05-20 23:56:01] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16074528737420562922
Running compilation step : cd /tmp/ltsmin16074528737420562922;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 182 ms.
Running link step : cd /tmp/ltsmin16074528737420562922;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin16074528737420562922;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))||(<>((LTLAPp2==true))&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-096-LTLFireability-04 finished in 98108 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((X(p1)||p0))||(X(F(p3))&&p2))))'
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2024-05-20 23:56:16] [INFO ] Computed 73 invariants in 2 ms
[2024-05-20 23:56:16] [INFO ] Implicit Places using invariants in 96 ms returned [29, 146, 148, 158, 163, 164]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 98 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/168 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 162 /162 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104 ms. Remains : 162/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p1)), true, (NOT p3)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s3 1) (GEQ s128 1)), p0:(OR (LT s78 1) (LT s119 1)), p1:(AND (GEQ s78 1) (GEQ s119 1)), p3:(AND (GEQ s121 1) (GEQ s147 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 116 steps with 3 reset in 1 ms.
FORMULA CircularTrains-PT-096-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-096-LTLFireability-05 finished in 336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 168 transition count 78
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 150 transition count 78
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 36 place count 150 transition count 73
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 46 place count 145 transition count 73
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 58 place count 139 transition count 67
Applied a total of 58 rules in 14 ms. Remains 139 /168 variables (removed 29) and now considering 67/96 (removed 29) transitions.
// Phase 1: matrix 67 rows 139 cols
[2024-05-20 23:56:16] [INFO ] Computed 73 invariants in 2 ms
[2024-05-20 23:56:16] [INFO ] Implicit Places using invariants in 86 ms returned [2, 23, 120, 122, 124, 130, 135, 136]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 87 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/168 places, 67/96 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 131 transition count 65
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 129 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 128 transition count 64
Applied a total of 6 rules in 5 ms. Remains 128 /131 variables (removed 3) and now considering 64/67 (removed 3) transitions.
// Phase 1: matrix 64 rows 128 cols
[2024-05-20 23:56:17] [INFO ] Computed 65 invariants in 0 ms
[2024-05-20 23:56:17] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-20 23:56:17] [INFO ] Invariant cache hit.
[2024-05-20 23:56:17] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 128/168 places, 64/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 278 ms. Remains : 128/168 places, 64/96 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s77 1) (GEQ s121 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1519 reset in 388 ms.
Product exploration explored 100000 steps with 1475 reset in 413 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 (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 151 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 6 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-20 23:56:18] [INFO ] Invariant cache hit.
[2024-05-20 23:56:18] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-20 23:56:18] [INFO ] Invariant cache hit.
[2024-05-20 23:56:18] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-05-20 23:56:18] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-20 23:56:18] [INFO ] Invariant cache hit.
[2024-05-20 23:56:18] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 263 ms. Remains : 128/128 places, 64/64 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 (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 163 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Finished random walk after 28 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=14 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 166 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1465 reset in 379 ms.
Product exploration explored 100000 steps with 1496 reset in 411 ms.
Built C files in :
/tmp/ltsmin4001723837271760957
[2024-05-20 23:56:20] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2024-05-20 23:56:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:56:20] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2024-05-20 23:56:20] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:56:20] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2024-05-20 23:56:20] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:56:20] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4001723837271760957
Running compilation step : cd /tmp/ltsmin4001723837271760957;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 164 ms.
Running link step : cd /tmp/ltsmin4001723837271760957;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin4001723837271760957;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1279122165619178798.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 8 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-20 23:56:35] [INFO ] Invariant cache hit.
[2024-05-20 23:56:35] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-20 23:56:35] [INFO ] Invariant cache hit.
[2024-05-20 23:56:35] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-05-20 23:56:35] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-20 23:56:35] [INFO ] Invariant cache hit.
[2024-05-20 23:56:35] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 242 ms. Remains : 128/128 places, 64/64 transitions.
Built C files in :
/tmp/ltsmin4864065979320748481
[2024-05-20 23:56:35] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2024-05-20 23:56:35] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:56:35] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2024-05-20 23:56:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:56:35] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2024-05-20 23:56:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:56:35] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4864065979320748481
Running compilation step : cd /tmp/ltsmin4864065979320748481;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 176 ms.
Running link step : cd /tmp/ltsmin4864065979320748481;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4864065979320748481;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1722222278125325470.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-20 23:56:50] [INFO ] Flatten gal took : 8 ms
[2024-05-20 23:56:50] [INFO ] Flatten gal took : 8 ms
[2024-05-20 23:56:50] [INFO ] Time to serialize gal into /tmp/LTL5562107090524805423.gal : 4 ms
[2024-05-20 23:56:50] [INFO ] Time to serialize properties into /tmp/LTL2932469674901849719.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5562107090524805423.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11022035650016332769.hoa' '-atoms' '/tmp/LTL2932469674901849719.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2932469674901849719.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11022035650016332769.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-20 23:57:05] [INFO ] Flatten gal took : 7 ms
[2024-05-20 23:57:05] [INFO ] Flatten gal took : 7 ms
[2024-05-20 23:57:05] [INFO ] Time to serialize gal into /tmp/LTL2941828487624714270.gal : 3 ms
[2024-05-20 23:57:05] [INFO ] Time to serialize properties into /tmp/LTL16096098721072319661.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2941828487624714270.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16096098721072319661.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((Section_48>=1)&&(F49>=1))"))))
Formula 0 simplified : FG!"((Section_48>=1)&&(F49>=1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-20 23:57:20] [INFO ] Flatten gal took : 4 ms
[2024-05-20 23:57:20] [INFO ] Applying decomposition
[2024-05-20 23:57:20] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11765879738711155600.txt' '-o' '/tmp/graph11765879738711155600.bin' '-w' '/tmp/graph11765879738711155600.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11765879738711155600.bin' '-l' '-1' '-v' '-w' '/tmp/graph11765879738711155600.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:57:20] [INFO ] Decomposing Gal with order
[2024-05-20 23:57:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:57:20] [INFO ] Flatten gal took : 7 ms
[2024-05-20 23:57:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-20 23:57:20] [INFO ] Time to serialize gal into /tmp/LTL13104561399504665705.gal : 2 ms
[2024-05-20 23:57:20] [INFO ] Time to serialize properties into /tmp/LTL754921282764280009.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13104561399504665705.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL754921282764280009.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i6.i2.u40.Section_48>=1)&&(i6.i2.u62.F49>=1))"))))
Formula 0 simplified : FG!"((i6.i2.u40.Section_48>=1)&&(i6.i2.u62.F49>=1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8763332025282407094
[2024-05-20 23:57:35] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8763332025282407094
Running compilation step : cd /tmp/ltsmin8763332025282407094;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 164 ms.
Running link step : cd /tmp/ltsmin8763332025282407094;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin8763332025282407094;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-096-LTLFireability-07 finished in 94208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 168 transition count 78
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 150 transition count 78
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 36 place count 150 transition count 72
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 48 place count 144 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 60 place count 138 transition count 66
Applied a total of 60 rules in 10 ms. Remains 138 /168 variables (removed 30) and now considering 66/96 (removed 30) transitions.
// Phase 1: matrix 66 rows 138 cols
[2024-05-20 23:57:51] [INFO ] Computed 73 invariants in 2 ms
[2024-05-20 23:57:51] [INFO ] Implicit Places using invariants in 90 ms returned [2, 23, 119, 121, 123, 129, 134, 135]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 91 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/168 places, 66/96 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 130 transition count 64
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 128 transition count 64
Applied a total of 4 rules in 4 ms. Remains 128 /130 variables (removed 2) and now considering 64/66 (removed 2) transitions.
// Phase 1: matrix 64 rows 128 cols
[2024-05-20 23:57:51] [INFO ] Computed 65 invariants in 1 ms
[2024-05-20 23:57:51] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-20 23:57:51] [INFO ] Invariant cache hit.
[2024-05-20 23:57:51] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 128/168 places, 64/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 274 ms. Remains : 128/168 places, 64/96 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-08 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 s18 1) (LT s62 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 347 ms.
Product exploration explored 100000 steps with 0 reset in 425 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 163 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 36 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
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 151 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2024-05-20 23:57:52] [INFO ] Invariant cache hit.
[2024-05-20 23:57:52] [INFO ] [Real]Absence check using 63 positive place invariants in 9 ms returned sat
[2024-05-20 23:57:52] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 23:57:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:57:52] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-20 23:57:52] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-20 23:57:52] [INFO ] Added : 30 causal constraints over 6 iterations in 80 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-20 23:57:52] [INFO ] Invariant cache hit.
[2024-05-20 23:57:52] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-20 23:57:52] [INFO ] Invariant cache hit.
[2024-05-20 23:57:53] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2024-05-20 23:57:53] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-20 23:57:53] [INFO ] Invariant cache hit.
[2024-05-20 23:57:53] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 249 ms. Remains : 128/128 places, 64/64 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 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
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 157 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2024-05-20 23:57:53] [INFO ] Invariant cache hit.
[2024-05-20 23:57:53] [INFO ] [Real]Absence check using 63 positive place invariants in 10 ms returned sat
[2024-05-20 23:57:53] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-20 23:57:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:57:53] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-20 23:57:53] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-20 23:57:53] [INFO ] Added : 30 causal constraints over 6 iterations in 72 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 336 ms.
Product exploration explored 100000 steps with 0 reset in 413 ms.
Built C files in :
/tmp/ltsmin9772351963976428817
[2024-05-20 23:57:54] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2024-05-20 23:57:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:57:54] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2024-05-20 23:57:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:57:54] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2024-05-20 23:57:54] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:57:54] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9772351963976428817
Running compilation step : cd /tmp/ltsmin9772351963976428817;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 171 ms.
Running link step : cd /tmp/ltsmin9772351963976428817;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin9772351963976428817;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased279704370746177066.hoa' '--buchi-type=spotba'
LTSmin run took 124 ms.
FORMULA CircularTrains-PT-096-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-096-LTLFireability-08 finished in 3814 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(((X(p0)||F(!p1)) U (G((X(p0)||F(!p1)))||(!p2&&(X(p0)||F(!p1)))))))||(!p2&&F(((X(p0)||F(!p1)) U (G((X(p0)||F(!p1)))||(!p2&&(X(p0)||F(!p1))))))))))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2024-05-20 23:57:54] [INFO ] Computed 73 invariants in 2 ms
[2024-05-20 23:57:55] [INFO ] Implicit Places using invariants in 98 ms returned [3, 146, 148, 150, 158, 163, 164]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 98 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 102 ms. Remains : 161/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 1}, { cond=(AND p2 p1 p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s94 1) (GEQ s152 1)), p1:(AND (GEQ s28 1) (GEQ s146 1)), p0:(OR (AND (GEQ s94 1) (GEQ s152 1)) (NOT (AND (GEQ s28 1) (GEQ s146 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5671 reset in 452 ms.
Product exploration explored 100000 steps with 5605 reset in 464 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (X (NOT (AND p2 p1 (NOT p0)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p2 p1 p0))), (X (X (NOT (AND p2 p1 p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 412 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 96 rows 161 cols
[2024-05-20 23:57:56] [INFO ] Computed 66 invariants in 2 ms
[2024-05-20 23:57:56] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p2 p1 p0))), (X (X (NOT (AND p2 p1 p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p1))), (F (AND p0 p1)), (F (AND p0 p1 p2)), (F (NOT p2)), (F (AND (NOT p0) p1)), (F p1)]
Knowledge based reduction with 5 factoid took 635 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2))]
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-20 23:57:57] [INFO ] Invariant cache hit.
[2024-05-20 23:57:57] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-20 23:57:57] [INFO ] Invariant cache hit.
[2024-05-20 23:57:57] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-05-20 23:57:57] [INFO ] Invariant cache hit.
[2024-05-20 23:57:57] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 274 ms. Remains : 161/161 places, 96/96 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) p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 3 factoid took 278 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2))]
Finished random walk after 83 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 1 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (AND (NOT p0) p1)), (F (NOT p2)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 3 factoid took 327 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 2941 reset in 430 ms.
Product exploration explored 100000 steps with 2917 reset in 444 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2))]
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 161 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 161 transition count 96
Deduced a syphon composed of 31 places in 0 ms
Applied a total of 31 rules in 11 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-20 23:57:59] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 96 rows 161 cols
[2024-05-20 23:57:59] [INFO ] Computed 66 invariants in 1 ms
[2024-05-20 23:58:00] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/161 places, 96/96 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 90 ms. Remains : 161/161 places, 96/96 transitions.
Built C files in :
/tmp/ltsmin15970482008417771565
[2024-05-20 23:58:00] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15970482008417771565
Running compilation step : cd /tmp/ltsmin15970482008417771565;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 184 ms.
Running link step : cd /tmp/ltsmin15970482008417771565;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15970482008417771565;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5912919285563119938.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Applied a total of 0 rules in 4 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 161 cols
[2024-05-20 23:58:15] [INFO ] Computed 66 invariants in 8 ms
[2024-05-20 23:58:15] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-20 23:58:15] [INFO ] Invariant cache hit.
[2024-05-20 23:58:15] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-05-20 23:58:15] [INFO ] Invariant cache hit.
[2024-05-20 23:58:15] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 266 ms. Remains : 161/161 places, 96/96 transitions.
Built C files in :
/tmp/ltsmin15103572030076767209
[2024-05-20 23:58:15] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15103572030076767209
Running compilation step : cd /tmp/ltsmin15103572030076767209;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 191 ms.
Running link step : cd /tmp/ltsmin15103572030076767209;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15103572030076767209;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14603447839668019847.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-20 23:58:30] [INFO ] Flatten gal took : 9 ms
[2024-05-20 23:58:30] [INFO ] Flatten gal took : 7 ms
[2024-05-20 23:58:30] [INFO ] Time to serialize gal into /tmp/LTL5948987036847559827.gal : 2 ms
[2024-05-20 23:58:30] [INFO ] Time to serialize properties into /tmp/LTL8608763917120346629.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5948987036847559827.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15340351421579161276.hoa' '-atoms' '/tmp/LTL8608763917120346629.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8608763917120346629.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15340351421579161276.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-20 23:58:45] [INFO ] Flatten gal took : 9 ms
[2024-05-20 23:58:45] [INFO ] Flatten gal took : 5 ms
[2024-05-20 23:58:45] [INFO ] Time to serialize gal into /tmp/LTL16881051285768464827.gal : 1 ms
[2024-05-20 23:58:45] [INFO ] Time to serialize properties into /tmp/LTL17052446275758302192.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16881051285768464827.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17052446275758302192.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G(F(((X("(((Section_48>=1)&&(F49>=1))||(!((F14>=1)&&(Section_13>=1))))"))||(F(!("((F14>=1)&&(Section_13>=1))"))))U((G((X("(((Sec...823
Formula 0 simplified : G(FG("((Section_48>=1)&&(F49>=1))" U (X!"(((Section_48>=1)&&(F49>=1))||(!((F14>=1)&&(Section_13>=1))))" & G"((F14>=1)&&(Section_13>=...333
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-20 23:59:00] [INFO ] Flatten gal took : 5 ms
[2024-05-20 23:59:00] [INFO ] Applying decomposition
[2024-05-20 23:59:00] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8015224550992793257.txt' '-o' '/tmp/graph8015224550992793257.bin' '-w' '/tmp/graph8015224550992793257.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8015224550992793257.bin' '-l' '-1' '-v' '-w' '/tmp/graph8015224550992793257.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:59:00] [INFO ] Decomposing Gal with order
[2024-05-20 23:59:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:59:00] [INFO ] Flatten gal took : 11 ms
[2024-05-20 23:59:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-20 23:59:00] [INFO ] Time to serialize gal into /tmp/LTL14040627089644882378.gal : 5 ms
[2024-05-20 23:59:00] [INFO ] Time to serialize properties into /tmp/LTL1046763574746443005.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14040627089644882378.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1046763574746443005.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G(F(((X("(((i11.u21.Section_48>=1)&&(i11.u21.F49>=1))||(!((i4.u28.F14>=1)&&(i4.u28.Section_13>=1))))"))||(F(!("((i4.u28.F14>=1)&...1135
Formula 0 simplified : G(FG("((i11.u21.Section_48>=1)&&(i11.u21.F49>=1))" U (X!"(((i11.u21.Section_48>=1)&&(i11.u21.F49>=1))||(!((i4.u28.F14>=1)&&(i4.u28.S...469
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5958822763250631573
[2024-05-20 23:59:15] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5958822763250631573
Running compilation step : cd /tmp/ltsmin5958822763250631573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 190 ms.
Running link step : cd /tmp/ltsmin5958822763250631573;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin5958822763250631573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>(((X((LTLAPp0==true))||<>(!(LTLAPp1==true))) U ([]((X((LTLAPp0==true))||<>(!(LTLAPp1==true))))||(!(LTLAPp2==true)&&(X((LTLAPp0==true))||<>(!(LTLAPp1==true))))))))||(<>(((X((LTLAPp0==true))||<>(!(LTLAPp1==true))) U ([]((X((LTLAPp0==true))||<>(!(LTLAPp1==true))))||(!(LTLAPp2==true)&&(X((LTLAPp0==true))||<>(!(LTLAPp1==true)))))))&&!(LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-096-LTLFireability-09 finished in 95965 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(((G(p0) U p1)||F(p2)))))))'
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2024-05-20 23:59:30] [INFO ] Computed 73 invariants in 1 ms
[2024-05-20 23:59:30] [INFO ] Implicit Places using invariants in 93 ms returned [3, 29, 146, 148, 150, 158, 163]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 95 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 99 ms. Remains : 161/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 307 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s111 1) (GEQ s157 1)), p0:(AND (GEQ s92 1) (GEQ s119 1)), p2:(AND (GEQ s4 1) (GEQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6553 reset in 384 ms.
Product exploration explored 100000 steps with 6873 reset in 410 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Finished random walk after 52 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), true]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT p2)), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 2 factoid took 221 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 362 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 161 cols
[2024-05-20 23:59:33] [INFO ] Computed 66 invariants in 2 ms
[2024-05-20 23:59:33] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-20 23:59:33] [INFO ] Invariant cache hit.
[2024-05-20 23:59:33] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-20 23:59:33] [INFO ] Invariant cache hit.
[2024-05-20 23:59:33] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 269 ms. Remains : 161/161 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Finished random walk after 107 steps, including 0 resets, run visited all 5 properties in 8 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), true]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT p2)), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 2 factoid took 177 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 6465 reset in 378 ms.
Product exploration explored 100000 steps with 6614 reset in 410 ms.
Applying partial POR strategy [false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 161 transition count 96
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 28 place count 161 transition count 96
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 161 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 161 transition count 96
Deduced a syphon composed of 31 places in 0 ms
Applied a total of 31 rules in 8 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-20 23:59:36] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 96 rows 161 cols
[2024-05-20 23:59:36] [INFO ] Computed 66 invariants in 1 ms
[2024-05-20 23:59:36] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/161 places, 96/96 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 78 ms. Remains : 161/161 places, 96/96 transitions.
Built C files in :
/tmp/ltsmin16572342167221154459
[2024-05-20 23:59:36] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16572342167221154459
Running compilation step : cd /tmp/ltsmin16572342167221154459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 181 ms.
Running link step : cd /tmp/ltsmin16572342167221154459;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin16572342167221154459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18443248737712776638.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Applied a total of 0 rules in 5 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 161 cols
[2024-05-20 23:59:51] [INFO ] Computed 66 invariants in 2 ms
[2024-05-20 23:59:51] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-20 23:59:51] [INFO ] Invariant cache hit.
[2024-05-20 23:59:51] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-20 23:59:51] [INFO ] Invariant cache hit.
[2024-05-20 23:59:51] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 264 ms. Remains : 161/161 places, 96/96 transitions.
Built C files in :
/tmp/ltsmin4630380417779381055
[2024-05-20 23:59:51] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4630380417779381055
Running compilation step : cd /tmp/ltsmin4630380417779381055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 193 ms.
Running link step : cd /tmp/ltsmin4630380417779381055;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4630380417779381055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2776555928617470708.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 00:00:06] [INFO ] Flatten gal took : 7 ms
[2024-05-21 00:00:06] [INFO ] Flatten gal took : 3 ms
[2024-05-21 00:00:06] [INFO ] Time to serialize gal into /tmp/LTL17821039073414064515.gal : 1 ms
[2024-05-21 00:00:06] [INFO ] Time to serialize properties into /tmp/LTL2825348210338989355.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17821039073414064515.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16146089820109515467.hoa' '-atoms' '/tmp/LTL2825348210338989355.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL2825348210338989355.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16146089820109515467.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 00:00:21] [INFO ] Flatten gal took : 4 ms
[2024-05-21 00:00:21] [INFO ] Flatten gal took : 3 ms
[2024-05-21 00:00:21] [INFO ] Time to serialize gal into /tmp/LTL17978893095307012948.gal : 1 ms
[2024-05-21 00:00:21] [INFO ] Time to serialize properties into /tmp/LTL11664666290294243977.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17978893095307012948.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11664666290294243977.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(((G("((F6>=1)&&(Section_5>=1))"))U("((Section_49>=1)&&(F50>=1))"))||(F("((F76>=1)&&(Section_75>=1))"))))))))
Formula 0 simplified : XXXX((F!"((F6>=1)&&(Section_5>=1))" R !"((Section_49>=1)&&(F50>=1))") & G!"((F76>=1)&&(Section_75>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 00:00:36] [INFO ] Flatten gal took : 4 ms
[2024-05-21 00:00:36] [INFO ] Applying decomposition
[2024-05-21 00:00:36] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8040090006707116021.txt' '-o' '/tmp/graph8040090006707116021.bin' '-w' '/tmp/graph8040090006707116021.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8040090006707116021.bin' '-l' '-1' '-v' '-w' '/tmp/graph8040090006707116021.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:00:36] [INFO ] Decomposing Gal with order
[2024-05-21 00:00:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:00:36] [INFO ] Flatten gal took : 15 ms
[2024-05-21 00:00:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 00:00:36] [INFO ] Time to serialize gal into /tmp/LTL9565636535184535334.gal : 20 ms
[2024-05-21 00:00:36] [INFO ] Time to serialize properties into /tmp/LTL18197859627641231385.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9565636535184535334.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18197859627641231385.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(((G("((i0.u28.F6>=1)&&(i0.u0.Section_5>=1))"))U("((i12.u20.Section_49>=1)&&(i12.u30.F50>=1))"))||(F("((i8.u17.F76>=1)&&(i8....183
Formula 0 simplified : XXXX((F!"((i0.u28.F6>=1)&&(i0.u0.Section_5>=1))" R !"((i12.u20.Section_49>=1)&&(i12.u30.F50>=1))") & G!"((i8.u17.F76>=1)&&(i8.u17.Se...170
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17191097751734054565
[2024-05-21 00:00:51] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17191097751734054565
Running compilation step : cd /tmp/ltsmin17191097751734054565;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 182 ms.
Running link step : cd /tmp/ltsmin17191097751734054565;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17191097751734054565;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(X((([]((LTLAPp0==true)) U (LTLAPp1==true))||<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-096-LTLFireability-10 finished in 96182 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2024-05-21 00:01:07] [INFO ] Computed 73 invariants in 1 ms
[2024-05-21 00:01:07] [INFO ] Implicit Places using invariants in 83 ms returned [3, 29, 146, 148, 150, 158, 163, 164]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 84 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 160/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s12 1) (GEQ s158 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][false, false]]
Product exploration explored 100000 steps with 1494 reset in 374 ms.
Product exploration explored 100000 steps with 1469 reset in 396 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)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 45 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=22 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
// Phase 1: matrix 96 rows 160 cols
[2024-05-21 00:01:08] [INFO ] Computed 65 invariants in 1 ms
[2024-05-21 00:01:08] [INFO ] [Real]Absence check using 63 positive place invariants in 10 ms returned sat
[2024-05-21 00:01:08] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-21 00:01:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 00:01:08] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2024-05-21 00:01:08] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-21 00:01:08] [INFO ] Added : 61 causal constraints over 13 iterations in 208 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 96/96 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 160 transition count 66
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 130 transition count 66
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 60 place count 130 transition count 64
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 128 transition count 64
Applied a total of 64 rules in 8 ms. Remains 128 /160 variables (removed 32) and now considering 64/96 (removed 32) transitions.
// Phase 1: matrix 64 rows 128 cols
[2024-05-21 00:01:08] [INFO ] Computed 65 invariants in 1 ms
[2024-05-21 00:01:08] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 00:01:08] [INFO ] Invariant cache hit.
[2024-05-21 00:01:08] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-21 00:01:08] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 00:01:08] [INFO ] Invariant cache hit.
[2024-05-21 00:01:08] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/160 places, 64/96 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 242 ms. Remains : 128/160 places, 64/96 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 (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2024-05-21 00:01:09] [INFO ] Invariant cache hit.
[2024-05-21 00:01:09] [INFO ] [Real]Absence check using 63 positive place invariants in 9 ms returned sat
[2024-05-21 00:01:09] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-21 00:01:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 00:01:09] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-21 00:01:09] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-21 00:01:09] [INFO ] Added : 30 causal constraints over 6 iterations in 69 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2904 reset in 412 ms.
Product exploration explored 100000 steps with 2821 reset in 423 ms.
Built C files in :
/tmp/ltsmin13478641440129858343
[2024-05-21 00:01:10] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2024-05-21 00:01:10] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 00:01:10] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2024-05-21 00:01:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 00:01:10] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2024-05-21 00:01:10] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 00:01:10] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13478641440129858343
Running compilation step : cd /tmp/ltsmin13478641440129858343;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 161 ms.
Running link step : cd /tmp/ltsmin13478641440129858343;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13478641440129858343;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10953997823902940998.hoa' '--buchi-type=spotba'
LTSmin run took 220 ms.
FORMULA CircularTrains-PT-096-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-096-LTLFireability-11 finished in 3707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(G(p1)))))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2024-05-21 00:01:10] [INFO ] Computed 73 invariants in 1 ms
[2024-05-21 00:01:10] [INFO ] Implicit Places using invariants in 79 ms returned [3, 29, 146, 148, 150, 158, 164]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 80 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 82 ms. Remains : 161/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s57 1) (LT s157 1)), p1:(OR (LT s37 1) (LT s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 327 ms.
Product exploration explored 100000 steps with 0 reset in 392 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 p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 72 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=24 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 297 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 161 cols
[2024-05-21 00:01:12] [INFO ] Computed 66 invariants in 1 ms
[2024-05-21 00:01:12] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 00:01:12] [INFO ] Invariant cache hit.
[2024-05-21 00:01:12] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-05-21 00:01:12] [INFO ] Invariant cache hit.
[2024-05-21 00:01:12] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 252 ms. Remains : 161/161 places, 96/96 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 p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 69 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=34 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 186 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 340 ms.
Product exploration explored 100000 steps with 0 reset in 408 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 161 transition count 96
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 28 place count 161 transition count 96
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 161 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 161 transition count 96
Deduced a syphon composed of 31 places in 0 ms
Applied a total of 31 rules in 6 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-21 00:01:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 96 rows 161 cols
[2024-05-21 00:01:14] [INFO ] Computed 66 invariants in 1 ms
[2024-05-21 00:01:14] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/161 places, 96/96 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73 ms. Remains : 161/161 places, 96/96 transitions.
Built C files in :
/tmp/ltsmin5444642970592134402
[2024-05-21 00:01:14] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5444642970592134402
Running compilation step : cd /tmp/ltsmin5444642970592134402;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 169 ms.
Running link step : cd /tmp/ltsmin5444642970592134402;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin5444642970592134402;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11851137538322763662.hoa' '--buchi-type=spotba'
LTSmin run took 812 ms.
FORMULA CircularTrains-PT-096-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-096-LTLFireability-12 finished in 5109 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 168 transition count 79
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 35 place count 151 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 150 transition count 78
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 36 place count 150 transition count 72
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 48 place count 144 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 60 place count 138 transition count 66
Applied a total of 60 rules in 7 ms. Remains 138 /168 variables (removed 30) and now considering 66/96 (removed 30) transitions.
// Phase 1: matrix 66 rows 138 cols
[2024-05-21 00:01:15] [INFO ] Computed 73 invariants in 1 ms
[2024-05-21 00:01:15] [INFO ] Implicit Places using invariants in 82 ms returned [2, 23, 119, 121, 123, 134, 135]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 83 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/168 places, 66/96 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 131 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 130 transition count 65
Applied a total of 2 rules in 5 ms. Remains 130 /131 variables (removed 1) and now considering 65/66 (removed 1) transitions.
// Phase 1: matrix 65 rows 130 cols
[2024-05-21 00:01:15] [INFO ] Computed 66 invariants in 1 ms
[2024-05-21 00:01:16] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 00:01:16] [INFO ] Invariant cache hit.
[2024-05-21 00:01:16] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 130/168 places, 65/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 266 ms. Remains : 130/168 places, 65/96 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s47 1) (GEQ s57 1)), p1:(AND (GEQ s123 1) (GEQ s125 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 349 ms.
Product exploration explored 100000 steps with 0 reset in 407 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 (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 338 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 25 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=25 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 1 factoid took 291 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-21 00:01:17] [INFO ] Invariant cache hit.
[2024-05-21 00:01:18] [INFO ] [Real]Absence check using 63 positive place invariants in 9 ms returned sat
[2024-05-21 00:01:18] [INFO ] [Real]Absence check using 63 positive and 3 generalized place invariants in 6 ms returned sat
[2024-05-21 00:01:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 00:01:18] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-05-21 00:01:18] [INFO ] Computed and/alt/rep : 33/65/33 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-21 00:01:18] [INFO ] Added : 30 causal constraints over 6 iterations in 82 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 6 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-21 00:01:18] [INFO ] Invariant cache hit.
[2024-05-21 00:01:18] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 00:01:18] [INFO ] Invariant cache hit.
[2024-05-21 00:01:18] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2024-05-21 00:01:18] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 00:01:18] [INFO ] Invariant cache hit.
[2024-05-21 00:01:18] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 220 ms. Remains : 130/130 places, 65/65 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 (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 214 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 18 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 1 factoid took 275 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-21 00:01:19] [INFO ] Invariant cache hit.
[2024-05-21 00:01:19] [INFO ] [Real]Absence check using 63 positive place invariants in 9 ms returned sat
[2024-05-21 00:01:19] [INFO ] [Real]Absence check using 63 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-21 00:01:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 00:01:19] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-05-21 00:01:19] [INFO ] Computed and/alt/rep : 33/65/33 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-21 00:01:19] [INFO ] Added : 30 causal constraints over 6 iterations in 71 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 341 ms.
Product exploration explored 100000 steps with 0 reset in 398 ms.
Built C files in :
/tmp/ltsmin2156480654742802738
[2024-05-21 00:01:20] [INFO ] Computing symmetric may disable matrix : 65 transitions.
[2024-05-21 00:01:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 00:01:20] [INFO ] Computing symmetric may enable matrix : 65 transitions.
[2024-05-21 00:01:20] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 00:01:20] [INFO ] Computing Do-Not-Accords matrix : 65 transitions.
[2024-05-21 00:01:20] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 00:01:20] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2156480654742802738
Running compilation step : cd /tmp/ltsmin2156480654742802738;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 167 ms.
Running link step : cd /tmp/ltsmin2156480654742802738;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin2156480654742802738;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7264365907158993328.hoa' '--buchi-type=spotba'
LTSmin run took 221 ms.
FORMULA CircularTrains-PT-096-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-096-LTLFireability-13 finished in 4879 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2024-05-21 00:01:20] [INFO ] Computed 73 invariants in 1 ms
[2024-05-21 00:01:20] [INFO ] Implicit Places using invariants in 85 ms returned [3, 29, 146, 148, 150, 158, 163, 164]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 86 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 160/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s8 1) (GEQ s153 1)), p1:(AND (GEQ s34 1) (GEQ s90 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 1481 reset in 375 ms.
Product exploration explored 100000 steps with 1490 reset in 402 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 96 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 39 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=19 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 6 factoid took 112 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
// Phase 1: matrix 96 rows 160 cols
[2024-05-21 00:01:22] [INFO ] Computed 65 invariants in 1 ms
[2024-05-21 00:01:22] [INFO ] [Real]Absence check using 63 positive place invariants in 10 ms returned sat
[2024-05-21 00:01:22] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-21 00:01:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 00:01:22] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2024-05-21 00:01:22] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-21 00:01:22] [INFO ] Added : 61 causal constraints over 13 iterations in 197 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 160 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 : 160/160 places, 96/96 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 160 transition count 68
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 132 transition count 68
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 56 place count 132 transition count 64
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 64 place count 128 transition count 64
Applied a total of 64 rules in 5 ms. Remains 128 /160 variables (removed 32) and now considering 64/96 (removed 32) transitions.
// Phase 1: matrix 64 rows 128 cols
[2024-05-21 00:01:22] [INFO ] Computed 65 invariants in 1 ms
[2024-05-21 00:01:22] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 00:01:22] [INFO ] Invariant cache hit.
[2024-05-21 00:01:22] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-21 00:01:22] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 00:01:22] [INFO ] Invariant cache hit.
[2024-05-21 00:01:22] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/160 places, 64/96 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 225 ms. Remains : 128/160 places, 64/96 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 (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2024-05-21 00:01:23] [INFO ] Invariant cache hit.
[2024-05-21 00:01:23] [INFO ] [Real]Absence check using 63 positive place invariants in 9 ms returned sat
[2024-05-21 00:01:23] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-21 00:01:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 00:01:23] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-21 00:01:23] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-21 00:01:23] [INFO ] Added : 30 causal constraints over 6 iterations in 61 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2866 reset in 389 ms.
Product exploration explored 100000 steps with 2881 reset in 427 ms.
Built C files in :
/tmp/ltsmin16257790822073228291
[2024-05-21 00:01:24] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2024-05-21 00:01:24] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 00:01:24] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2024-05-21 00:01:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 00:01:24] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2024-05-21 00:01:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 00:01:24] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16257790822073228291
Running compilation step : cd /tmp/ltsmin16257790822073228291;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 160 ms.
Running link step : cd /tmp/ltsmin16257790822073228291;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16257790822073228291;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15378820633243821490.hoa' '--buchi-type=spotba'
LTSmin run took 273 ms.
FORMULA CircularTrains-PT-096-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-096-LTLFireability-15 finished in 3839 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(F(p2)&&p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(((X(p0)||F(!p1)) U (G((X(p0)||F(!p1)))||(!p2&&(X(p0)||F(!p1)))))))||(!p2&&F(((X(p0)||F(!p1)) U (G((X(p0)||F(!p1)))||(!p2&&(X(p0)||F(!p1))))))))))'
Found a Shortening insensitive property : CircularTrains-PT-096-LTLFireability-09
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false]
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 168 transition count 78
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 150 transition count 78
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 36 place count 150 transition count 73
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 46 place count 145 transition count 73
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 58 place count 139 transition count 67
Applied a total of 58 rules in 11 ms. Remains 139 /168 variables (removed 29) and now considering 67/96 (removed 29) transitions.
// Phase 1: matrix 67 rows 139 cols
[2024-05-21 00:01:25] [INFO ] Computed 73 invariants in 1 ms
[2024-05-21 00:01:25] [INFO ] Implicit Places using invariants in 77 ms returned [2, 120, 122, 124, 130, 135, 136]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 78 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 132/168 places, 67/96 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 132 transition count 66
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 131 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 130 transition count 65
Applied a total of 4 rules in 3 ms. Remains 130 /132 variables (removed 2) and now considering 65/67 (removed 2) transitions.
// Phase 1: matrix 65 rows 130 cols
[2024-05-21 00:01:25] [INFO ] Computed 66 invariants in 0 ms
[2024-05-21 00:01:25] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 00:01:25] [INFO ] Invariant cache hit.
[2024-05-21 00:01:25] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 130/168 places, 65/96 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 254 ms. Remains : 130/168 places, 65/96 transitions.
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 1}, { cond=(AND p2 p1 p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s78 1) (GEQ s123 1)), p1:(AND (GEQ s22 1) (GEQ s119 1)), p0:(OR (AND (GEQ s78 1) (GEQ s123 1)) (NOT (AND (GEQ s22 1) (GEQ s119 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 6450 reset in 419 ms.
Product exploration explored 100000 steps with 6406 reset in 458 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (X (NOT (AND p2 p1 (NOT p0)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p2 p1 p0))), (X (X (NOT (AND p2 p1 p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 460 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 00:01:26] [INFO ] Invariant cache hit.
[2024-05-21 00:01:26] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p2 p1 p0))), (X (X (NOT (AND p2 p1 p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p1))), (F (AND p0 p1)), (F (AND p0 p1 p2)), (F (NOT p2)), (F (AND (NOT p0) p1)), (F p1)]
Knowledge based reduction with 5 factoid took 662 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2))]
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 4 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-21 00:01:27] [INFO ] Invariant cache hit.
[2024-05-21 00:01:27] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 00:01:27] [INFO ] Invariant cache hit.
[2024-05-21 00:01:27] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-05-21 00:01:27] [INFO ] Invariant cache hit.
[2024-05-21 00:01:27] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 213 ms. Remains : 130/130 places, 65/65 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) p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 3 factoid took 243 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2))]
Finished random walk after 23 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (AND (NOT p0) p1)), (F (NOT p2)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 3 factoid took 344 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 3565 reset in 421 ms.
Product exploration explored 100000 steps with 3473 reset in 450 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2))]
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-21 00:01:29] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 00:01:29] [INFO ] Invariant cache hit.
[2024-05-21 00:01:29] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63 ms. Remains : 130/130 places, 65/65 transitions.
Built C files in :
/tmp/ltsmin15352017225495365874
[2024-05-21 00:01:29] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15352017225495365874
Running compilation step : cd /tmp/ltsmin15352017225495365874;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 152 ms.
Running link step : cd /tmp/ltsmin15352017225495365874;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin15352017225495365874;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17674142634576207917.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 3 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-21 00:01:44] [INFO ] Invariant cache hit.
[2024-05-21 00:01:45] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 00:01:45] [INFO ] Invariant cache hit.
[2024-05-21 00:01:45] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-05-21 00:01:45] [INFO ] Invariant cache hit.
[2024-05-21 00:01:45] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 214 ms. Remains : 130/130 places, 65/65 transitions.
Built C files in :
/tmp/ltsmin2873413615582239809
[2024-05-21 00:01:45] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2873413615582239809
Running compilation step : cd /tmp/ltsmin2873413615582239809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 144 ms.
Running link step : cd /tmp/ltsmin2873413615582239809;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin2873413615582239809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4443253459925907176.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 00:02:00] [INFO ] Flatten gal took : 5 ms
[2024-05-21 00:02:00] [INFO ] Flatten gal took : 4 ms
[2024-05-21 00:02:00] [INFO ] Time to serialize gal into /tmp/LTL4120840048874239101.gal : 1 ms
[2024-05-21 00:02:00] [INFO ] Time to serialize properties into /tmp/LTL14563380561816901315.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4120840048874239101.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1195327865967469428.hoa' '-atoms' '/tmp/LTL14563380561816901315.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14563380561816901315.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1195327865967469428.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 00:02:15] [INFO ] Flatten gal took : 4 ms
[2024-05-21 00:02:15] [INFO ] Flatten gal took : 3 ms
[2024-05-21 00:02:15] [INFO ] Time to serialize gal into /tmp/LTL17436819487226186008.gal : 1 ms
[2024-05-21 00:02:15] [INFO ] Time to serialize properties into /tmp/LTL6665907954743043321.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17436819487226186008.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6665907954743043321.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F(((X("(((Section_48>=1)&&(F49>=1))||(!((F14>=1)&&(Section_13>=1))))"))||(F(!("((F14>=1)&&(Section_13>=1))"))))U((G((X("(((Sec...823
Formula 0 simplified : G(FG("((Section_48>=1)&&(F49>=1))" U (X!"(((Section_48>=1)&&(F49>=1))||(!((F14>=1)&&(Section_13>=1))))" & G"((F14>=1)&&(Section_13>=...333
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 00:02:30] [INFO ] Flatten gal took : 7 ms
[2024-05-21 00:02:30] [INFO ] Applying decomposition
[2024-05-21 00:02:30] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4559644908009456395.txt' '-o' '/tmp/graph4559644908009456395.bin' '-w' '/tmp/graph4559644908009456395.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4559644908009456395.bin' '-l' '-1' '-v' '-w' '/tmp/graph4559644908009456395.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:02:30] [INFO ] Decomposing Gal with order
[2024-05-21 00:02:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:02:30] [INFO ] Flatten gal took : 4 ms
[2024-05-21 00:02:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 00:02:30] [INFO ] Time to serialize gal into /tmp/LTL12840131730528125825.gal : 2 ms
[2024-05-21 00:02:30] [INFO ] Time to serialize properties into /tmp/LTL6168292632705224492.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12840131730528125825.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6168292632705224492.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G(F(((X("(((i6.u10.Section_48>=1)&&(i6.u12.F49>=1))||(!((i5.u57.F14>=1)&&(i5.u57.Section_13>=1))))"))||(F(!("((i5.u57.F14>=1)&&(...1117
Formula 0 simplified : G(FG("((i6.u10.Section_48>=1)&&(i6.u12.F49>=1))" U (X!"(((i6.u10.Section_48>=1)&&(i6.u12.F49>=1))||(!((i5.u57.F14>=1)&&(i5.u57.Secti...459
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13087110679856646526
[2024-05-21 00:02:45] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13087110679856646526
Running compilation step : cd /tmp/ltsmin13087110679856646526;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 149 ms.
Running link step : cd /tmp/ltsmin13087110679856646526;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13087110679856646526;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>(((X((LTLAPp0==true))||<>(!(LTLAPp1==true))) U ([]((X((LTLAPp0==true))||<>(!(LTLAPp1==true))))||(!(LTLAPp2==true)&&(X((LTLAPp0==true))||<>(!(LTLAPp1==true))))))))||(<>(((X((LTLAPp0==true))||<>(!(LTLAPp1==true))) U ([]((X((LTLAPp0==true))||<>(!(LTLAPp1==true))))||(!(LTLAPp2==true)&&(X((LTLAPp0==true))||<>(!(LTLAPp1==true)))))))&&!(LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-096-LTLFireability-09 finished in 95799 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(((G(p0) U p1)||F(p2)))))))'
[2024-05-21 00:03:00] [INFO ] Flatten gal took : 9 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8950398681428272575
[2024-05-21 00:03:00] [INFO ] Computing symmetric may disable matrix : 96 transitions.
[2024-05-21 00:03:00] [INFO ] Applying decomposition
[2024-05-21 00:03:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 00:03:00] [INFO ] Computing symmetric may enable matrix : 96 transitions.
[2024-05-21 00:03:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 00:03:00] [INFO ] Flatten gal took : 3 ms
[2024-05-21 00:03:00] [INFO ] Computing Do-Not-Accords matrix : 96 transitions.
[2024-05-21 00:03:00] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 00:03:00] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8950398681428272575
Running compilation step : cd /tmp/ltsmin8950398681428272575;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10625803531789849224.txt' '-o' '/tmp/graph10625803531789849224.bin' '-w' '/tmp/graph10625803531789849224.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10625803531789849224.bin' '-l' '-1' '-v' '-w' '/tmp/graph10625803531789849224.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:03:00] [INFO ] Decomposing Gal with order
[2024-05-21 00:03:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:03:00] [INFO ] Flatten gal took : 5 ms
[2024-05-21 00:03:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 00:03:00] [INFO ] Time to serialize gal into /tmp/LTLFireability10155370433145990828.gal : 1 ms
[2024-05-21 00:03:00] [INFO ] Time to serialize properties into /tmp/LTLFireability18417708847441033761.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10155370433145990828.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18417708847441033761.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 4 LTL properties
Checking formula 0 : !((X((F("((i3.u24.Section_11>=1)&&(i3.u20.F12>=1))"))||(("((i3.u24.Section_10>=1)&&(i3.u24.F11>=1))")&&(F("((i0.u27.Section_70>=1)&&(i...175
Formula 0 simplified : X(G!"((i3.u24.Section_11>=1)&&(i3.u20.F12>=1))" & (!"((i3.u24.Section_10>=1)&&(i3.u24.F11>=1))" | G!"((i0.u27.Section_70>=1)&&(i0.u2...167
Compilation finished in 226 ms.
Running link step : cd /tmp/ltsmin8950398681428272575;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin8950398681428272575;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))||(<>((LTLAPp2==true))&&(LTLAPp1==true))))' '--buchi-type=spotba'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin8950398681428272575;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))||(<>((LTLAPp2==true))&&(LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8950398681428272575;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Initializing POR dependencies: labels 105, guards 96
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.035: LTL layer: formula: [](<>((LTLAPp3==true)))
pins2lts-mc-linux64( 2/ 8), 0.035: "[](<>((LTLAPp3==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.035: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.089: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.090: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.109: There are 107 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.109: State length is 169, there are 99 groups
pins2lts-mc-linux64( 0/ 8), 0.109: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.109: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.109: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.109: Visible groups: 0 / 99, labels: 1 / 107
pins2lts-mc-linux64( 0/ 8), 0.109: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.109: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.123: [Blue] ~120 levels ~960 states ~960 transitions
pins2lts-mc-linux64( 1/ 8), 0.132: [Blue] ~240 levels ~1920 states ~1920 transitions
pins2lts-mc-linux64( 6/ 8), 0.148: [Blue] ~480 levels ~3840 states ~3840 transitions
pins2lts-mc-linux64( 7/ 8), 0.177: [Blue] ~857 levels ~7680 states ~8112 transitions
pins2lts-mc-linux64( 7/ 8), 0.240: [Blue] ~1503 levels ~15360 states ~19704 transitions
pins2lts-mc-linux64( 7/ 8), 0.380: [Blue] ~2613 levels ~30720 states ~42888 transitions
pins2lts-mc-linux64( 6/ 8), 0.627: [Blue] ~5028 levels ~61440 states ~88080 transitions
pins2lts-mc-linux64( 4/ 8), 0.921: [Blue] ~8872 levels ~122880 states ~172848 transitions
pins2lts-mc-linux64( 4/ 8), 1.566: [Blue] ~15864 levels ~245760 states ~344288 transitions
pins2lts-mc-linux64( 4/ 8), 2.676: [Blue] ~29196 levels ~491520 states ~687976 transitions
pins2lts-mc-linux64( 3/ 8), 4.198: [Blue] ~64872 levels ~983040 states ~1445424 transitions
pins2lts-mc-linux64( 3/ 8), 6.632: [Blue] ~131172 levels ~1966080 states ~2880120 transitions
pins2lts-mc-linux64( 3/ 8), 11.470: [Blue] ~261384 levels ~3932160 states ~5735056 transitions
pins2lts-mc-linux64( 3/ 8), 21.272: [Blue] ~519486 levels ~7864320 states ~11320664 transitions
pins2lts-mc-linux64( 3/ 8), 42.472: [Blue] ~911608 levels ~15728640 states ~22224280 transitions
pins2lts-mc-linux64( 3/ 8), 86.581: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 86.652:
pins2lts-mc-linux64( 0/ 8), 86.652: Explored 29119250 states 40463362 transitions, fanout: 1.390
pins2lts-mc-linux64( 0/ 8), 86.652: Total exploration time 86.530 sec (86.450 sec minimum, 86.495 sec on average)
pins2lts-mc-linux64( 0/ 8), 86.652: States per second: 336522, Transitions per second: 467622
pins2lts-mc-linux64( 0/ 8), 86.652:
pins2lts-mc-linux64( 0/ 8), 86.652: State space has 26218023 states, 8300688 are accepting
pins2lts-mc-linux64( 0/ 8), 86.652: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 86.652: blue states: 29119250 (111.07%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 86.652: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 86.652: all-red states: 8300688 (31.66%), bogus 1178 (0.00%)
pins2lts-mc-linux64( 0/ 8), 86.652:
pins2lts-mc-linux64( 0/ 8), 86.652: Total memory used for local state coloring: 184.9MB
pins2lts-mc-linux64( 0/ 8), 86.652:
pins2lts-mc-linux64( 0/ 8), 86.652: Queue width: 8B, total height: 12120495, memory: 92.47MB
pins2lts-mc-linux64( 0/ 8), 86.652: Tree memory: 456.0MB, 18.2 B/state, compr.: 2.7%
pins2lts-mc-linux64( 0/ 8), 86.652: Tree fill ratio (roots/leafs): 19.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 86.652: Stored 96 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 86.652: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 86.652: Est. total memory use: 548.5MB (~1116.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8950398681428272575;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8950398681428272575;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-21 00:25:51] [INFO ] Flatten gal took : 7 ms
[2024-05-21 00:25:51] [INFO ] Time to serialize gal into /tmp/LTLFireability5877354019390510967.gal : 1 ms
[2024-05-21 00:25:51] [INFO ] Time to serialize properties into /tmp/LTLFireability1595040271483702069.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5877354019390510967.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1595040271483702069.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 4 LTL properties
Checking formula 0 : !((X((F("((Section_11>=1)&&(F12>=1))"))||(("((Section_10>=1)&&(F11>=1))")&&(F("((Section_70>=1)&&(F71>=1))"))))))
Formula 0 simplified : X(G!"((Section_11>=1)&&(F12>=1))" & (!"((Section_10>=1)&&(F11>=1))" | G!"((Section_70>=1)&&(F71>=1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
31319 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,313.204,2690960,1,0,2059,1.59344e+07,20,428,2302,2.05917e+07,3453
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CircularTrains-PT-096-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G(F("((Section_48>=1)&&(F49>=1))"))))
Formula 1 simplified : FG!"((Section_48>=1)&&(F49>=1))"
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
9216 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,405.365,2959844,1,0,2517,1.91908e+07,14,428,2292,2.05917e+07,4638
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA CircularTrains-PT-096-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((F((G(F(((X("(((Section_48>=1)&&(F49>=1))||(!((F14>=1)&&(Section_13>=1))))"))||(F(!("((F14>=1)&&(Section_13>=1))"))))U((G((X("(((Sec...828
Formula 2 simplified : G(FG("((Section_48>=1)&&(F49>=1))" U (X!"(((Section_48>=1)&&(F49>=1))||(!((F14>=1)&&(Section_13>=1))))" & G"((F14>=1)&&(Section_13>=...334
Detected timeout of ITS tools.
[2024-05-21 00:48:43] [INFO ] Flatten gal took : 8 ms
[2024-05-21 00:48:43] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-21 00:48:43] [INFO ] Transformed 168 places.
[2024-05-21 00:48:43] [INFO ] Transformed 96 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/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
[2024-05-21 00:48:43] [INFO ] Time to serialize gal into /tmp/LTLFireability12991584793308329011.gal : 1 ms
[2024-05-21 00:48:43] [INFO ] Time to serialize properties into /tmp/LTLFireability2413836885645913209.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12991584793308329011.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2413836885645913209.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G(F(((X("(((Section_48>=1)&&(F49>=1))||(!((F14>=1)&&(Section_13>=1))))"))||(F(!("((F14>=1)&&(Section_13>=1))"))))U((G((X("(((Sec...828
Formula 0 simplified : G(FG("((Section_48>=1)&&(F49>=1))" U (X!"(((Section_48>=1)&&(F49>=1))||(!((F14>=1)&&(Section_13>=1))))" & G"((F14>=1)&&(Section_13>=...334
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12583168 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16035260 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CircularTrains-PT-096"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is CircularTrains-PT-096, 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 r087-tall-171620521800218"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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