Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813800396.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is CircularTrains-PT-024, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813800396
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 19K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748887644675

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-024
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 18:07:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 18:07:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 18:07:26] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2025-06-02 18:07:26] [INFO ] Transformed 48 places.
[2025-06-02 18:07:26] [INFO ] Transformed 24 transitions.
[2025-06-02 18:07:26] [INFO ] Parsed PT model containing 48 places and 24 transitions and 96 arcs in 224 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CircularTrains-PT-024-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-024-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-024-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 13 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 48 cols
[2025-06-02 18:07:27] [INFO ] Computed 25 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:07:27] [INFO ] Implicit Places using invariants in 450 ms returned [4, 30, 41]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 505 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/48 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 543 ms. Remains : 45/48 places, 24/24 transitions.
Support contains 40 out of 45 places after structural reductions.
[2025-06-02 18:07:28] [INFO ] Flatten gal took : 46 ms
[2025-06-02 18:07:28] [INFO ] Flatten gal took : 15 ms
[2025-06-02 18:07:28] [INFO ] Input system was already deterministic with 24 transitions.
Support contains 38 out of 45 places (down from 40) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 22 to 21
RANDOM walk for 246 steps (0 resets) in 74 ms. (3 steps per ms) remains 0/21 properties
FORMULA CircularTrains-PT-024-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CircularTrains-PT-024-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G(p1)))))'
Support contains 4 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 24/24 transitions.
Applied a total of 0 rules in 4 ms. Remains 45 /45 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 45 cols
[2025-06-02 18:07:29] [INFO ] Computed 22 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:07:29] [INFO ] Implicit Places using invariants in 153 ms returned [5, 37, 43, 44]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 156 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 41/45 places, 24/24 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 164 ms. Remains : 41/45 places, 24/24 transitions.
Stuttering acceptance computed with spot in 347 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-024-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 5 ms.
FORMULA CircularTrains-PT-024-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-024-LTLFireability-00 finished in 765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 24/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 44 transition count 23
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 44 transition count 21
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 6 place count 42 transition count 21
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 10 place count 40 transition count 19
Applied a total of 10 rules in 57 ms. Remains 40 /45 variables (removed 5) and now considering 19/24 (removed 5) transitions.
// Phase 1: matrix 19 rows 40 cols
[2025-06-02 18:07:29] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:07:29] [INFO ] Implicit Places using invariants in 168 ms returned [5, 9, 35, 38, 39]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 171 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/45 places, 19/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 35 transition count 17
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 33 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 32 transition count 16
Applied a total of 6 rules in 9 ms. Remains 32 /35 variables (removed 3) and now considering 16/19 (removed 3) transitions.
// Phase 1: matrix 16 rows 32 cols
[2025-06-02 18:07:29] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:07:29] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-02 18:07:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:07:30] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/45 places, 16/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 493 ms. Remains : 32/45 places, 16/24 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-024-LTLFireability-02
Product exploration explored 100000 steps with 14759 reset in 393 ms.
Product exploration explored 100000 steps with 14801 reset in 463 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 232 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 49 ms :[(NOT p0)]
RANDOM walk for 11 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
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 239 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2025-06-02 18:07:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 18:07:31] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2025-06-02 18:07:31] [INFO ] [Real]Absence check using 15 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-02 18:07:31] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-02 18:07:31] [INFO ] Computed and/alt/rep : 8/16/8 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 18:07:31] [INFO ] Added : 6 causal constraints over 2 iterations in 45 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Applied a total of 0 rules in 5 ms. Remains 32 /32 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2025-06-02 18:07:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:07:31] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-02 18:07:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:07:32] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:07:32] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2025-06-02 18:07:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 15/31 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 1/32 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 16/48 variables, 32/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 49 constraints, problems are : Problem set: 0 solved, 8 unsolved in 387 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 15/31 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 1/32 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 16/48 variables, 32/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 57 constraints, problems are : Problem set: 0 solved, 8 unsolved in 305 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 717ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 723ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 950 ms. Remains : 32/32 places, 16/16 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 168 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 44 ms :[(NOT p0)]
RANDOM walk for 10 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
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 232 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 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2025-06-02 18:07:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 18:07:33] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-02 18:07:33] [INFO ] [Real]Absence check using 15 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-02 18:07:33] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-02 18:07:33] [INFO ] Computed and/alt/rep : 8/16/8 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 18:07:33] [INFO ] Added : 6 causal constraints over 2 iterations in 22 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14728 reset in 246 ms.
Product exploration explored 100000 steps with 14586 reset in 154 ms.
Built C files in :
/tmp/ltsmin2511846476526148718
[2025-06-02 18:07:33] [INFO ] Computing symmetric may disable matrix : 16 transitions.
[2025-06-02 18:07:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:07:33] [INFO ] Computing symmetric may enable matrix : 16 transitions.
[2025-06-02 18:07:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:07:33] [INFO ] Computing Do-Not-Accords matrix : 16 transitions.
[2025-06-02 18:07:33] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:07:33] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2511846476526148718
Running compilation step : cd /tmp/ltsmin2511846476526148718;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 559 ms.
Running link step : cd /tmp/ltsmin2511846476526148718;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin2511846476526148718;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16066159035550852359.hoa' '--buchi-type=spotba'
LTSmin run took 96 ms.
FORMULA CircularTrains-PT-024-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-024-LTLFireability-02 finished in 5126 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 4 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 45 cols
[2025-06-02 18:07:34] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:07:34] [INFO ] Implicit Places using invariants in 101 ms returned [5, 9, 37, 43, 44]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 105 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 40/45 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109 ms. Remains : 40/45 places, 24/24 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-024-LTLFireability-05
Product exploration explored 100000 steps with 25000 reset in 188 ms.
Product exploration explored 100000 steps with 25000 reset in 302 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 178 steps (0 resets) in 9 ms. (17 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 129 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 40 cols
[2025-06-02 18:07:36] [INFO ] Computed 17 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:07:36] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-02 18:07:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:07:36] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 16 sub problems to find dead transitions.
[2025-06-02 18:07:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 15/39 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 24/64 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/64 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/64 variables, and 57 constraints, problems are : Problem set: 0 solved, 16 unsolved in 559 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 15/39 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 24/64 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/64 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/64 variables, and 73 constraints, problems are : Problem set: 0 solved, 16 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1007ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 1008ms
Finished structural reductions in LTL mode , in 1 iterations and 1196 ms. Remains : 40/40 places, 24/24 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 75 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 185 steps (0 resets) in 8 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 120 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 204 ms.
Product exploration explored 100000 steps with 25000 reset in 241 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 24/24 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 40 transition count 24
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 6 place count 40 transition count 24
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 40 transition count 24
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 8 rules in 4 ms. Remains 40 /40 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:07:39] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
// Phase 1: matrix 24 rows 40 cols
[2025-06-02 18:07:39] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 15/39 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:07:39] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 20 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:07:39] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:07:39] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 4 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:07:39] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:07:39] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 3 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:07:39] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 3 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:07:39] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 3 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:07:39] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD15 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 8/24 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/40 variables, 1/25 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/25 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 24/64 variables, 40/65 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/65 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/64 variables, 0/65 constraints. Problems are: Problem set: 8 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/64 variables, and 65 constraints, problems are : Problem set: 8 solved, 8 unsolved in 779 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 8 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 23/39 variables, 15/15 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/16 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 8/24 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/40 variables, 1/25 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/25 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 24/64 variables, 40/65 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 8/73 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/73 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/64 variables, 0/73 constraints. Problems are: Problem set: 8 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/64 variables, and 73 constraints, problems are : Problem set: 8 solved, 8 unsolved in 349 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 8/16 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1136ms problems are : Problem set: 8 solved, 8 unsolved
Search for dead transitions found 8 dead transitions in 1137ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 40/40 places, 16/24 transitions.
Graph (complete) has 64 edges and 40 vertex of which 32 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 32 /40 variables (removed 8) and now considering 16/16 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/40 places, 16/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1159 ms. Remains : 32/40 places, 16/24 transitions.
Built C files in :
/tmp/ltsmin12088669226791597706
[2025-06-02 18:07:40] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12088669226791597706
Running compilation step : cd /tmp/ltsmin12088669226791597706;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 201 ms.
Running link step : cd /tmp/ltsmin12088669226791597706;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin12088669226791597706;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7549534626290975990.hoa' '--buchi-type=spotba'
LTSmin run took 254 ms.
FORMULA CircularTrains-PT-024-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-024-LTLFireability-05 finished in 6380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0&&F(((X(!p1)&&G(p2))||G(!p1))))||X((p3||G(F(((X(!p1)&&G(p2))||G(!p1)))))))))'
Support contains 8 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 45 cols
[2025-06-02 18:07:41] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:07:41] [INFO ] Implicit Places using invariants in 111 ms returned [9, 37, 43, 44]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 113 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 41/45 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 117 ms. Remains : 41/45 places, 24/24 transitions.
Stuttering acceptance computed with spot in 317 ms :[(AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND (NOT p2) p1 (NOT p3)), (AND p1 (NOT p3))]
Running random walk in product with property : CircularTrains-PT-024-LTLFireability-06
Product exploration explored 100000 steps with 25011 reset in 313 ms.
Product exploration explored 100000 steps with 24781 reset in 448 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 p2) (NOT p1) p3), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (OR (AND (NOT p0) p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND p1 p2 (NOT p3)))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 11 factoid took 1222 ms. Reduced automaton from 5 states, 21 edges and 4 AP (stutter sensitive) to 4 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND (NOT p3) p1 (NOT p2))]
RANDOM walk for 287 steps (0 resets) in 11 ms. (23 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) p3), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (OR (AND (NOT p0) p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND p1 p2 (NOT p3)))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p3 p1 (NOT p2)))), (F (NOT (OR p3 p1 p2))), (F p1), (F (NOT (OR p3 (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR p3 (NOT p1) p2))), (F (NOT p3))]
Knowledge based reduction with 11 factoid took 1481 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND (NOT p3) p1 (NOT p2))]
Stuttering acceptance computed with spot in 226 ms :[(AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND (NOT p3) p1 (NOT p2))]
Support contains 6 out of 41 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 41 cols
[2025-06-02 18:07:45] [INFO ] Computed 18 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:07:45] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-02 18:07:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:07:46] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 16 sub problems to find dead transitions.
[2025-06-02 18:07:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 15/40 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/41 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 24/65 variables, 41/59 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 59 constraints, problems are : Problem set: 0 solved, 16 unsolved in 731 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 15/40 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/41 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 24/65 variables, 41/59 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/65 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 75 constraints, problems are : Problem set: 0 solved, 16 unsolved in 619 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1360ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 1361ms
Finished structural reductions in LTL mode , in 1 iterations and 1574 ms. Remains : 41/41 places, 24/24 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 p3 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p3) p1 (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p1) p2))), (X (NOT (AND (NOT p3) p1 p2))), (X (X (NOT (AND (NOT p3) p1 p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (AND (NOT p3) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p2)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p3) p1 (NOT p2)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2))))), (X (X (AND (NOT p3) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p2))))), (X (X (AND (NOT p3) (NOT p1) p2))), (X (X (NOT (AND (NOT p3) (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 958 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p2) (NOT p3))]
RANDOM walk for 182 steps (0 resets) in 8 ms. (20 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p3 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p3) p1 (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p1) p2))), (X (NOT (AND (NOT p3) p1 p2))), (X (X (NOT (AND (NOT p3) p1 p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (AND (NOT p3) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p2)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p3) p1 (NOT p2)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2))))), (X (X (AND (NOT p3) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p2))))), (X (X (AND (NOT p3) (NOT p1) p2))), (X (X (NOT (AND (NOT p3) (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p1 p2 p3))), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F p1), (F (NOT (OR p1 (NOT p2) p3))), (F p2), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT p3))]
Knowledge based reduction with 5 factoid took 1241 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 228 ms :[(AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 224 ms :[(AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 24390 reset in 336 ms.
Product exploration explored 100000 steps with 24682 reset in 352 ms.
Built C files in :
/tmp/ltsmin10454680026782687978
[2025-06-02 18:07:51] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10454680026782687978
Running compilation step : cd /tmp/ltsmin10454680026782687978;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 183 ms.
Running link step : cd /tmp/ltsmin10454680026782687978;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin10454680026782687978;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6400097066108971334.hoa' '--buchi-type=spotba'
LTSmin run took 2366 ms.
FORMULA CircularTrains-PT-024-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-024-LTLFireability-06 finished in 12938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U p1)))'
Support contains 4 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 24/24 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 45 transition count 21
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 42 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 41 transition count 20
Applied a total of 8 rules in 6 ms. Remains 41 /45 variables (removed 4) and now considering 20/24 (removed 4) transitions.
// Phase 1: matrix 20 rows 41 cols
[2025-06-02 18:07:54] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:07:54] [INFO ] Implicit Places using invariants in 65 ms returned [5, 9, 36, 39, 40]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 67 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/45 places, 20/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 36 transition count 17
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 33 transition count 17
Applied a total of 6 rules in 3 ms. Remains 33 /36 variables (removed 3) and now considering 17/20 (removed 3) transitions.
// Phase 1: matrix 17 rows 33 cols
[2025-06-02 18:07:54] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:07:54] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-02 18:07:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:07:54] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/45 places, 17/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 189 ms. Remains : 33/45 places, 17/24 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : CircularTrains-PT-024-LTLFireability-08
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-024-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-024-LTLFireability-08 finished in 295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 24/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 44 transition count 23
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 44 transition count 21
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 6 place count 42 transition count 21
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 41 transition count 20
Applied a total of 8 rules in 7 ms. Remains 41 /45 variables (removed 4) and now considering 20/24 (removed 4) transitions.
// Phase 1: matrix 20 rows 41 cols
[2025-06-02 18:07:54] [INFO ] Computed 22 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:07:54] [INFO ] Implicit Places using invariants in 64 ms returned [5, 9, 35, 39, 40]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 65 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/45 places, 20/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 36 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 34 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 34 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 33 transition count 17
Applied a total of 6 rules in 3 ms. Remains 33 /36 variables (removed 3) and now considering 17/20 (removed 3) transitions.
// Phase 1: matrix 17 rows 33 cols
[2025-06-02 18:07:54] [INFO ] Computed 17 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:07:54] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-02 18:07:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:07:54] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/45 places, 17/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 189 ms. Remains : 33/45 places, 17/24 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-024-LTLFireability-09
Product exploration explored 100000 steps with 32 reset in 341 ms.
Stack based approach found an accepted trace after 470 steps with 22 reset with depth 188 and stack size 188 in 3 ms.
FORMULA CircularTrains-PT-024-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-024-LTLFireability-09 finished in 710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(F(!p0))||(F(!p0)&&G(!p1)))) U X(p0))))'
Support contains 4 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 24/24 transitions.
Applied a total of 0 rules in 3 ms. Remains 45 /45 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 45 cols
[2025-06-02 18:07:55] [INFO ] Computed 22 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:07:55] [INFO ] Implicit Places using invariants in 145 ms returned [5, 9, 37, 43, 44]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 147 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 40/45 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 152 ms. Remains : 40/45 places, 24/24 transitions.
Stuttering acceptance computed with spot in 325 ms :[(NOT p0), (NOT p0), (NOT p0), p0, (AND p1 p0), p0]
Running random walk in product with property : CircularTrains-PT-024-LTLFireability-10
Product exploration explored 100000 steps with 4761 reset in 274 ms.
Product exploration explored 100000 steps with 4812 reset in 712 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 260 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[(NOT p0), (NOT p0), (NOT p0), p0, (AND p1 p0), p0]
RANDOM walk for 164 steps (0 resets) in 7 ms. (20 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 428 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 304 ms :[(NOT p0), (NOT p0), (NOT p0), p0, (AND p1 p0), p0]
Stuttering acceptance computed with spot in 270 ms :[(NOT p0), (NOT p0), (NOT p0), p0, (AND p1 p0), p0]
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 40 cols
[2025-06-02 18:07:58] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:07:58] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-02 18:07:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:07:58] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 16 sub problems to find dead transitions.
[2025-06-02 18:07:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 15/39 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 24/64 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/64 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/64 variables, and 57 constraints, problems are : Problem set: 0 solved, 16 unsolved in 660 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 15/39 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 24/64 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/64 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/64 variables, and 73 constraints, problems are : Problem set: 0 solved, 16 unsolved in 627 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1293ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 1294ms
Finished structural reductions in LTL mode , in 1 iterations and 1464 ms. Remains : 40/40 places, 24/24 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 275 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 312 ms :[(NOT p0), (NOT p0), (NOT p0), p0, (AND p1 p0), p0]
RANDOM walk for 249 steps (0 resets) in 8 ms. (27 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 451 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[(NOT p0), (NOT p0), (NOT p0), p0, (AND p1 p0), p0]
Stuttering acceptance computed with spot in 290 ms :[(NOT p0), (NOT p0), (NOT p0), p0, (AND p1 p0), p0]
Stuttering acceptance computed with spot in 272 ms :[(NOT p0), (NOT p0), (NOT p0), p0, (AND p1 p0), p0]
Product exploration explored 100000 steps with 4815 reset in 257 ms.
Product exploration explored 100000 steps with 4881 reset in 295 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 314 ms :[(NOT p0), (NOT p0), (NOT p0), p0, (AND p1 p0), p0]
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 24/24 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 40 transition count 24
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 6 place count 40 transition count 24
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 40 transition count 24
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 8 rules in 5 ms. Remains 40 /40 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:08:02] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
// Phase 1: matrix 24 rows 40 cols
[2025-06-02 18:08:02] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 15/39 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:08:02] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 5 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:08:02] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:08:02] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 3 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:08:03] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 3 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:08:03] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 4 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:08:03] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 3 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:08:03] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 3 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:08:03] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 3 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD15 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 8/24 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/40 variables, 1/25 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/25 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 24/64 variables, 40/65 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/65 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/64 variables, 0/65 constraints. Problems are: Problem set: 8 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/64 variables, and 65 constraints, problems are : Problem set: 8 solved, 8 unsolved in 795 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 8 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 23/39 variables, 15/15 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/16 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 8/24 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/40 variables, 1/25 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/25 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 24/64 variables, 40/65 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 8/73 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/73 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/64 variables, 0/73 constraints. Problems are: Problem set: 8 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/64 variables, and 73 constraints, problems are : Problem set: 8 solved, 8 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 8/16 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1132ms problems are : Problem set: 8 solved, 8 unsolved
Search for dead transitions found 8 dead transitions in 1133ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 40/40 places, 16/24 transitions.
Graph (complete) has 64 edges and 40 vertex of which 32 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 32 /40 variables (removed 8) and now considering 16/16 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/40 places, 16/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1148 ms. Remains : 32/40 places, 16/24 transitions.
Built C files in :
/tmp/ltsmin7614578445399066883
[2025-06-02 18:08:03] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7614578445399066883
Running compilation step : cd /tmp/ltsmin7614578445399066883;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 198 ms.
Running link step : cd /tmp/ltsmin7614578445399066883;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin7614578445399066883;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9415162700953758426.hoa' '--buchi-type=spotba'
LTSmin run took 2769 ms.
FORMULA CircularTrains-PT-024-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-024-LTLFireability-10 finished in 11805 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 24/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 44 transition count 23
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 44 transition count 21
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 6 place count 42 transition count 21
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 10 place count 40 transition count 19
Applied a total of 10 rules in 5 ms. Remains 40 /45 variables (removed 5) and now considering 19/24 (removed 5) transitions.
// Phase 1: matrix 19 rows 40 cols
[2025-06-02 18:08:06] [INFO ] Computed 22 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:08:06] [INFO ] Implicit Places using invariants in 56 ms returned [5, 9, 35, 38]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 57 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/45 places, 19/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 36 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 35 transition count 18
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 4 place count 34 transition count 17
Applied a total of 4 rules in 4 ms. Remains 34 /36 variables (removed 2) and now considering 17/19 (removed 2) transitions.
// Phase 1: matrix 17 rows 34 cols
[2025-06-02 18:08:06] [INFO ] Computed 18 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:08:07] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-02 18:08:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:08:07] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/45 places, 17/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 206 ms. Remains : 34/45 places, 17/24 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-024-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 183 ms.
Stack based approach found an accepted trace after 57 steps with 0 reset with depth 58 and stack size 58 in 0 ms.
FORMULA CircularTrains-PT-024-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-024-LTLFireability-11 finished in 454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Support contains 4 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 45 cols
[2025-06-02 18:08:07] [INFO ] Computed 22 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:08:07] [INFO ] Implicit Places using invariants in 73 ms returned [5, 9, 37, 43, 44]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 79 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 40/45 places, 24/24 transitions.
Applied a total of 0 rules in 3 ms. Remains 40 /40 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 84 ms. Remains : 40/45 places, 24/24 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-024-LTLFireability-12
Entered a terminal (fully accepting) state of product in 58 steps with 23 reset in 1 ms.
FORMULA CircularTrains-PT-024-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-024-LTLFireability-12 finished in 265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 24/24 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 45 transition count 22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 43 transition count 22
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 0 with 4 rules applied. Total rules applied 8 place count 41 transition count 20
Applied a total of 8 rules in 7 ms. Remains 41 /45 variables (removed 4) and now considering 20/24 (removed 4) transitions.
// Phase 1: matrix 20 rows 41 cols
[2025-06-02 18:08:07] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:08:07] [INFO ] Implicit Places using invariants in 89 ms returned [5, 9, 35, 39, 40]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 106 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/45 places, 20/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 36 transition count 17
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 33 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 32 transition count 16
Applied a total of 8 rules in 4 ms. Remains 32 /36 variables (removed 4) and now considering 16/20 (removed 4) transitions.
// Phase 1: matrix 16 rows 32 cols
[2025-06-02 18:08:07] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:08:07] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-02 18:08:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:08:07] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/45 places, 16/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 287 ms. Remains : 32/45 places, 16/24 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-024-LTLFireability-13
Product exploration explored 100000 steps with 4316 reset in 235 ms.
Stack based approach found an accepted trace after 389 steps with 19 reset with depth 20 and stack size 20 in 1 ms.
FORMULA CircularTrains-PT-024-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-024-LTLFireability-13 finished in 589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U p1) U (G(p3)&&p2)))'
Support contains 6 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 24/24 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 44 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 44 transition count 22
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 4 place count 43 transition count 22
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 8 place count 41 transition count 20
Applied a total of 8 rules in 7 ms. Remains 41 /45 variables (removed 4) and now considering 20/24 (removed 4) transitions.
// Phase 1: matrix 20 rows 41 cols
[2025-06-02 18:08:08] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:08:08] [INFO ] Implicit Places using invariants in 74 ms returned [5, 9, 35, 40]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 76 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/45 places, 20/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 37 transition count 18
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 35 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 34 transition count 17
Applied a total of 6 rules in 4 ms. Remains 34 /37 variables (removed 3) and now considering 17/20 (removed 3) transitions.
// Phase 1: matrix 17 rows 34 cols
[2025-06-02 18:08:08] [INFO ] Computed 18 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:08:08] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-02 18:08:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:08:08] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/45 places, 17/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 255 ms. Remains : 34/45 places, 17/24 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p2) (NOT p3)), true, (NOT p1), (NOT p3), (NOT p3)]
Running random walk in product with property : CircularTrains-PT-024-LTLFireability-14
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-024-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-024-LTLFireability-14 finished in 540 ms.
All properties solved by simple procedures.
Total runtime 42048 ms.

BK_STOP 1748887688809

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-024"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is CircularTrains-PT-024, 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 r030-smll-174853813800396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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