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.r070-tall-171620505600331.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 itstools
Input is CircularTrains-PT-024, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505600331
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME CircularTrains-PT-024-LTLCardinality-01
FORMULA_NAME CircularTrains-PT-024-LTLCardinality-02
FORMULA_NAME CircularTrains-PT-024-LTLCardinality-03
FORMULA_NAME CircularTrains-PT-024-LTLCardinality-04
FORMULA_NAME CircularTrains-PT-024-LTLCardinality-05
FORMULA_NAME CircularTrains-PT-024-LTLCardinality-06
FORMULA_NAME CircularTrains-PT-024-LTLCardinality-07
FORMULA_NAME CircularTrains-PT-024-LTLCardinality-08
FORMULA_NAME CircularTrains-PT-024-LTLCardinality-09
FORMULA_NAME CircularTrains-PT-024-LTLCardinality-10
FORMULA_NAME CircularTrains-PT-024-LTLCardinality-11
FORMULA_NAME CircularTrains-PT-024-LTLCardinality-12
FORMULA_NAME CircularTrains-PT-024-LTLCardinality-13
FORMULA_NAME CircularTrains-PT-024-LTLCardinality-14
FORMULA_NAME CircularTrains-PT-024-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716282079168

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-024
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 09:01:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 09:01:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 09:01:20] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2024-05-21 09:01:20] [INFO ] Transformed 48 places.
[2024-05-21 09:01:20] [INFO ] Transformed 24 transitions.
[2024-05-21 09:01:20] [INFO ] Parsed PT model containing 48 places and 24 transitions and 96 arcs in 139 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CircularTrains-PT-024-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-024-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-024-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 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 12 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 48 cols
[2024-05-21 09:01:20] [INFO ] Computed 25 invariants in 8 ms
[2024-05-21 09:01:20] [INFO ] Implicit Places using invariants in 186 ms returned [4, 6, 39, 47]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 229 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/48 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 275 ms. Remains : 44/48 places, 24/24 transitions.
Support contains 28 out of 44 places after structural reductions.
[2024-05-21 09:01:21] [INFO ] Flatten gal took : 19 ms
[2024-05-21 09:01:21] [INFO ] Flatten gal took : 6 ms
[2024-05-21 09:01:21] [INFO ] Input system was already deterministic with 24 transitions.
RANDOM walk for 40000 steps (8 resets) in 1673 ms. (23 steps per ms) remains 9/25 properties
BEST_FIRST walk for 40003 steps (8 resets) in 157 ms. (253 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 174 ms. (228 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 128 ms. (310 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 180 ms. (221 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 119 ms. (333 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 109 ms. (363 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 115 ms. (344 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 75 ms. (526 steps per ms) remains 9/9 properties
// Phase 1: matrix 24 rows 44 cols
[2024-05-21 09:01:22] [INFO ] Computed 21 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 1 (OVERLAPS) 13/25 variables, 8/8 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/29 variables, 2/10 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/10 constraints. Problems are: Problem set: 7 solved, 2 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 5 (OVERLAPS) 10/39 variables, 7/17 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/17 constraints. Problems are: Problem set: 8 solved, 1 unsolved
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Real declared 44/68 variables, and 21 constraints, problems are : Problem set: 9 solved, 0 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/44 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 155ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA CircularTrains-PT-024-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 9 atomic propositions for a total of 12 simplifications.
FORMULA CircularTrains-PT-024-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-024-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-024-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-024-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA CircularTrains-PT-024-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 1 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 24/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 43 transition count 23
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 43 transition count 21
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 41 transition count 21
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 38 transition count 18
Applied a total of 12 rules in 18 ms. Remains 38 /44 variables (removed 6) and now considering 18/24 (removed 6) transitions.
// Phase 1: matrix 18 rows 38 cols
[2024-05-21 09:01:22] [INFO ] Computed 21 invariants in 1 ms
[2024-05-21 09:01:22] [INFO ] Implicit Places using invariants in 57 ms returned [6, 26, 35, 37]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 58 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/44 places, 18/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 34 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 33 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 32 transition count 16
Applied a total of 4 rules in 8 ms. Remains 32 /34 variables (removed 2) and now considering 16/18 (removed 2) transitions.
// Phase 1: matrix 16 rows 32 cols
[2024-05-21 09:01:22] [INFO ] Computed 17 invariants in 0 ms
[2024-05-21 09:01:22] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-21 09:01:22] [INFO ] Invariant cache hit.
[2024-05-21 09:01:22] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/44 places, 16/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 329 ms. Remains : 32/44 places, 16/24 transitions.
Initial state reduction rules removed 1 formulas.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-024-LTLCardinality-00
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-024-LTLCardinality-00 TRUE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-024-LTLCardinality-00 finished in 516 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&&F(p1)))'
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 24/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 43 transition count 23
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 43 transition count 21
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 41 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 39 transition count 19
Applied a total of 10 rules in 7 ms. Remains 39 /44 variables (removed 5) and now considering 19/24 (removed 5) transitions.
// Phase 1: matrix 19 rows 39 cols
[2024-05-21 09:01:22] [INFO ] Computed 21 invariants in 1 ms
[2024-05-21 09:01:22] [INFO ] Implicit Places using invariants in 50 ms returned [7, 27, 35, 38]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 50 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/44 places, 19/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 35 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 34 transition count 18
Applied a total of 2 rules in 3 ms. Remains 34 /35 variables (removed 1) and now considering 18/19 (removed 1) transitions.
// Phase 1: matrix 18 rows 34 cols
[2024-05-21 09:01:23] [INFO ] Computed 17 invariants in 0 ms
[2024-05-21 09:01:23] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 09:01:23] [INFO ] Invariant cache hit.
[2024-05-21 09:01:23] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/44 places, 18/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 177 ms. Remains : 34/44 places, 18/24 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-024-LTLCardinality-01
Product exploration explored 100000 steps with 14371 reset in 247 ms.
Product exploration explored 100000 steps with 14359 reset in 168 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) p0)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 162 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 26 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 196 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 69 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1)]
[2024-05-21 09:01:24] [INFO ] Invariant cache hit.
[2024-05-21 09:01:24] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-05-21 09:01:24] [INFO ] [Real]Absence check using 15 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 09:01:24] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-21 09:01:24] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 09:01:24] [INFO ] Added : 7 causal constraints over 2 iterations in 18 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-21 09:01:24] [INFO ] Invariant cache hit.
[2024-05-21 09:01:24] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 09:01:24] [INFO ] Invariant cache hit.
[2024-05-21 09:01:24] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-21 09:01:24] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-21 09:01:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 15/33 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 1/34 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 18/52 variables, 34/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 51 constraints, problems are : Problem set: 0 solved, 10 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 34/34 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/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 15/33 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 1/34 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 18/52 variables, 34/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 61 constraints, problems are : Problem set: 0 solved, 10 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 245ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 245ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 352 ms. Remains : 34/34 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 : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 23 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 191 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 75 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
[2024-05-21 09:01:25] [INFO ] Invariant cache hit.
[2024-05-21 09:01:25] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2024-05-21 09:01:25] [INFO ] [Real]Absence check using 15 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 09:01:25] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-21 09:01:25] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 09:01:25] [INFO ] Added : 7 causal constraints over 2 iterations in 13 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 14364 reset in 145 ms.
Product exploration explored 100000 steps with 14509 reset in 185 ms.
Built C files in :
/tmp/ltsmin4581200802523311427
[2024-05-21 09:01:25] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2024-05-21 09:01:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:01:25] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2024-05-21 09:01:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:01:25] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2024-05-21 09:01:25] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:01:25] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4581200802523311427
Running compilation step : cd /tmp/ltsmin4581200802523311427;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 242 ms.
Running link step : cd /tmp/ltsmin4581200802523311427;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin4581200802523311427;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2113568813223968960.hoa' '--buchi-type=spotba'
LTSmin run took 136 ms.
FORMULA CircularTrains-PT-024-LTLCardinality-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-024-LTLCardinality-01 finished in 3372 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)))'
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 24/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 43 transition count 23
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 43 transition count 21
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 41 transition count 21
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 38 transition count 18
Applied a total of 12 rules in 6 ms. Remains 38 /44 variables (removed 6) and now considering 18/24 (removed 6) transitions.
// Phase 1: matrix 18 rows 38 cols
[2024-05-21 09:01:26] [INFO ] Computed 21 invariants in 1 ms
[2024-05-21 09:01:26] [INFO ] Implicit Places using invariants in 46 ms returned [6, 26, 35, 37]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 47 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/44 places, 18/24 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 34 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 32 transition count 16
Applied a total of 4 rules in 2 ms. Remains 32 /34 variables (removed 2) and now considering 16/18 (removed 2) transitions.
// Phase 1: matrix 16 rows 32 cols
[2024-05-21 09:01:26] [INFO ] Computed 17 invariants in 0 ms
[2024-05-21 09:01:26] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-21 09:01:26] [INFO ] Invariant cache hit.
[2024-05-21 09:01:26] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/44 places, 16/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 147 ms. Remains : 32/44 places, 16/24 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-024-LTLCardinality-03
Product exploration explored 100000 steps with 7403 reset in 141 ms.
Stack based approach found an accepted trace after 97 steps with 6 reset with depth 20 and stack size 20 in 0 ms.
FORMULA CircularTrains-PT-024-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-024-LTLCardinality-03 finished in 393 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(X(F((p0||X(F(p1)))))))'
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 44 cols
[2024-05-21 09:01:26] [INFO ] Computed 21 invariants in 1 ms
[2024-05-21 09:01:26] [INFO ] Implicit Places using invariants in 75 ms returned [8, 28, 38, 43]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 77 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 40/44 places, 24/24 transitions.
Applied a total of 0 rules in 1 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 79 ms. Remains : 40/44 places, 24/24 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-024-LTLCardinality-04
Product exploration explored 100000 steps with 19321 reset in 149 ms.
Product exploration explored 100000 steps with 19529 reset in 146 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 206 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 28 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 1 factoid took 172 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 40 cols
[2024-05-21 09:01:28] [INFO ] Computed 17 invariants in 1 ms
[2024-05-21 09:01:28] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 09:01:28] [INFO ] Invariant cache hit.
[2024-05-21 09:01:28] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Running 16 sub problems to find dead transitions.
[2024-05-21 09:01:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 15/39 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 24/64 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/64 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/64 variables, and 57 constraints, problems are : Problem set: 0 solved, 16 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 15/39 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 24/64 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/64 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/64 variables, and 73 constraints, problems are : Problem set: 0 solved, 16 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 463ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 464ms
Finished structural reductions in LTL mode , in 1 iterations and 553 ms. Remains : 40/40 places, 24/24 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 77 steps (0 resets) in 5 ms. (12 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 1 factoid took 178 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 19498 reset in 108 ms.
Product exploration explored 100000 steps with 19193 reset in 125 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 24/24 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 40 transition count 24
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 8 rules in 7 ms. Remains 40 /40 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2024-05-21 09:01:30] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
// Phase 1: matrix 24 rows 40 cols
[2024-05-21 09:01:30] [INFO ] Computed 17 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 15/39 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-21 09:01:30] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 5 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-21 09:01:30] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-21 09:01:30] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 8 ms to minimize.
[2024-05-21 09:01:30] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-21 09:01:30] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-21 09:01:30] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-21 09:01:30] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 5 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-21 09:01:30] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD15 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 8/24 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/40 variables, 1/25 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/25 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 24/64 variables, 40/65 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/65 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/64 variables, 0/65 constraints. Problems are: Problem set: 8 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/64 variables, and 65 constraints, problems are : Problem set: 8 solved, 8 unsolved in 392 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 8 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 23/39 variables, 15/15 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/16 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 8/24 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/40 variables, 1/25 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/25 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 24/64 variables, 40/65 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 8/73 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/73 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/64 variables, 0/73 constraints. Problems are: Problem set: 8 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/64 variables, and 73 constraints, problems are : Problem set: 8 solved, 8 unsolved in 377 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 8/16 constraints, Known Traps: 8/8 constraints]
After SMT, in 776ms problems are : Problem set: 8 solved, 8 unsolved
Search for dead transitions found 8 dead transitions in 777ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 40/40 places, 16/24 transitions.
Graph (complete) has 64 edges and 40 vertex of which 32 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 32 /40 variables (removed 8) and now considering 16/16 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/40 places, 16/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 796 ms. Remains : 32/40 places, 16/24 transitions.
Built C files in :
/tmp/ltsmin16290901158346259122
[2024-05-21 09:01:30] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16290901158346259122
Running compilation step : cd /tmp/ltsmin16290901158346259122;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 95 ms.
Running link step : cd /tmp/ltsmin16290901158346259122;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin16290901158346259122;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10408427809599672930.hoa' '--buchi-type=spotba'
LTSmin run took 497 ms.
FORMULA CircularTrains-PT-024-LTLCardinality-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-024-LTLCardinality-04 finished in 4921 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 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 24/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 43 transition count 23
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 43 transition count 20
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 40 transition count 20
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 37 transition count 17
Applied a total of 14 rules in 3 ms. Remains 37 /44 variables (removed 7) and now considering 17/24 (removed 7) transitions.
// Phase 1: matrix 17 rows 37 cols
[2024-05-21 09:01:31] [INFO ] Computed 21 invariants in 0 ms
[2024-05-21 09:01:31] [INFO ] Implicit Places using invariants in 62 ms returned [6, 26, 36]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 66 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/44 places, 17/24 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 34 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 33 transition count 16
Applied a total of 2 rules in 1 ms. Remains 33 /34 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 33 cols
[2024-05-21 09:01:31] [INFO ] Computed 18 invariants in 1 ms
[2024-05-21 09:01:31] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 09:01:31] [INFO ] Invariant cache hit.
[2024-05-21 09:01:31] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/44 places, 16/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 180 ms. Remains : 33/44 places, 16/24 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-024-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 130 ms.
Stack based approach found an accepted trace after 249 steps with 0 reset with depth 250 and stack size 248 in 0 ms.
FORMULA CircularTrains-PT-024-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-024-LTLCardinality-05 finished in 367 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 U p1))||(p2&&G(F(p1))))))'
Support contains 6 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 24/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 43 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 43 transition count 22
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 42 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 40 transition count 20
Applied a total of 8 rules in 7 ms. Remains 40 /44 variables (removed 4) and now considering 20/24 (removed 4) transitions.
// Phase 1: matrix 20 rows 40 cols
[2024-05-21 09:01:32] [INFO ] Computed 21 invariants in 1 ms
[2024-05-21 09:01:32] [INFO ] Implicit Places using invariants in 55 ms returned [6, 26, 35, 39]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 56 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/44 places, 20/24 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 36 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 35 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 35 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 34 transition count 18
Applied a total of 4 rules in 3 ms. Remains 34 /36 variables (removed 2) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 34 cols
[2024-05-21 09:01:32] [INFO ] Computed 17 invariants in 1 ms
[2024-05-21 09:01:32] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-21 09:01:32] [INFO ] Invariant cache hit.
[2024-05-21 09:01:32] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/44 places, 18/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 131 ms. Remains : 34/44 places, 18/24 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-024-LTLCardinality-09
Product exploration explored 100000 steps with 14497 reset in 148 ms.
Product exploration explored 100000 steps with 14686 reset in 140 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 p2) p0), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (NOT p1)), (X p1), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 5 factoid took 578 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 9 states, 24 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 451 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false, false, false]
RANDOM walk for 315 steps (0 resets) in 6 ms. (45 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (NOT p1)), (X p1), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT p1))), (X (X p1)), (F (NOT (OR (NOT p1) p0 (NOT p2)))), (F (NOT (OR p1 (NOT p0) (NOT p2)))), (F (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (F (NOT (OR p1 p0 (NOT p2)))), (F p2), (F (NOT (AND (NOT p1) p0 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR p1 p0 p2))), (F p1), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 776 ms. Reduced automaton from 9 states, 24 edges and 3 AP (stutter insensitive) to 9 states, 24 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 337 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false, false, false]
Stuttering acceptance computed with spot in 381 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false, false, false]
[2024-05-21 09:01:35] [INFO ] Invariant cache hit.
[2024-05-21 09:01:35] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-05-21 09:01:35] [INFO ] [Real]Absence check using 15 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 09:01:35] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-21 09:01:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:01:35] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2024-05-21 09:01:35] [INFO ] [Nat]Absence check using 15 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 09:01:35] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-21 09:01:35] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 09:01:35] [INFO ] Added : 7 causal constraints over 2 iterations in 10 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 6 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-21 09:01:35] [INFO ] Invariant cache hit.
[2024-05-21 09:01:35] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 09:01:35] [INFO ] Invariant cache hit.
[2024-05-21 09:01:35] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2024-05-21 09:01:35] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-21 09:01:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 15/33 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 1/34 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 18/52 variables, 34/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 51 constraints, problems are : Problem set: 0 solved, 10 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 34/34 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/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 15/33 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 1/34 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 18/52 variables, 34/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 61 constraints, problems are : Problem set: 0 solved, 10 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 227ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 228ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 351 ms. Remains : 34/34 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 p1) p0 (NOT p2)), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p0), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND (NOT p1) p0 p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (NOT p1)), (X p1), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 10 factoid took 990 ms. Reduced automaton from 9 states, 24 edges and 3 AP (stutter insensitive) to 9 states, 24 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 393 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false, false, false]
RANDOM walk for 242 steps (0 resets) in 6 ms. (34 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p0), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND (NOT p1) p0 p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (NOT p1)), (X p1), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT p1))), (X (X p1)), (F (NOT (OR (NOT p1) p0 (NOT p2)))), (F (NOT (OR p1 (NOT p0) (NOT p2)))), (F (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (F (NOT (OR p1 p0 (NOT p2)))), (F p2), (F (NOT (AND (NOT p1) p0 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR p1 p0 p2))), (F p1), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 1238 ms. Reduced automaton from 9 states, 24 edges and 3 AP (stutter insensitive) to 9 states, 24 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 334 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false, false, false]
Stuttering acceptance computed with spot in 317 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false, false, false]
[2024-05-21 09:01:39] [INFO ] Invariant cache hit.
[2024-05-21 09:01:39] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2024-05-21 09:01:39] [INFO ] [Real]Absence check using 15 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 09:01:39] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-21 09:01:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:01:39] [INFO ] [Nat]Absence check using 15 positive place invariants in 1 ms returned sat
[2024-05-21 09:01:39] [INFO ] [Nat]Absence check using 15 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 09:01:39] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-21 09:01:39] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 09:01:39] [INFO ] Added : 7 causal constraints over 2 iterations in 16 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 313 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false, false, false]
Product exploration explored 100000 steps with 14752 reset in 141 ms.
Product exploration explored 100000 steps with 14312 reset in 144 ms.
Built C files in :
/tmp/ltsmin12000363851587387936
[2024-05-21 09:01:39] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2024-05-21 09:01:39] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:01:39] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2024-05-21 09:01:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:01:39] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2024-05-21 09:01:39] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:01:39] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12000363851587387936
Running compilation step : cd /tmp/ltsmin12000363851587387936;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 98 ms.
Running link step : cd /tmp/ltsmin12000363851587387936;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin12000363851587387936;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15807142432986794869.hoa' '--buchi-type=spotba'
LTSmin run took 353 ms.
FORMULA CircularTrains-PT-024-LTLCardinality-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-024-LTLCardinality-09 finished in 8274 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 3 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 24/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 43 transition count 23
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 43 transition count 20
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 40 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 38 transition count 18
Applied a total of 12 rules in 16 ms. Remains 38 /44 variables (removed 6) and now considering 18/24 (removed 6) transitions.
// Phase 1: matrix 18 rows 38 cols
[2024-05-21 09:01:40] [INFO ] Computed 21 invariants in 1 ms
[2024-05-21 09:01:40] [INFO ] Implicit Places using invariants in 60 ms returned [6, 26, 34, 37]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 62 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/44 places, 18/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 34 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 33 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 33 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 32 transition count 16
Applied a total of 4 rules in 2 ms. Remains 32 /34 variables (removed 2) and now considering 16/18 (removed 2) transitions.
// Phase 1: matrix 16 rows 32 cols
[2024-05-21 09:01:40] [INFO ] Computed 17 invariants in 2 ms
[2024-05-21 09:01:40] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-21 09:01:40] [INFO ] Invariant cache hit.
[2024-05-21 09:01:40] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/44 places, 16/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 162 ms. Remains : 32/44 places, 16/24 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-024-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 127 ms.
Stack based approach found an accepted trace after 58 steps with 0 reset with depth 59 and stack size 59 in 0 ms.
FORMULA CircularTrains-PT-024-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-024-LTLCardinality-14 finished in 336 ms.
All properties solved by simple procedures.
Total runtime 20315 ms.

BK_STOP 1716282100636

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//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//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CircularTrains-PT-024"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is CircularTrains-PT-024, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r070-tall-171620505600331"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;