Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r476-tall-171620505600332.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
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 r476-tall-171620505600332
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 14:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 12 14:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 14:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 12 14:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 19K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CircularTrains-PT-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 1717204514188

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-024
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 01:15:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 01:15:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 01:15:15] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2024-06-01 01:15:15] [INFO ] Transformed 48 places.
[2024-06-01 01:15:15] [INFO ] Transformed 24 transitions.
[2024-06-01 01:15:15] [INFO ] Parsed PT model containing 48 places and 24 transitions and 96 arcs in 128 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CircularTrains-PT-024-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-024-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-024-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-024-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 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 10 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 48 cols
[2024-06-01 01:15:15] [INFO ] Computed 25 invariants in 7 ms
[2024-06-01 01:15:15] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-06-01 01:15:15] [INFO ] Invariant cache hit.
[2024-06-01 01:15:15] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 16 sub problems to find dead transitions.
[2024-06-01 01:15:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 12/44 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 4/48 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 24/72 variables, 48/73 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 73 constraints, problems are : Problem set: 0 solved, 16 unsolved in 357 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 12/44 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 4/48 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 24/72 variables, 48/73 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 16/89 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/72 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 89 constraints, problems are : Problem set: 0 solved, 16 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 671ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 685ms
Finished structural reductions in LTL mode , in 1 iterations and 988 ms. Remains : 48/48 places, 24/24 transitions.
Support contains 36 out of 48 places after structural reductions.
[2024-06-01 01:15:16] [INFO ] Flatten gal took : 18 ms
[2024-06-01 01:15:16] [INFO ] Flatten gal took : 6 ms
[2024-06-01 01:15:16] [INFO ] Input system was already deterministic with 24 transitions.
Support contains 34 out of 48 places (down from 36) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 21 to 19
RANDOM walk for 187 steps (0 resets) in 23 ms. (7 steps per ms) remains 0/19 properties
FORMULA CircularTrains-PT-024-LTLFireability-04 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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2024-06-01 01:15:17] [INFO ] Invariant cache hit.
[2024-06-01 01:15:17] [INFO ] Implicit Places using invariants in 46 ms returned [4, 6, 10, 30, 39, 46, 47]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 48 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/48 places, 24/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 41 transition count 18
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 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 14 place count 34 transition count 17
Applied a total of 14 rules in 13 ms. Remains 34 /41 variables (removed 7) and now considering 17/24 (removed 7) transitions.
// Phase 1: matrix 17 rows 34 cols
[2024-06-01 01:15:17] [INFO ] Computed 18 invariants in 2 ms
[2024-06-01 01:15:17] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 01:15:17] [INFO ] Invariant cache hit.
[2024-06-01 01:15:17] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/48 places, 17/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 144 ms. Remains : 34/48 places, 17/24 transitions.
Stuttering acceptance computed with spot in 274 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-024-LTLFireability-00
Product exploration explored 100000 steps with 10864 reset in 348 ms.
Product exploration explored 100000 steps with 10737 reset in 205 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 162 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 30 steps (0 resets) in 6 ms. (4 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 189 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2024-06-01 01:15:18] [INFO ] Invariant cache hit.
[2024-06-01 01:15:18] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-06-01 01:15:18] [INFO ] [Real]Absence check using 14 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 01:15:18] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 01:15:18] [INFO ] Computed and/alt/rep : 9/17/9 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 01:15:18] [INFO ] Added : 6 causal constraints over 2 iterations in 20 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 17/17 transitions.
Applied a total of 0 rules in 2 ms. Remains 34 /34 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2024-06-01 01:15:18] [INFO ] Invariant cache hit.
[2024-06-01 01:15:18] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 01:15:18] [INFO ] Invariant cache hit.
[2024-06-01 01:15:19] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-06-01 01:15:19] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-06-01 01:15:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 14/32 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/34 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 17/51 variables, 34/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 52 constraints, problems are : Problem set: 0 solved, 9 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 14/32 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/34 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 17/51 variables, 34/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/51 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 61 constraints, problems are : Problem set: 0 solved, 9 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 286ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 287ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 412 ms. Remains : 34/34 places, 17/17 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 182 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40 steps (0 resets) in 5 ms. (6 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 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
[2024-06-01 01:15:19] [INFO ] Invariant cache hit.
[2024-06-01 01:15:20] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-06-01 01:15:20] [INFO ] [Real]Absence check using 14 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 01:15:20] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 01:15:20] [INFO ] Computed and/alt/rep : 9/17/9 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 01:15:20] [INFO ] Added : 6 causal constraints over 2 iterations in 15 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10745 reset in 143 ms.
Product exploration explored 100000 steps with 10754 reset in 204 ms.
Support contains 2 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 17/17 transitions.
Applied a total of 0 rules in 7 ms. Remains 34 /34 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2024-06-01 01:15:20] [INFO ] Invariant cache hit.
[2024-06-01 01:15:20] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 01:15:20] [INFO ] Invariant cache hit.
[2024-06-01 01:15:20] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-06-01 01:15:20] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-06-01 01:15:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 14/32 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/34 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 17/51 variables, 34/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 52 constraints, problems are : Problem set: 0 solved, 9 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 14/32 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/34 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 17/51 variables, 34/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/51 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 61 constraints, problems are : Problem set: 0 solved, 9 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 238ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 238ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 355 ms. Remains : 34/34 places, 17/17 transitions.
Treatment of property CircularTrains-PT-024-LTLFireability-00 finished in 3644 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((G(p1)&&X(G(p2)))||p0))))'
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 48 cols
[2024-06-01 01:15:20] [INFO ] Computed 25 invariants in 2 ms
[2024-06-01 01:15:20] [INFO ] Implicit Places using invariants in 61 ms returned [4, 10, 39, 41, 46]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 62 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/48 places, 24/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 43 transition count 21
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 40 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 38 transition count 19
Applied a total of 10 rules in 3 ms. Remains 38 /43 variables (removed 5) and now considering 19/24 (removed 5) transitions.
// Phase 1: matrix 19 rows 38 cols
[2024-06-01 01:15:20] [INFO ] Computed 20 invariants in 2 ms
[2024-06-01 01:15:20] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-01 01:15:20] [INFO ] Invariant cache hit.
[2024-06-01 01:15:21] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/48 places, 19/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 165 ms. Remains : 38/48 places, 19/24 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-024-LTLFireability-01
Product exploration explored 100000 steps with 6979 reset in 186 ms.
Product exploration explored 100000 steps with 6915 reset in 245 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 839 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 385 steps (0 resets) in 17 ms. (21 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR p0 (NOT p2)))), (F (NOT p2)), (F (NOT (OR p0 p1 p2))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 984 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter insensitive) to 4 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 146 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 19/19 transitions.
Applied a total of 0 rules in 3 ms. Remains 38 /38 variables (removed 0) and now considering 19/19 (removed 0) transitions.
[2024-06-01 01:15:23] [INFO ] Invariant cache hit.
[2024-06-01 01:15:24] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 01:15:24] [INFO ] Invariant cache hit.
[2024-06-01 01:15:24] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-06-01 01:15:24] [INFO ] Redundant transitions in 1 ms returned []
Running 11 sub problems to find dead transitions.
[2024-06-01 01:15:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 14/36 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2/38 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 19/57 variables, 38/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/57 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 57/57 variables, and 58 constraints, problems are : Problem set: 0 solved, 11 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 14/36 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2/38 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 19/57 variables, 38/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/57 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 57/57 variables, and 69 constraints, problems are : Problem set: 0 solved, 11 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 328ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 329ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 414 ms. Remains : 38/38 places, 19/19 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 788 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter insensitive) to 4 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 239 steps (0 resets) in 10 ms. (21 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR p0 (NOT p2)))), (F (NOT p2)), (F (NOT (OR p0 p1 p2))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 1096 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter insensitive) to 4 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 297 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 7020 reset in 185 ms.
Product exploration explored 100000 steps with 6905 reset in 176 ms.
Support contains 6 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 19/19 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 19/19 (removed 0) transitions.
[2024-06-01 01:15:27] [INFO ] Invariant cache hit.
[2024-06-01 01:15:27] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 01:15:27] [INFO ] Invariant cache hit.
[2024-06-01 01:15:27] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-06-01 01:15:27] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2024-06-01 01:15:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 14/36 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2/38 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 19/57 variables, 38/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/57 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 57/57 variables, and 58 constraints, problems are : Problem set: 0 solved, 11 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 14/36 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2/38 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 19/57 variables, 38/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/57 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 57/57 variables, and 69 constraints, problems are : Problem set: 0 solved, 11 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 297ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 298ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 397 ms. Remains : 38/38 places, 19/19 transitions.
Treatment of property CircularTrains-PT-024-LTLFireability-01 finished in 7003 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)&&F(p2)&&p0))))'
Support contains 4 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 1 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 48 cols
[2024-06-01 01:15:27] [INFO ] Computed 25 invariants in 1 ms
[2024-06-01 01:15:27] [INFO ] Implicit Places using invariants in 36 ms returned [4, 6, 10, 30, 39, 41, 46, 47]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 37 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 40/48 places, 24/24 transitions.
Applied a total of 0 rules in 0 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 38 ms. Remains : 40/48 places, 24/24 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (AND p0 (NOT p1)), (NOT p2)]
Running random walk in product with property : CircularTrains-PT-024-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-024-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-024-LTLFireability-06 finished in 203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F(p1))))'
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2024-06-01 01:15:28] [INFO ] Invariant cache hit.
[2024-06-01 01:15:28] [INFO ] Implicit Places using invariants in 44 ms returned [4, 6, 10, 30, 39, 41, 46, 47]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 45 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/48 places, 24/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 40 transition count 19
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 35 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 34 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 34 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 32 transition count 16
Applied a total of 16 rules in 5 ms. Remains 32 /40 variables (removed 8) and now considering 16/24 (removed 8) transitions.
// Phase 1: matrix 16 rows 32 cols
[2024-06-01 01:15:28] [INFO ] Computed 17 invariants in 1 ms
[2024-06-01 01:15:28] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 01:15:28] [INFO ] Invariant cache hit.
[2024-06-01 01:15:28] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/48 places, 16/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 135 ms. Remains : 32/48 places, 16/24 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-024-LTLFireability-07
Product exploration explored 100000 steps with 5913 reset in 159 ms.
Product exploration explored 100000 steps with 5861 reset in 172 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 (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 58 steps (0 resets) in 5 ms. (9 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 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 2 ms. Remains 32 /32 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2024-06-01 01:15:29] [INFO ] Invariant cache hit.
[2024-06-01 01:15:29] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 01:15:29] [INFO ] Invariant cache hit.
[2024-06-01 01:15:29] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-06-01 01:15:29] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-06-01 01:15:29] [INFO ] Invariant cache hit.
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 85 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]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
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 121 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]
After SMT, in 214ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 214ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 304 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 : [(AND p0 (NOT p1)), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 60 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 5864 reset in 129 ms.
Product exploration explored 100000 steps with 5888 reset in 143 ms.
Support contains 4 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 1 ms. Remains 32 /32 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2024-06-01 01:15:30] [INFO ] Invariant cache hit.
[2024-06-01 01:15:30] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 01:15:30] [INFO ] Invariant cache hit.
[2024-06-01 01:15:30] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-06-01 01:15:30] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-06-01 01:15:30] [INFO ] Invariant cache hit.
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 84 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]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
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 92 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]
After SMT, in 189ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 189ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 262 ms. Remains : 32/32 places, 16/16 transitions.
Treatment of property CircularTrains-PT-024-LTLFireability-07 finished in 2427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 48 cols
[2024-06-01 01:15:30] [INFO ] Computed 25 invariants in 1 ms
[2024-06-01 01:15:30] [INFO ] Implicit Places using invariants in 41 ms returned [4, 6, 10, 30, 39, 41, 46, 47]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 55 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/48 places, 24/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 40 transition count 18
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 34 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 34 transition count 16
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 16 place count 32 transition count 16
Applied a total of 16 rules in 2 ms. Remains 32 /40 variables (removed 8) and now considering 16/24 (removed 8) transitions.
// Phase 1: matrix 16 rows 32 cols
[2024-06-01 01:15:30] [INFO ] Computed 17 invariants in 1 ms
[2024-06-01 01:15:30] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 01:15:30] [INFO ] Invariant cache hit.
[2024-06-01 01:15:30] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/48 places, 16/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 133 ms. Remains : 32/48 places, 16/24 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-024-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 132 ms.
Stack based approach found an accepted trace after 45 steps with 0 reset with depth 46 and stack size 46 in 0 ms.
FORMULA CircularTrains-PT-024-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-024-LTLFireability-08 finished in 306 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0) U p1)))'
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 48 cols
[2024-06-01 01:15:30] [INFO ] Computed 25 invariants in 0 ms
[2024-06-01 01:15:30] [INFO ] Implicit Places using invariants in 40 ms returned [4, 6, 10, 30, 39, 41, 46, 47]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 41 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/48 places, 24/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 40 transition count 18
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 14 place count 34 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 32 transition count 16
Applied a total of 16 rules in 2 ms. Remains 32 /40 variables (removed 8) and now considering 16/24 (removed 8) transitions.
// Phase 1: matrix 16 rows 32 cols
[2024-06-01 01:15:30] [INFO ] Computed 17 invariants in 2 ms
[2024-06-01 01:15:30] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 01:15:30] [INFO ] Invariant cache hit.
[2024-06-01 01:15:30] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/48 places, 16/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 112 ms. Remains : 32/48 places, 16/24 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), true, (NOT p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-024-LTLFireability-09
Entered a terminal (fully accepting) state of product in 21 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-024-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-024-LTLFireability-09 finished in 254 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 48 cols
[2024-06-01 01:15:31] [INFO ] Computed 25 invariants in 0 ms
[2024-06-01 01:15:31] [INFO ] Implicit Places using invariants in 34 ms returned [6, 10, 30, 39, 41, 46, 47]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 35 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/48 places, 24/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 41 transition count 18
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 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 14 place count 34 transition count 17
Applied a total of 14 rules in 2 ms. Remains 34 /41 variables (removed 7) and now considering 17/24 (removed 7) transitions.
// Phase 1: matrix 17 rows 34 cols
[2024-06-01 01:15:31] [INFO ] Computed 18 invariants in 0 ms
[2024-06-01 01:15:31] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 01:15:31] [INFO ] Invariant cache hit.
[2024-06-01 01:15:31] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/48 places, 17/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 127 ms. Remains : 34/48 places, 17/24 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-024-LTLFireability-10
Product exploration explored 100000 steps with 14817 reset in 150 ms.
Product exploration explored 100000 steps with 14755 reset in 153 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 125 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 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 123 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 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-06-01 01:15:31] [INFO ] Invariant cache hit.
[2024-06-01 01:15:31] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2024-06-01 01:15:31] [INFO ] [Real]Absence check using 15 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 01:15:31] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 01:15:31] [INFO ] Computed and/alt/rep : 9/17/9 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 01:15:31] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2024-06-01 01:15:31] [INFO ] Invariant cache hit.
[2024-06-01 01:15:31] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 01:15:31] [INFO ] Invariant cache hit.
[2024-06-01 01:15:32] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-06-01 01:15:32] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-06-01 01:15:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 15/33 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 1/34 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 17/51 variables, 34/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 52 constraints, problems are : Problem set: 0 solved, 9 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 15/33 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 1/34 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 17/51 variables, 34/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/51 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 61 constraints, problems are : Problem set: 0 solved, 9 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 221ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 221ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 291 ms. Remains : 34/34 places, 17/17 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 305 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 33 ms :[(NOT p0)]
RANDOM walk for 30 steps (0 resets) in 4 ms. (6 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 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2024-06-01 01:15:32] [INFO ] Invariant cache hit.
[2024-06-01 01:15:32] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2024-06-01 01:15:32] [INFO ] [Real]Absence check using 15 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 01:15:32] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 01:15:32] [INFO ] Computed and/alt/rep : 9/17/9 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 01:15:32] [INFO ] Added : 6 causal constraints over 2 iterations in 17 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14705 reset in 117 ms.
Product exploration explored 100000 steps with 14737 reset in 134 ms.
Support contains 2 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2024-06-01 01:15:33] [INFO ] Invariant cache hit.
[2024-06-01 01:15:33] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 01:15:33] [INFO ] Invariant cache hit.
[2024-06-01 01:15:33] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2024-06-01 01:15:33] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-06-01 01:15:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 15/33 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 1/34 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 17/51 variables, 34/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 52 constraints, problems are : Problem set: 0 solved, 9 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 15/33 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 1/34 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 17/51 variables, 34/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/51 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 61 constraints, problems are : Problem set: 0 solved, 9 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 212ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 212ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 314 ms. Remains : 34/34 places, 17/17 transitions.
Treatment of property CircularTrains-PT-024-LTLFireability-10 finished in 2400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 48 cols
[2024-06-01 01:15:33] [INFO ] Computed 25 invariants in 0 ms
[2024-06-01 01:15:33] [INFO ] Implicit Places using invariants in 66 ms returned [4, 6, 30, 39, 46, 47]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 67 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/48 places, 24/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 42 transition count 20
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 38 transition count 20
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 12 place count 36 transition count 18
Applied a total of 12 rules in 3 ms. Remains 36 /42 variables (removed 6) and now considering 18/24 (removed 6) transitions.
// Phase 1: matrix 18 rows 36 cols
[2024-06-01 01:15:33] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 01:15:33] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 01:15:33] [INFO ] Invariant cache hit.
[2024-06-01 01:15:33] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/48 places, 18/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 140 ms. Remains : 36/48 places, 18/24 transitions.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-024-LTLFireability-11
Product exploration explored 100000 steps with 9476 reset in 142 ms.
Product exploration explored 100000 steps with 9648 reset in 148 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 410 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40 steps (0 resets) in 5 ms. (6 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 510 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 01:15:35] [INFO ] Invariant cache hit.
[2024-06-01 01:15:35] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-06-01 01:15:35] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-01 01:15:35] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 01:15:35] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 01:15:35] [INFO ] Added : 7 causal constraints over 2 iterations in 14 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 36 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36/36 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 36 /36 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-06-01 01:15:35] [INFO ] Invariant cache hit.
[2024-06-01 01:15:35] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 01:15:35] [INFO ] Invariant cache hit.
[2024-06-01 01:15:35] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-06-01 01:15:35] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-06-01 01:15:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 14/34 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 2/36 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 18/54 variables, 36/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/54 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 55 constraints, problems are : Problem set: 0 solved, 10 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 14/34 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 2/36 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 18/54 variables, 36/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/54 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 65 constraints, problems are : Problem set: 0 solved, 10 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 254ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 255ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 342 ms. Remains : 36/36 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 347 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 49 steps (0 resets) in 6 ms. (7 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 530 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 01:15:36] [INFO ] Invariant cache hit.
[2024-06-01 01:15:36] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-06-01 01:15:36] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2024-06-01 01:15:36] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 01:15:36] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 01:15:36] [INFO ] Added : 7 causal constraints over 2 iterations in 9 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 9560 reset in 150 ms.
Product exploration explored 100000 steps with 9634 reset in 151 ms.
Support contains 4 out of 36 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36/36 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-06-01 01:15:37] [INFO ] Invariant cache hit.
[2024-06-01 01:15:37] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 01:15:37] [INFO ] Invariant cache hit.
[2024-06-01 01:15:37] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-06-01 01:15:37] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-06-01 01:15:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 14/34 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 2/36 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 18/54 variables, 36/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/54 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 55 constraints, problems are : Problem set: 0 solved, 10 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 14/34 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 2/36 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 18/54 variables, 36/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/54 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 65 constraints, problems are : Problem set: 0 solved, 10 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 241ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 241ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 315 ms. Remains : 36/36 places, 18/18 transitions.
Treatment of property CircularTrains-PT-024-LTLFireability-11 finished in 3949 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Support contains 4 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 7 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 48 cols
[2024-06-01 01:15:37] [INFO ] Computed 25 invariants in 0 ms
[2024-06-01 01:15:37] [INFO ] Implicit Places using invariants in 49 ms returned [4, 6, 10, 30, 39, 41, 46, 47]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 54 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 40/48 places, 24/24 transitions.
Applied a total of 0 rules in 0 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 61 ms. Remains : 40/48 places, 24/24 transitions.
Stuttering acceptance computed with spot in 110 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 31 steps with 12 reset in 0 ms.
FORMULA CircularTrains-PT-024-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-024-LTLFireability-12 finished in 269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2024-06-01 01:15:37] [INFO ] Invariant cache hit.
[2024-06-01 01:15:37] [INFO ] Implicit Places using invariants in 36 ms returned [4, 6, 10, 30, 39, 41, 46, 47]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 37 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/48 places, 24/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 40 transition count 19
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 35 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 34 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 34 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 32 transition count 16
Applied a total of 16 rules in 2 ms. Remains 32 /40 variables (removed 8) and now considering 16/24 (removed 8) transitions.
// Phase 1: matrix 16 rows 32 cols
[2024-06-01 01:15:37] [INFO ] Computed 17 invariants in 0 ms
[2024-06-01 01:15:37] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 01:15:37] [INFO ] Invariant cache hit.
[2024-06-01 01:15:37] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/48 places, 16/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 108 ms. Remains : 32/48 places, 16/24 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-024-LTLFireability-13
Product exploration explored 100000 steps with 4392 reset in 124 ms.
Stack based approach found an accepted trace after 400 steps with 16 reset with depth 32 and stack size 32 in 1 ms.
FORMULA CircularTrains-PT-024-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-024-LTLFireability-13 finished in 279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U (G(p3)&&p2)))'
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 48 cols
[2024-06-01 01:15:37] [INFO ] Computed 25 invariants in 0 ms
[2024-06-01 01:15:37] [INFO ] Implicit Places using invariants in 37 ms returned [4, 6, 10, 30, 39, 41, 47]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 38 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/48 places, 24/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 41 transition count 20
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 37 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 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 3 with 2 rules applied. Total rules applied 14 place count 34 transition count 17
Applied a total of 14 rules in 2 ms. Remains 34 /41 variables (removed 7) and now considering 17/24 (removed 7) transitions.
// Phase 1: matrix 17 rows 34 cols
[2024-06-01 01:15:38] [INFO ] Computed 18 invariants in 0 ms
[2024-06-01 01:15:38] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 01:15:38] [INFO ] Invariant cache hit.
[2024-06-01 01:15:38] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/48 places, 17/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 115 ms. Remains : 34/48 places, 17/24 transitions.
Stuttering acceptance computed with spot in 204 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 13 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 338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((G(p1)&&X(G(p2)))||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
[2024-06-01 01:15:38] [INFO ] Flatten gal took : 3 ms
[2024-06-01 01:15:38] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-06-01 01:15:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 48 places, 24 transitions and 96 arcs took 1 ms.
Total runtime 23516 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA CircularTrains-PT-024-LTLFireability-00 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA CircularTrains-PT-024-LTLFireability-01 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA CircularTrains-PT-024-LTLFireability-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA CircularTrains-PT-024-LTLFireability-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA CircularTrains-PT-024-LTLFireability-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717204545183

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name CircularTrains-PT-024-LTLFireability-00
ltl formula formula --ltl=/tmp/1926/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 48 places, 24 transitions and 96 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1926/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1926/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1926/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1926/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 50 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 49, there are 29 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~42 levels ~10000 states ~22948 transitions
pnml2lts-mc( 2/ 4): ~46 levels ~20000 states ~48136 transitions
pnml2lts-mc( 2/ 4): ~95 levels ~40000 states ~113808 transitions
pnml2lts-mc( 2/ 4): ~315 levels ~80000 states ~280968 transitions
pnml2lts-mc( 2/ 4): ~10496 levels ~160000 states ~784788 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 86515
pnml2lts-mc( 0/ 4): unique states count: 173029
pnml2lts-mc( 0/ 4): unique transitions count: 1155846
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 658085
pnml2lts-mc( 0/ 4): - claim found count: 325195
pnml2lts-mc( 0/ 4): - claim success count: 173391
pnml2lts-mc( 0/ 4): - cum. max stack depth: 61126
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 173394 states 1158066 transitions, fanout: 6.679
pnml2lts-mc( 0/ 4): Total exploration time 1.090 sec (1.070 sec minimum, 1.085 sec on average)
pnml2lts-mc( 0/ 4): States per second: 159077, Transitions per second: 1062446
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 2.5MB, 15.1 B/state, compr.: 7.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 24 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.5MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-024-LTLFireability-01
ltl formula formula --ltl=/tmp/1926/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 48 places, 24 transitions and 96 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1926/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1926/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1926/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1926/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 49 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 49, there are 82 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~142 levels ~10000 states ~38684 transitions
pnml2lts-mc( 3/ 4): ~138 levels ~20000 states ~45472 transitions
pnml2lts-mc( 3/ 4): ~138 levels ~40000 states ~107628 transitions
pnml2lts-mc( 3/ 4): ~138 levels ~80000 states ~264948 transitions
pnml2lts-mc( 3/ 4): ~138 levels ~160000 states ~589908 transitions
pnml2lts-mc( 3/ 4): ~18174 levels ~320000 states ~1565160 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 133922
pnml2lts-mc( 0/ 4): unique states count: 323993
pnml2lts-mc( 0/ 4): unique transitions count: 2353102
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 751865
pnml2lts-mc( 0/ 4): - claim found count: 1322575
pnml2lts-mc( 0/ 4): - claim success count: 324685
pnml2lts-mc( 0/ 4): - cum. max stack depth: 120554
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 333344 states 2455885 transitions, fanout: 7.367
pnml2lts-mc( 0/ 4): Total exploration time 1.740 sec (1.740 sec minimum, 1.740 sec on average)
pnml2lts-mc( 0/ 4): States per second: 191577, Transitions per second: 1411428
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 4.0MB, 13.0 B/state, compr.: 6.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 24 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 4.0MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-024-LTLFireability-07
ltl formula formula --ltl=/tmp/1926/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 48 places, 24 transitions and 96 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1926/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1926/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1926/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1926/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 50 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 49, there are 31 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~45 levels ~10000 states ~31180 transitions
pnml2lts-mc( 3/ 4): ~106 levels ~20000 states ~68828 transitions
pnml2lts-mc( 3/ 4): ~143 levels ~40000 states ~180428 transitions
pnml2lts-mc( 3/ 4): ~517 levels ~80000 states ~480676 transitions
pnml2lts-mc( 3/ 4): ~8921 levels ~160000 states ~1144032 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 82526
pnml2lts-mc( 0/ 4): unique states count: 169040
pnml2lts-mc( 0/ 4): unique transitions count: 1538734
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1055578
pnml2lts-mc( 0/ 4): - claim found count: 332956
pnml2lts-mc( 0/ 4): - claim success count: 169353
pnml2lts-mc( 0/ 4): - cum. max stack depth: 57311
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 174680 states 1611297 transitions, fanout: 9.224
pnml2lts-mc( 0/ 4): Total exploration time 1.070 sec (1.070 sec minimum, 1.070 sec on average)
pnml2lts-mc( 0/ 4): States per second: 163252, Transitions per second: 1505885
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 2.5MB, 15.2 B/state, compr.: 7.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 24 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.5MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-024-LTLFireability-10
ltl formula formula --ltl=/tmp/1926/ltl_3_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 48 places, 24 transitions and 96 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1926/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1926/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1926/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1926/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 50 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 49, there are 26 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~44 levels ~10000 states ~23068 transitions
pnml2lts-mc( 1/ 4): ~44 levels ~20000 states ~49792 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 18570
pnml2lts-mc( 0/ 4): unique states count: 18570
pnml2lts-mc( 0/ 4): unique transitions count: 47779
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 29467
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 18845
pnml2lts-mc( 0/ 4): - cum. max stack depth: 167
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 18845 states 49048 transitions, fanout: 2.603
pnml2lts-mc( 0/ 4): Total exploration time 0.120 sec (0.120 sec minimum, 0.120 sec on average)
pnml2lts-mc( 0/ 4): States per second: 157042, Transitions per second: 408733
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.4MB, 22.3 B/state, compr.: 11.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 24 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.4MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-024-LTLFireability-11
ltl formula formula --ltl=/tmp/1926/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 48 places, 24 transitions and 96 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1926/ltl_4_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1926/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1926/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1926/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 49 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 49, there are 41 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~46 levels ~10000 states ~29688 transitions
pnml2lts-mc( 1/ 4): ~46 levels ~20000 states ~62252 transitions
pnml2lts-mc( 0/ 4): ~49 levels ~40000 states ~134024 transitions
pnml2lts-mc( 0/ 4): ~49 levels ~80000 states ~312524 transitions
pnml2lts-mc( 0/ 4): ~49 levels ~160000 states ~713568 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 115491
pnml2lts-mc( 0/ 4): unique states count: 202005
pnml2lts-mc( 0/ 4): unique transitions count: 1357045
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 831358
pnml2lts-mc( 0/ 4): - claim found count: 325986
pnml2lts-mc( 0/ 4): - claim success count: 202475
pnml2lts-mc( 0/ 4): - cum. max stack depth: 57996
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 202969 states 1364399 transitions, fanout: 6.722
pnml2lts-mc( 0/ 4): Total exploration time 1.100 sec (1.100 sec minimum, 1.100 sec on average)
pnml2lts-mc( 0/ 4): States per second: 184517, Transitions per second: 1240363
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 2.8MB, 14.5 B/state, compr.: 7.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 24 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.8MB (~256.0MB paged-in)

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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
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 r476-tall-171620505600332"
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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;