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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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 May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 12 14:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 229K Apr 12 14:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K 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 37K 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-048-LTLFireability-00
FORMULA_NAME CircularTrains-PT-048-LTLFireability-01
FORMULA_NAME CircularTrains-PT-048-LTLFireability-02
FORMULA_NAME CircularTrains-PT-048-LTLFireability-03
FORMULA_NAME CircularTrains-PT-048-LTLFireability-04
FORMULA_NAME CircularTrains-PT-048-LTLFireability-05
FORMULA_NAME CircularTrains-PT-048-LTLFireability-06
FORMULA_NAME CircularTrains-PT-048-LTLFireability-07
FORMULA_NAME CircularTrains-PT-048-LTLFireability-08
FORMULA_NAME CircularTrains-PT-048-LTLFireability-09
FORMULA_NAME CircularTrains-PT-048-LTLFireability-10
FORMULA_NAME CircularTrains-PT-048-LTLFireability-11
FORMULA_NAME CircularTrains-PT-048-LTLFireability-12
FORMULA_NAME CircularTrains-PT-048-LTLFireability-13
FORMULA_NAME CircularTrains-PT-048-LTLFireability-14
FORMULA_NAME CircularTrains-PT-048-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716248945075

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-048
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-20 23:49:06] [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:49:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 23:49:06] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2024-05-20 23:49:06] [INFO ] Transformed 96 places.
[2024-05-20 23:49:06] [INFO ] Transformed 48 transitions.
[2024-05-20 23:49:06] [INFO ] Parsed PT model containing 96 places and 48 transitions and 192 arcs in 90 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CircularTrains-PT-048-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-048-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 48/48 transitions.
Applied a total of 0 rules in 10 ms. Remains 96 /96 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 96 cols
[2024-05-20 23:49:06] [INFO ] Computed 49 invariants in 16 ms
[2024-05-20 23:49:07] [INFO ] Implicit Places using invariants in 402 ms returned [3, 56, 64, 81, 89, 90, 94]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 427 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/96 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 439 ms. Remains : 89/96 places, 48/48 transitions.
Support contains 50 out of 89 places after structural reductions.
[2024-05-20 23:49:07] [INFO ] Flatten gal took : 20 ms
[2024-05-20 23:49:07] [INFO ] Flatten gal took : 9 ms
[2024-05-20 23:49:07] [INFO ] Input system was already deterministic with 48 transitions.
Support contains 48 out of 89 places (down from 50) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 24) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 48 rows 89 cols
[2024-05-20 23:49:07] [INFO ] Computed 42 invariants in 9 ms
[2024-05-20 23:49:07] [INFO ] [Real]Absence check using 28 positive place invariants in 4 ms returned sat
[2024-05-20 23:49:07] [INFO ] [Real]Absence check using 28 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-20 23:49:07] [INFO ] After 59ms 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.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA CircularTrains-PT-048-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 48/48 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 89 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 87 transition count 46
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 87 transition count 42
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 12 place count 83 transition count 42
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 80 transition count 39
Applied a total of 18 rules in 20 ms. Remains 80 /89 variables (removed 9) and now considering 39/48 (removed 9) transitions.
// Phase 1: matrix 39 rows 80 cols
[2024-05-20 23:49:08] [INFO ] Computed 42 invariants in 2 ms
[2024-05-20 23:49:08] [INFO ] Implicit Places using invariants in 81 ms returned [12, 15, 21, 57, 71, 72, 76, 77]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 82 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/89 places, 39/48 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 72 transition count 35
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 68 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 67 transition count 34
Applied a total of 10 rules in 7 ms. Remains 67 /72 variables (removed 5) and now considering 34/39 (removed 5) transitions.
// Phase 1: matrix 34 rows 67 cols
[2024-05-20 23:49:08] [INFO ] Computed 34 invariants in 1 ms
[2024-05-20 23:49:08] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-20 23:49:08] [INFO ] Invariant cache hit.
[2024-05-20 23:49:08] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/89 places, 34/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 247 ms. Remains : 67/89 places, 34/48 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 190 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s44 1) (GEQ s56 1)) (AND (GEQ s50 1) (GEQ s65 1))), p0:(AND (GEQ s1 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2715 reset in 363 ms.
Product exploration explored 100000 steps with 2706 reset in 300 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 1 factoid took 323 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 9 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 298 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 34/34 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2024-05-20 23:49:09] [INFO ] Invariant cache hit.
[2024-05-20 23:49:10] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-20 23:49:10] [INFO ] Invariant cache hit.
[2024-05-20 23:49:10] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-20 23:49:10] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-20 23:49:10] [INFO ] Invariant cache hit.
[2024-05-20 23:49:10] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 173 ms. Remains : 67/67 places, 34/34 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) p1)]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 246 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 16 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 263 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2722 reset in 265 ms.
Product exploration explored 100000 steps with 2767 reset in 292 ms.
Built C files in :
/tmp/ltsmin10606589799519360106
[2024-05-20 23:49:11] [INFO ] Computing symmetric may disable matrix : 34 transitions.
[2024-05-20 23:49:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:49:11] [INFO ] Computing symmetric may enable matrix : 34 transitions.
[2024-05-20 23:49:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:49:11] [INFO ] Computing Do-Not-Accords matrix : 34 transitions.
[2024-05-20 23:49:11] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:49:11] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10606589799519360106
Running compilation step : cd /tmp/ltsmin10606589799519360106;'/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 197 ms.
Running link step : cd /tmp/ltsmin10606589799519360106;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin10606589799519360106;'/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/stateBased8258194459872705245.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 34/34 transitions.
Applied a total of 0 rules in 8 ms. Remains 67 /67 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2024-05-20 23:49:26] [INFO ] Invariant cache hit.
[2024-05-20 23:49:26] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-20 23:49:26] [INFO ] Invariant cache hit.
[2024-05-20 23:49:26] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-20 23:49:26] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-20 23:49:26] [INFO ] Invariant cache hit.
[2024-05-20 23:49:26] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 168 ms. Remains : 67/67 places, 34/34 transitions.
Built C files in :
/tmp/ltsmin10245062341832443255
[2024-05-20 23:49:26] [INFO ] Computing symmetric may disable matrix : 34 transitions.
[2024-05-20 23:49:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:49:26] [INFO ] Computing symmetric may enable matrix : 34 transitions.
[2024-05-20 23:49:26] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:49:26] [INFO ] Computing Do-Not-Accords matrix : 34 transitions.
[2024-05-20 23:49:26] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:49:26] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10245062341832443255
Running compilation step : cd /tmp/ltsmin10245062341832443255;'/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 112 ms.
Running link step : cd /tmp/ltsmin10245062341832443255;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10245062341832443255;'/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/stateBased18048109689864484682.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-20 23:49:41] [INFO ] Flatten gal took : 4 ms
[2024-05-20 23:49:41] [INFO ] Flatten gal took : 4 ms
[2024-05-20 23:49:41] [INFO ] Time to serialize gal into /tmp/LTL4383462404074480350.gal : 2 ms
[2024-05-20 23:49:41] [INFO ] Time to serialize properties into /tmp/LTL15840931788840791716.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/LTL4383462404074480350.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12572234596070219903.hoa' '-atoms' '/tmp/LTL15840931788840791716.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/LTL15840931788840791716.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12572234596070219903.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
378 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,3.80245,143292,1,0,1364,847338,34,285,1520,960700,3006
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CircularTrains-PT-048-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property CircularTrains-PT-048-LTLFireability-01 finished in 38733 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)||G(F(p1)))))'
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 48/48 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 89 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 87 transition count 46
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 87 transition count 41
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 82 transition count 41
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 79 transition count 38
Applied a total of 20 rules in 19 ms. Remains 79 /89 variables (removed 10) and now considering 38/48 (removed 10) transitions.
// Phase 1: matrix 38 rows 79 cols
[2024-05-20 23:49:46] [INFO ] Computed 42 invariants in 2 ms
[2024-05-20 23:49:46] [INFO ] Implicit Places using invariants in 59 ms returned [0, 11, 14, 20, 56, 70, 71, 75, 76]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 60 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/89 places, 38/48 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 70 transition count 35
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 67 transition count 35
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 67 transition count 32
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 64 transition count 32
Applied a total of 12 rules in 4 ms. Remains 64 /70 variables (removed 6) and now considering 32/38 (removed 6) transitions.
// Phase 1: matrix 32 rows 64 cols
[2024-05-20 23:49:46] [INFO ] Computed 33 invariants in 0 ms
[2024-05-20 23:49:46] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-20 23:49:46] [INFO ] Invariant cache hit.
[2024-05-20 23:49:46] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/89 places, 32/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 191 ms. Remains : 64/89 places, 32/48 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s63 1)), p1:(AND (GEQ s16 1) (GEQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5501 reset in 250 ms.
Product exploration explored 100000 steps with 5500 reset in 252 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 p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 170 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 16 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 236 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-20 23:49:48] [INFO ] Invariant cache hit.
[2024-05-20 23:49:48] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-05-20 23:49:48] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 12 ms returned sat
[2024-05-20 23:49:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:49:48] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-20 23:49:48] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-20 23:49:48] [INFO ] Added : 14 causal constraints over 3 iterations in 64 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-20 23:49:48] [INFO ] Invariant cache hit.
[2024-05-20 23:49:48] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-20 23:49:48] [INFO ] Invariant cache hit.
[2024-05-20 23:49:48] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-05-20 23:49:48] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-20 23:49:48] [INFO ] Invariant cache hit.
[2024-05-20 23:49:48] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 225 ms. Remains : 64/64 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 178 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 40 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=20 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 206 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-20 23:49:49] [INFO ] Invariant cache hit.
[2024-05-20 23:49:49] [INFO ] [Real]Absence check using 31 positive place invariants in 5 ms returned sat
[2024-05-20 23:49:49] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-20 23:49:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:49:49] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-20 23:49:49] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-20 23:49:49] [INFO ] Added : 14 causal constraints over 3 iterations in 32 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5527 reset in 234 ms.
Product exploration explored 100000 steps with 5518 reset in 244 ms.
Built C files in :
/tmp/ltsmin15933756781297228744
[2024-05-20 23:49:49] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2024-05-20 23:49:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:49:49] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2024-05-20 23:49:49] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:49:49] [INFO ] Computing Do-Not-Accords matrix : 32 transitions.
[2024-05-20 23:49:49] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:49:49] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15933756781297228744
Running compilation step : cd /tmp/ltsmin15933756781297228744;'/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 115 ms.
Running link step : cd /tmp/ltsmin15933756781297228744;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin15933756781297228744;'/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/stateBased11681824927775260791.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 8 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-20 23:50:04] [INFO ] Invariant cache hit.
[2024-05-20 23:50:04] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-20 23:50:04] [INFO ] Invariant cache hit.
[2024-05-20 23:50:05] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-20 23:50:05] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-20 23:50:05] [INFO ] Invariant cache hit.
[2024-05-20 23:50:05] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 165 ms. Remains : 64/64 places, 32/32 transitions.
Built C files in :
/tmp/ltsmin14967068927116331026
[2024-05-20 23:50:05] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2024-05-20 23:50:05] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:50:05] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2024-05-20 23:50:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:50:05] [INFO ] Computing Do-Not-Accords matrix : 32 transitions.
[2024-05-20 23:50:05] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:50:05] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14967068927116331026
Running compilation step : cd /tmp/ltsmin14967068927116331026;'/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 121 ms.
Running link step : cd /tmp/ltsmin14967068927116331026;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin14967068927116331026;'/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/stateBased13855575980534466223.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-20 23:50:20] [INFO ] Flatten gal took : 3 ms
[2024-05-20 23:50:20] [INFO ] Flatten gal took : 2 ms
[2024-05-20 23:50:20] [INFO ] Time to serialize gal into /tmp/LTL17553148105901033743.gal : 1 ms
[2024-05-20 23:50:20] [INFO ] Time to serialize properties into /tmp/LTL15687544191426614556.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/LTL17553148105901033743.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6572074993427503565.hoa' '-atoms' '/tmp/LTL15687544191426614556.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/LTL15687544191426614556.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6572074993427503565.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
407 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,4.08494,173348,1,0,1224,1.07666e+06,34,251,1448,1.15842e+06,2705
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CircularTrains-PT-048-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property CircularTrains-PT-048-LTLFireability-02 finished in 38739 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(!p0)&&X(p1)) U X(X((p2 U p3)))))'
Support contains 8 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2024-05-20 23:50:25] [INFO ] Computed 42 invariants in 3 ms
[2024-05-20 23:50:25] [INFO ] Implicit Places using invariants in 70 ms returned [1, 15, 21, 61, 79, 80, 85]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 71 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 76 ms. Remains : 82/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 313 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), true, (AND p0 (NOT p3)), (NOT p3), p0]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p3) p2), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(OR (AND p0 (NOT p3)) (AND (NOT p1) (NOT p3))), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0} source=6 dest: 6}], [{ cond=p0, acceptance={} source=7 dest: 4}, { cond=(NOT p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s11 1) (GEQ s76 1)), p1:(AND (GEQ s19 1) (GEQ s79 1)), p3:(AND (GEQ s1 1) (GEQ s27 1)), p2:(AND (GEQ s42 1) (GEQ s63 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, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 26 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-048-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLFireability-03 finished in 422 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)||X((p1&&G(p2))))))'
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-05-20 23:50:25] [INFO ] Invariant cache hit.
[2024-05-20 23:50:25] [INFO ] Implicit Places using invariants in 54 ms returned [1, 12, 15, 61, 79, 80, 86]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 55 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59 ms. Remains : 82/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (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))]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GEQ s56 1) (GEQ s61 1)), p1:(OR (LT s12 1) (LT s79 1)), p2:(OR (LT s18 1) (LT s78 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2941 reset in 227 ms.
Product exploration explored 100000 steps with 2940 reset in 232 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 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))))))]
Knowledge based reduction with 2 factoid took 170 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Finished random walk after 52 steps, including 0 resets, run visited all 5 properties in 7 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 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)))))), (F (NOT (AND p1 (NOT p0) p2))), (F (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))), (F p0), (F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 2 factoid took 236 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 82 cols
[2024-05-20 23:50:27] [INFO ] Computed 35 invariants in 9 ms
[2024-05-20 23:50:27] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-20 23:50:27] [INFO ] Invariant cache hit.
[2024-05-20 23:50:27] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-05-20 23:50:27] [INFO ] Invariant cache hit.
[2024-05-20 23:50:27] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165 ms. Remains : 82/82 places, 48/48 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1)]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2))))]
Knowledge based reduction with 1 factoid took 139 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Finished random walk after 35 steps, including 0 resets, run visited all 5 properties in 1 ms. (steps per millisecond=35 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1)]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (F (NOT (AND (NOT p0) p1 p2))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (F p0), (F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 1 factoid took 276 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Product exploration explored 100000 steps with 2975 reset in 220 ms.
Product exploration explored 100000 steps with 2926 reset in 239 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 48/48 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 82 transition count 48
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 10 place count 82 transition count 48
Deduced a syphon composed of 12 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 82 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 82 transition count 48
Deduced a syphon composed of 14 places in 0 ms
Applied a total of 14 rules in 13 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-05-20 23:50:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 48 rows 82 cols
[2024-05-20 23:50:29] [INFO ] Computed 35 invariants in 1 ms
[2024-05-20 23:50:30] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/82 places, 48/48 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68 ms. Remains : 82/82 places, 48/48 transitions.
Built C files in :
/tmp/ltsmin16025200643113122121
[2024-05-20 23:50:30] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16025200643113122121
Running compilation step : cd /tmp/ltsmin16025200643113122121;'/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 129 ms.
Running link step : cd /tmp/ltsmin16025200643113122121;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16025200643113122121;'/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/stateBased5540289280830739923.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 82 cols
[2024-05-20 23:50:45] [INFO ] Computed 35 invariants in 3 ms
[2024-05-20 23:50:45] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-20 23:50:45] [INFO ] Invariant cache hit.
[2024-05-20 23:50:45] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2024-05-20 23:50:45] [INFO ] Invariant cache hit.
[2024-05-20 23:50:45] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171 ms. Remains : 82/82 places, 48/48 transitions.
Built C files in :
/tmp/ltsmin17860819526467754264
[2024-05-20 23:50:45] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17860819526467754264
Running compilation step : cd /tmp/ltsmin17860819526467754264;'/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 129 ms.
Running link step : cd /tmp/ltsmin17860819526467754264;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17860819526467754264;'/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/stateBased14507113659793436388.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-20 23:51:00] [INFO ] Flatten gal took : 4 ms
[2024-05-20 23:51:00] [INFO ] Flatten gal took : 4 ms
[2024-05-20 23:51:00] [INFO ] Time to serialize gal into /tmp/LTL17101364412435147943.gal : 1 ms
[2024-05-20 23:51:00] [INFO ] Time to serialize properties into /tmp/LTL13785134567585548676.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/LTL17101364412435147943.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7326627414586735965.hoa' '-atoms' '/tmp/LTL13785134567585548676.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/LTL13785134567585548676.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7326627414586735965.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-20 23:51:15] [INFO ] Flatten gal took : 5 ms
[2024-05-20 23:51:15] [INFO ] Flatten gal took : 4 ms
[2024-05-20 23:51:15] [INFO ] Time to serialize gal into /tmp/LTL416638614323032969.gal : 1 ms
[2024-05-20 23:51:15] [INFO ] Time to serialize properties into /tmp/LTL5431259244072095558.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/LTL416638614323032969.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5431259244072095558.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...274
Read 1 LTL properties
Checking formula 0 : !((X((F("((Section_26>=1)&&(F27>=1))"))||(X(("((Section_16<1)||(F17<1))")&&(G("((F2<1)||(Section_1<1))")))))))
Formula 0 simplified : X(G!"((Section_26>=1)&&(F27>=1))" & X(!"((Section_16<1)||(F17<1))" | F!"((F2<1)||(Section_1<1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-20 23:51:30] [INFO ] Flatten gal took : 9 ms
[2024-05-20 23:51:30] [INFO ] Applying decomposition
[2024-05-20 23:51:30] [INFO ] Flatten gal took : 3 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/graph8017162912603942045.txt' '-o' '/tmp/graph8017162912603942045.bin' '-w' '/tmp/graph8017162912603942045.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8017162912603942045.bin' '-l' '-1' '-v' '-w' '/tmp/graph8017162912603942045.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:51:30] [INFO ] Decomposing Gal with order
[2024-05-20 23:51:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:51:30] [INFO ] Flatten gal took : 26 ms
[2024-05-20 23:51:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-20 23:51:30] [INFO ] Time to serialize gal into /tmp/LTL12888535642306833716.gal : 2 ms
[2024-05-20 23:51:30] [INFO ] Time to serialize properties into /tmp/LTL473766164717681823.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/LTL12888535642306833716.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL473766164717681823.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 : !((X((F("((i1.u1.Section_26>=1)&&(i4.u5.F27>=1))"))||(X(("((i5.u2.Section_16<1)||(i5.u7.F17<1))")&&(G("((i0.u14.F2<1)||(i0.u14.Section...169
Formula 0 simplified : X(G!"((i1.u1.Section_26>=1)&&(i4.u5.F27>=1))" & X(!"((i5.u2.Section_16<1)||(i5.u7.F17<1))" | F!"((i0.u14.F2<1)||(i0.u14.Section_1<1)...159
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1869535251911682967
[2024-05-20 23:51:45] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1869535251911682967
Running compilation step : cd /tmp/ltsmin1869535251911682967;'/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 118 ms.
Running link step : cd /tmp/ltsmin1869535251911682967;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1869535251911682967;'/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))||X(((LTLAPp1==true)&&[]((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-048-LTLFireability-04 finished in 94977 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))'
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 89 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 86 transition count 45
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 86 transition count 41
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 14 place count 82 transition count 41
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 78 transition count 37
Applied a total of 22 rules in 11 ms. Remains 78 /89 variables (removed 11) and now considering 37/48 (removed 11) transitions.
// Phase 1: matrix 37 rows 78 cols
[2024-05-20 23:52:00] [INFO ] Computed 42 invariants in 1 ms
[2024-05-20 23:52:00] [INFO ] Implicit Places using invariants in 78 ms returned [0, 11, 14, 20, 55, 69, 70, 74, 75]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 80 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/89 places, 37/48 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 69 transition count 33
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 65 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 64 transition count 32
Applied a total of 10 rules in 3 ms. Remains 64 /69 variables (removed 5) and now considering 32/37 (removed 5) transitions.
// Phase 1: matrix 32 rows 64 cols
[2024-05-20 23:52:00] [INFO ] Computed 33 invariants in 1 ms
[2024-05-20 23:52:00] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-20 23:52:00] [INFO ] Invariant cache hit.
[2024-05-20 23:52:01] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/89 places, 32/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 194 ms. Remains : 64/89 places, 32/48 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s29 1) (LT s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7865 reset in 233 ms.
Product exploration explored 100000 steps with 7960 reset in 237 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 125 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 26 ms :[(NOT p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 169 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 65 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
[2024-05-20 23:52:02] [INFO ] Invariant cache hit.
[2024-05-20 23:52:02] [INFO ] [Real]Absence check using 31 positive place invariants in 5 ms returned sat
[2024-05-20 23:52:02] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 23:52:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:52:02] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-20 23:52:02] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-20 23:52:02] [INFO ] Added : 14 causal constraints over 3 iterations in 32 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-20 23:52:02] [INFO ] Invariant cache hit.
[2024-05-20 23:52:02] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-20 23:52:02] [INFO ] Invariant cache hit.
[2024-05-20 23:52:02] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-05-20 23:52:02] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-20 23:52:02] [INFO ] Invariant cache hit.
[2024-05-20 23:52:02] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 695 ms. Remains : 64/64 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 164 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)]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 311 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 30 ms :[(NOT p0)]
[2024-05-20 23:52:03] [INFO ] Invariant cache hit.
[2024-05-20 23:52:03] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-05-20 23:52:03] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 23:52:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:52:03] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-20 23:52:03] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-20 23:52:03] [INFO ] Added : 14 causal constraints over 3 iterations in 18 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7978 reset in 226 ms.
Product exploration explored 100000 steps with 7864 reset in 236 ms.
Built C files in :
/tmp/ltsmin2869319641176440806
[2024-05-20 23:52:04] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2024-05-20 23:52:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:52:04] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2024-05-20 23:52:04] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:52:04] [INFO ] Computing Do-Not-Accords matrix : 32 transitions.
[2024-05-20 23:52:04] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:52:04] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2869319641176440806
Running compilation step : cd /tmp/ltsmin2869319641176440806;'/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 114 ms.
Running link step : cd /tmp/ltsmin2869319641176440806;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2869319641176440806;'/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/stateBased7701167012746588099.hoa' '--buchi-type=spotba'
LTSmin run took 167 ms.
FORMULA CircularTrains-PT-048-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-048-LTLFireability-05 finished in 3538 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(p0) U G(p1)))'
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2024-05-20 23:52:04] [INFO ] Computed 42 invariants in 1 ms
[2024-05-20 23:52:04] [INFO ] Implicit Places using invariants in 60 ms returned [1, 12, 15, 21, 61, 79, 80, 85, 86]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 61 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63 ms. Remains : 80/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s34 1)), p0:(AND (GEQ s7 1) (GEQ s40 1) (GEQ s2 1) (GEQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 26 steps with 6 reset in 0 ms.
FORMULA CircularTrains-PT-048-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLFireability-06 finished in 236 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(p1)&&F(G(p2)))))'
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 48/48 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 89 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 87 transition count 46
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 87 transition count 41
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 14 place count 82 transition count 41
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 79 transition count 38
Applied a total of 20 rules in 11 ms. Remains 79 /89 variables (removed 10) and now considering 38/48 (removed 10) transitions.
// Phase 1: matrix 38 rows 79 cols
[2024-05-20 23:52:04] [INFO ] Computed 42 invariants in 2 ms
[2024-05-20 23:52:04] [INFO ] Implicit Places using invariants in 60 ms returned [0, 11, 14, 20, 55, 70, 71, 75, 76]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 61 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/89 places, 38/48 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 70 transition count 35
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 67 transition count 35
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 67 transition count 32
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 64 transition count 32
Applied a total of 12 rules in 3 ms. Remains 64 /70 variables (removed 6) and now considering 32/38 (removed 6) transitions.
// Phase 1: matrix 32 rows 64 cols
[2024-05-20 23:52:04] [INFO ] Computed 33 invariants in 1 ms
[2024-05-20 23:52:04] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-20 23:52:04] [INFO ] Invariant cache hit.
[2024-05-20 23:52:04] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/89 places, 32/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 171 ms. Remains : 64/89 places, 32/48 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-07 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 p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s55 1) (LT s59 1)), p1:(OR (LT s13 1) (LT s60 1)), p2:(OR (LT s7 1) (LT s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1 reset in 215 ms.
Stack based approach found an accepted trace after 47370 steps with 0 reset with depth 47371 and stack size 47371 in 112 ms.
FORMULA CircularTrains-PT-048-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-048-LTLFireability-07 finished in 715 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(F(p0))))'
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2024-05-20 23:52:05] [INFO ] Computed 42 invariants in 1 ms
[2024-05-20 23:52:05] [INFO ] Implicit Places using invariants in 62 ms returned [1, 12, 15, 21, 61, 79, 80, 85, 86]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 63 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65 ms. Remains : 80/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s55 1) (GEQ s60 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 2973 reset in 205 ms.
Product exploration explored 100000 steps with 2961 reset in 221 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 36 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=36 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 48 rows 80 cols
[2024-05-20 23:52:06] [INFO ] Computed 33 invariants in 2 ms
[2024-05-20 23:52:06] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-05-20 23:52:06] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 23:52:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:52:06] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-20 23:52:06] [INFO ] Computed and/alt/rep : 32/48/32 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-20 23:52:06] [INFO ] Added : 29 causal constraints over 6 iterations in 52 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-05-20 23:52:06] [INFO ] Invariant cache hit.
[2024-05-20 23:52:06] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-20 23:52:06] [INFO ] Invariant cache hit.
[2024-05-20 23:52:06] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-05-20 23:52:06] [INFO ] Invariant cache hit.
[2024-05-20 23:52:06] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 184 ms. Remains : 80/80 places, 48/48 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 (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 39 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=39 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-20 23:52:07] [INFO ] Invariant cache hit.
[2024-05-20 23:52:07] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-05-20 23:52:07] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 23:52:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:52:07] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-20 23:52:07] [INFO ] Computed and/alt/rep : 32/48/32 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-20 23:52:07] [INFO ] Added : 29 causal constraints over 6 iterations in 45 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2967 reset in 206 ms.
Product exploration explored 100000 steps with 2942 reset in 217 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 48/48 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 80 transition count 48
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 14 place count 80 transition count 48
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 80 transition count 48
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 16 rules in 5 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-05-20 23:52:08] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 48 rows 80 cols
[2024-05-20 23:52:08] [INFO ] Computed 33 invariants in 0 ms
[2024-05-20 23:52:08] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/80 places, 48/48 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47 ms. Remains : 80/80 places, 48/48 transitions.
Built C files in :
/tmp/ltsmin17355265197367654752
[2024-05-20 23:52:08] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17355265197367654752
Running compilation step : cd /tmp/ltsmin17355265197367654752;'/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 115 ms.
Running link step : cd /tmp/ltsmin17355265197367654752;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17355265197367654752;'/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/stateBased2307087961971839866.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 80 cols
[2024-05-20 23:52:23] [INFO ] Computed 33 invariants in 1 ms
[2024-05-20 23:52:23] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-20 23:52:23] [INFO ] Invariant cache hit.
[2024-05-20 23:52:23] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-05-20 23:52:23] [INFO ] Invariant cache hit.
[2024-05-20 23:52:23] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 157 ms. Remains : 80/80 places, 48/48 transitions.
Built C files in :
/tmp/ltsmin4155016979754281406
[2024-05-20 23:52:23] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4155016979754281406
Running compilation step : cd /tmp/ltsmin4155016979754281406;'/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 130 ms.
Running link step : cd /tmp/ltsmin4155016979754281406;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin4155016979754281406;'/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/stateBased14135774583394714318.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-20 23:52:38] [INFO ] Flatten gal took : 4 ms
[2024-05-20 23:52:38] [INFO ] Flatten gal took : 3 ms
[2024-05-20 23:52:38] [INFO ] Time to serialize gal into /tmp/LTL13535437054893921485.gal : 1 ms
[2024-05-20 23:52:38] [INFO ] Time to serialize properties into /tmp/LTL8002293604125810540.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/LTL13535437054893921485.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17922971509803852778.hoa' '-atoms' '/tmp/LTL8002293604125810540.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/LTL8002293604125810540.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17922971509803852778.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
549 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,5.50476,214184,1,0,923,1.22195e+06,20,185,1696,1.38168e+06,1849
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CircularTrains-PT-048-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property CircularTrains-PT-048-LTLFireability-08 finished in 40181 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)||G(F(!p1)))))'
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2024-05-20 23:52:45] [INFO ] Computed 42 invariants in 2 ms
[2024-05-20 23:52:45] [INFO ] Implicit Places using invariants in 68 ms returned [1, 12, 15, 21, 61, 79, 80, 85, 86]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 69 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 70 ms. Remains : 80/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s35 1)), p1:(OR (LT s16 1) (LT s72 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][false, false, false, false]]
Product exploration explored 100000 steps with 2434 reset in 210 ms.
Product exploration explored 100000 steps with 2385 reset in 220 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), true, (X (X p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 224 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) p1), p1, p1]
Finished random walk after 51 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true, (X (X p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 3 factoid took 276 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 137 ms :[(AND (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) p1), p1, p1]
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 48/48 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 80 transition count 35
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 67 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 66 transition count 34
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 28 place count 66 transition count 32
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 32 place count 64 transition count 32
Applied a total of 32 rules in 8 ms. Remains 64 /80 variables (removed 16) and now considering 32/48 (removed 16) transitions.
// Phase 1: matrix 32 rows 64 cols
[2024-05-20 23:52:47] [INFO ] Computed 33 invariants in 1 ms
[2024-05-20 23:52:47] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-20 23:52:47] [INFO ] Invariant cache hit.
[2024-05-20 23:52:47] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-05-20 23:52:47] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-20 23:52:47] [INFO ] Invariant cache hit.
[2024-05-20 23:52:47] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/80 places, 32/48 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 159 ms. Remains : 64/80 places, 32/48 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 p1), true]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 391 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 101 ms :[(AND (NOT p0) p1), p1, p1]
Finished random walk after 27 steps, including 0 resets, run visited all 3 properties in 11 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), true]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 3 factoid took 330 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 136 ms :[(AND (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) p1), p1, p1]
Product exploration explored 100000 steps with 3155 reset in 215 ms.
Product exploration explored 100000 steps with 3182 reset in 227 ms.
Built C files in :
/tmp/ltsmin4384012362514555016
[2024-05-20 23:52:48] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2024-05-20 23:52:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:52:48] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2024-05-20 23:52:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:52:48] [INFO ] Computing Do-Not-Accords matrix : 32 transitions.
[2024-05-20 23:52:48] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:52:48] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4384012362514555016
Running compilation step : cd /tmp/ltsmin4384012362514555016;'/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 126 ms.
Running link step : cd /tmp/ltsmin4384012362514555016;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin4384012362514555016;'/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/stateBased198310194865431095.hoa' '--buchi-type=spotba'
LTSmin run took 101 ms.
FORMULA CircularTrains-PT-048-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-048-LTLFireability-10 finished in 3668 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||G(!p1))))'
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 48/48 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 89 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 87 transition count 46
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 87 transition count 41
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 14 place count 82 transition count 41
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 78 transition count 37
Applied a total of 22 rules in 7 ms. Remains 78 /89 variables (removed 11) and now considering 37/48 (removed 11) transitions.
// Phase 1: matrix 37 rows 78 cols
[2024-05-20 23:52:49] [INFO ] Computed 42 invariants in 1 ms
[2024-05-20 23:52:49] [INFO ] Implicit Places using invariants in 52 ms returned [0, 11, 14, 20, 69, 70, 74, 75]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 53 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/89 places, 37/48 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 70 transition count 34
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 67 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 66 transition count 33
Applied a total of 8 rules in 2 ms. Remains 66 /70 variables (removed 4) and now considering 33/37 (removed 4) transitions.
// Phase 1: matrix 33 rows 66 cols
[2024-05-20 23:52:49] [INFO ] Computed 34 invariants in 5 ms
[2024-05-20 23:52:49] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-20 23:52:49] [INFO ] Invariant cache hit.
[2024-05-20 23:52:49] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/89 places, 33/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 171 ms. Remains : 66/89 places, 33/48 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND p1 (NOT p0))]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (LT s56 1) (LT s60 1)), p0:(AND (GEQ s49 1) (GEQ s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7924 reset in 225 ms.
Product exploration explored 100000 steps with 7974 reset in 237 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 2 factoid took 176 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 228 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) p1)]
[2024-05-20 23:52:50] [INFO ] Invariant cache hit.
[2024-05-20 23:52:50] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-05-20 23:52:50] [INFO ] [Real]Absence check using 31 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-20 23:52:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:52:50] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-20 23:52:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:52:50] [INFO ] [Nat]Absence check using 31 positive place invariants in 5 ms returned sat
[2024-05-20 23:52:50] [INFO ] [Nat]Absence check using 31 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-20 23:52:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 23:52:50] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-20 23:52:50] [INFO ] Computed and/alt/rep : 17/33/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-20 23:52:50] [INFO ] Added : 15 causal constraints over 3 iterations in 28 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-20 23:52:50] [INFO ] Invariant cache hit.
[2024-05-20 23:52:50] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-20 23:52:50] [INFO ] Invariant cache hit.
[2024-05-20 23:52:50] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-20 23:52:50] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-20 23:52:50] [INFO ] Invariant cache hit.
[2024-05-20 23:52:50] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 164 ms. Remains : 66/66 places, 33/33 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) p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 203 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) p1)]
Finished random walk after 21 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 243 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) p1)]
[2024-05-20 23:52:51] [INFO ] Invariant cache hit.
[2024-05-20 23:52:51] [INFO ] [Real]Absence check using 31 positive place invariants in 5 ms returned sat
[2024-05-20 23:52:51] [INFO ] [Real]Absence check using 31 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-20 23:52:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:52:51] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-20 23:52:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:52:51] [INFO ] [Nat]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-05-20 23:52:51] [INFO ] [Nat]Absence check using 31 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-20 23:52:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 23:52:51] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-20 23:52:51] [INFO ] Computed and/alt/rep : 17/33/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-20 23:52:51] [INFO ] Added : 15 causal constraints over 3 iterations in 30 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) p1)]
Product exploration explored 100000 steps with 7983 reset in 234 ms.
Product exploration explored 100000 steps with 7930 reset in 246 ms.
Built C files in :
/tmp/ltsmin17722146781960718464
[2024-05-20 23:52:51] [INFO ] Computing symmetric may disable matrix : 33 transitions.
[2024-05-20 23:52:51] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:52:51] [INFO ] Computing symmetric may enable matrix : 33 transitions.
[2024-05-20 23:52:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:52:51] [INFO ] Computing Do-Not-Accords matrix : 33 transitions.
[2024-05-20 23:52:51] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:52:51] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17722146781960718464
Running compilation step : cd /tmp/ltsmin17722146781960718464;'/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 111 ms.
Running link step : cd /tmp/ltsmin17722146781960718464;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17722146781960718464;'/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/stateBased6017239300320692078.hoa' '--buchi-type=spotba'
LTSmin run took 61 ms.
FORMULA CircularTrains-PT-048-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-048-LTLFireability-11 finished in 3054 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(F((p1||G(p2))))))'
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2024-05-20 23:52:52] [INFO ] Computed 42 invariants in 1 ms
[2024-05-20 23:52:52] [INFO ] Implicit Places using invariants in 55 ms returned [1, 12, 15, 21, 80, 85, 86]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 56 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/89 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 82/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s33 1) (GEQ s50 1)), p1:(AND (GEQ s5 1) (GEQ s75 1)), p2:(AND (GEQ s57 1) (GEQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 7620 reset in 247 ms.
Product exploration explored 100000 steps with 7607 reset in 256 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))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 263 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false, false, false]
Finished random walk after 332 steps, including 0 resets, run visited all 8 properties in 24 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 p1 p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 1 factoid took 424 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter insensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false, false, false]
// Phase 1: matrix 48 rows 82 cols
[2024-05-20 23:52:54] [INFO ] Computed 35 invariants in 1 ms
[2024-05-20 23:52:54] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned sat
[2024-05-20 23:52:54] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-20 23:52:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:52:54] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-20 23:52:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:52:54] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned sat
[2024-05-20 23:52:54] [INFO ] [Nat]Absence check using 30 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-20 23:52:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 23:52:54] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-20 23:52:54] [INFO ] Computed and/alt/rep : 32/48/32 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-20 23:52:54] [INFO ] Added : 29 causal constraints over 6 iterations in 37 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 48/48 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 82 transition count 38
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 72 transition count 38
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 20 place count 72 transition count 36
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 24 place count 70 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 28 place count 68 transition count 34
Applied a total of 28 rules in 5 ms. Remains 68 /82 variables (removed 14) and now considering 34/48 (removed 14) transitions.
// Phase 1: matrix 34 rows 68 cols
[2024-05-20 23:52:54] [INFO ] Computed 35 invariants in 1 ms
[2024-05-20 23:52:54] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-20 23:52:54] [INFO ] Invariant cache hit.
[2024-05-20 23:52:54] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-20 23:52:54] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-20 23:52:54] [INFO ] Invariant cache hit.
[2024-05-20 23:52:54] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/82 places, 34/48 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 136 ms. Remains : 68/82 places, 34/48 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) (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
Knowledge based reduction with 9 factoid took 484 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter insensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false, false, false]
Finished random walk after 50 steps, including 0 resets, run visited all 8 properties in 5 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 p1 p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 9 factoid took 834 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter insensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 305 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false, false, false]
[2024-05-20 23:52:57] [INFO ] Invariant cache hit.
[2024-05-20 23:52:57] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned sat
[2024-05-20 23:52:57] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-20 23:52:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:52:57] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-20 23:52:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:52:57] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned sat
[2024-05-20 23:52:57] [INFO ] [Nat]Absence check using 30 positive and 5 generalized place invariants in 5 ms returned sat
[2024-05-20 23:52:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 23:52:57] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-20 23:52:57] [INFO ] Computed and/alt/rep : 18/34/18 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-20 23:52:57] [INFO ] Added : 16 causal constraints over 4 iterations in 28 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 429 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false, false, false]
Product exploration explored 100000 steps with 10717 reset in 242 ms.
Product exploration explored 100000 steps with 10716 reset in 261 ms.
Built C files in :
/tmp/ltsmin16266010842931724202
[2024-05-20 23:52:58] [INFO ] Computing symmetric may disable matrix : 34 transitions.
[2024-05-20 23:52:58] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:52:58] [INFO ] Computing symmetric may enable matrix : 34 transitions.
[2024-05-20 23:52:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:52:58] [INFO ] Computing Do-Not-Accords matrix : 34 transitions.
[2024-05-20 23:52:58] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:52:58] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16266010842931724202
Running compilation step : cd /tmp/ltsmin16266010842931724202;'/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 118 ms.
Running link step : cd /tmp/ltsmin16266010842931724202;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16266010842931724202;'/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/stateBased12587537567264778042.hoa' '--buchi-type=spotba'
LTSmin run took 111 ms.
FORMULA CircularTrains-PT-048-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-048-LTLFireability-12 finished in 6245 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))'
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 89 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 86 transition count 45
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 86 transition count 41
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 14 place count 82 transition count 41
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 79 transition count 38
Applied a total of 20 rules in 6 ms. Remains 79 /89 variables (removed 10) and now considering 38/48 (removed 10) transitions.
// Phase 1: matrix 38 rows 79 cols
[2024-05-20 23:52:58] [INFO ] Computed 42 invariants in 1 ms
[2024-05-20 23:52:58] [INFO ] Implicit Places using invariants in 53 ms returned [1, 12, 15, 21, 56, 70, 71, 75, 76]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 54 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/89 places, 38/48 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 70 transition count 34
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 66 transition count 34
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 66 transition count 32
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 12 place count 64 transition count 32
Applied a total of 12 rules in 3 ms. Remains 64 /70 variables (removed 6) and now considering 32/38 (removed 6) transitions.
// Phase 1: matrix 32 rows 64 cols
[2024-05-20 23:52:58] [INFO ] Computed 33 invariants in 0 ms
[2024-05-20 23:52:58] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-20 23:52:58] [INFO ] Invariant cache hit.
[2024-05-20 23:52:58] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/89 places, 32/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 158 ms. Remains : 64/89 places, 32/48 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5596 reset in 204 ms.
Product exploration explored 100000 steps with 5610 reset in 220 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 129 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 25 ms :[(NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
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 117 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 30 ms :[(NOT p0)]
[2024-05-20 23:52:59] [INFO ] Invariant cache hit.
[2024-05-20 23:52:59] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-05-20 23:52:59] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 23:52:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:52:59] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-20 23:52:59] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-20 23:52:59] [INFO ] Added : 14 causal constraints over 3 iterations in 24 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-20 23:52:59] [INFO ] Invariant cache hit.
[2024-05-20 23:52:59] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-20 23:52:59] [INFO ] Invariant cache hit.
[2024-05-20 23:52:59] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-20 23:52:59] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-20 23:52:59] [INFO ] Invariant cache hit.
[2024-05-20 23:52:59] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 146 ms. Remains : 64/64 places, 32/32 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 103 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 32 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 116 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 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-05-20 23:53:00] [INFO ] Invariant cache hit.
[2024-05-20 23:53:00] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-05-20 23:53:00] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 23:53:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:53:00] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-20 23:53:00] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-20 23:53:00] [INFO ] Added : 14 causal constraints over 3 iterations in 23 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5586 reset in 221 ms.
Product exploration explored 100000 steps with 5683 reset in 236 ms.
Built C files in :
/tmp/ltsmin16870843846239654919
[2024-05-20 23:53:00] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2024-05-20 23:53:00] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:53:00] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2024-05-20 23:53:00] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:53:00] [INFO ] Computing Do-Not-Accords matrix : 32 transitions.
[2024-05-20 23:53:00] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:53:00] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16870843846239654919
Running compilation step : cd /tmp/ltsmin16870843846239654919;'/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 117 ms.
Running link step : cd /tmp/ltsmin16870843846239654919;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16870843846239654919;'/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/stateBased5598862179300118897.hoa' '--buchi-type=spotba'
LTSmin run took 65 ms.
FORMULA CircularTrains-PT-048-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-048-LTLFireability-13 finished in 2395 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((!p0&&X(p1))))'
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2024-05-20 23:53:00] [INFO ] Computed 42 invariants in 1 ms
[2024-05-20 23:53:00] [INFO ] Implicit Places using invariants in 52 ms returned [1, 12, 15, 21, 61, 79, 85, 86]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 53 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/89 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 53 ms. Remains : 81/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (GEQ s65 1) (GEQ s71 1) (GEQ s56 1) (GEQ s74 1)), p0:(AND (GEQ s8 1) (GEQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-048-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLFireability-15 finished in 229 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)||X((p1&&G(p2))))))'
[2024-05-20 23:53:01] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
[2024-05-20 23:53:01] [INFO ] Applying decomposition
[2024-05-20 23:53:01] [INFO ] Flatten gal took : 4 ms
Built C files in :
/tmp/ltsmin12452340322253544217
[2024-05-20 23:53:01] [INFO ] Computing symmetric may disable matrix : 48 transitions.
[2024-05-20 23:53:01] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:53:01] [INFO ] Computing symmetric may enable matrix : 48 transitions.
[2024-05-20 23:53:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:53:01] [INFO ] Computing Do-Not-Accords matrix : 48 transitions.
[2024-05-20 23:53:01] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 23:53:01] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12452340322253544217
Running compilation step : cd /tmp/ltsmin12452340322253544217;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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/graph12796855283126655973.txt' '-o' '/tmp/graph12796855283126655973.bin' '-w' '/tmp/graph12796855283126655973.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12796855283126655973.bin' '-l' '-1' '-v' '-w' '/tmp/graph12796855283126655973.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:53:01] [INFO ] Decomposing Gal with order
[2024-05-20 23:53:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:53:01] [INFO ] Flatten gal took : 5 ms
[2024-05-20 23:53:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-20 23:53:01] [INFO ] Time to serialize gal into /tmp/LTLFireability17465803320769615357.gal : 1 ms
[2024-05-20 23:53:01] [INFO ] Time to serialize properties into /tmp/LTLFireability4374991185460287243.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/LTLFireability17465803320769615357.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4374991185460287243.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...277
Read 1 LTL properties
Checking formula 0 : !((X((F("((i3.u11.Section_26>=1)&&(i3.u10.F27>=1))"))||(X(("((i4.u6.Section_16<1)||(i4.u14.F17<1))")&&(G("((i0.u2.F2<1)||(i5.u8.Sectio...170
Formula 0 simplified : X(G!"((i3.u11.Section_26>=1)&&(i3.u10.F27>=1))" & X(!"((i4.u6.Section_16<1)||(i4.u14.F17<1))" | F!"((i0.u2.F2<1)||(i5.u8.Section_1<1...160
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 143 ms.
Running link step : cd /tmp/ltsmin12452340322253544217;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin12452340322253544217;'/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))||X(((LTLAPp1==true)&&[]((LTLAPp2==true))))))' '--buchi-type=spotba'
228 unique states visited
0 strongly connected components in search stack
227 transitions explored
116 items max in DFS search stack
3759 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,37.6133,730396,1,0,1.6275e+06,902,635,815292,271,3250,865870
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CircularTrains-PT-048-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 329664 ms.

BK_STOP 1716249277079

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

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