About the Execution of ITS-Tools for CircularTrains-PT-096
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6024.871 | 2952354.00 | 3751129.00 | 7928.80 | FTTTTFTTFTFTFFTT | normal |
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-171620505700347.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-096, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505700347
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 14:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 14:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Apr 12 14:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 73K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-00
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-01
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-02
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-03
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-04
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-05
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-06
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-07
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-08
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-09
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-10
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-11
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-12
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-13
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-14
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716283245127
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-096
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 09:20:46] [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:20:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 09:20:46] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2024-05-21 09:20:46] [INFO ] Transformed 192 places.
[2024-05-21 09:20:46] [INFO ] Transformed 96 transitions.
[2024-05-21 09:20:46] [INFO ] Parsed PT model containing 192 places and 96 transitions and 384 arcs in 150 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CircularTrains-PT-096-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-096-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-096-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-096-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-096-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 96/96 transitions.
Applied a total of 0 rules in 24 ms. Remains 192 /192 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 192 cols
[2024-05-21 09:20:46] [INFO ] Computed 97 invariants in 24 ms
[2024-05-21 09:20:46] [INFO ] Implicit Places using invariants in 327 ms returned [1, 4, 8, 14, 20, 27, 29, 37, 39, 49, 116, 125, 155, 164, 166, 168, 174, 177, 178, 182, 183, 185, 186]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 361 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 169/192 places, 96/96 transitions.
Applied a total of 0 rules in 9 ms. Remains 169 /169 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 410 ms. Remains : 169/192 places, 96/96 transitions.
Support contains 31 out of 169 places after structural reductions.
[2024-05-21 09:20:47] [INFO ] Flatten gal took : 30 ms
[2024-05-21 09:20:47] [INFO ] Flatten gal took : 11 ms
[2024-05-21 09:20:47] [INFO ] Input system was already deterministic with 96 transitions.
Support contains 30 out of 169 places (down from 31) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1702 ms. (23 steps per ms) remains 7/21 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 94 ms. (421 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 7/7 properties
// Phase 1: matrix 96 rows 169 cols
[2024-05-21 09:20:48] [INFO ] Computed 74 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp19 is UNSAT
At refinement iteration 1 (OVERLAPS) 12/21 variables, 7/7 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 10/31 variables, 5/12 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/33 variables, 1/13 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/35 variables, 1/14 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/14 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp20 is UNSAT
After SMT solving in domain Real declared 99/265 variables, and 20 constraints, problems are : Problem set: 7 solved, 0 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 14/59 constraints, Generalized P Invariants (flows): 6/15 constraints, State Equation: 0/169 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 208ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 11 simplifications.
FORMULA CircularTrains-PT-096-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-096-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-096-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA CircularTrains-PT-096-LTLCardinality-01 TRUE 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' '!(X(X(X(G(p0)))))'
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 96/96 transitions.
Applied a total of 0 rules in 4 ms. Remains 169 /169 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-21 09:20:48] [INFO ] Invariant cache hit.
[2024-05-21 09:20:48] [INFO ] Implicit Places using invariants in 119 ms returned [3, 7, 99, 105, 112, 132, 149, 164]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 120 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/169 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 128 ms. Remains : 161/169 places, 96/96 transitions.
Stuttering acceptance computed with spot in 276 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 36 steps with 0 reset in 4 ms.
FORMULA CircularTrains-PT-096-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-096-LTLCardinality-00 finished in 473 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(F(p0)))'
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 96/96 transitions.
Applied a total of 0 rules in 4 ms. Remains 169 /169 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-21 09:20:48] [INFO ] Invariant cache hit.
[2024-05-21 09:20:49] [INFO ] Implicit Places using invariants in 100 ms returned [3, 7, 105, 112, 132, 149, 164, 166]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 102 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/169 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109 ms. Remains : 161/169 places, 96/96 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLCardinality-03
Product exploration explored 100000 steps with 35954 reset in 393 ms.
Product exploration explored 100000 steps with 35463 reset in 394 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 138 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 345 steps (0 resets) in 12 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 218 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 161 cols
[2024-05-21 09:20:50] [INFO ] Computed 66 invariants in 2 ms
[2024-05-21 09:20:50] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 09:20:50] [INFO ] Invariant cache hit.
[2024-05-21 09:20:50] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-21 09:20:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 63/160 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 227 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1976 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 63/160 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 64/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 291 constraints, problems are : Problem set: 0 solved, 64 unsolved in 5601 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 7594ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 7595ms
Finished structural reductions in LTL mode , in 1 iterations and 7820 ms. Remains : 161/161 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 183 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 281 steps (0 resets) in 5 ms. (46 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 207 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 35735 reset in 287 ms.
Product exploration explored 100000 steps with 34993 reset in 368 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 161 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 161 transition count 96
Deduced a syphon composed of 31 places in 0 ms
Applied a total of 31 rules in 46 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-21 09:21:00] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 161 cols
[2024-05-21 09:21:00] [INFO ] Computed 66 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 63/160 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-21 09:21:00] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 7 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-21 09:21:00] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-21 09:21:00] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-21 09:21:00] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 2 ms to minimize.
[2024-05-21 09:21:00] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-21 09:21:00] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-21 09:21:00] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-21 09:21:00] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-21 09:21:00] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-21 09:21:00] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 0 ms to minimize.
[2024-05-21 09:21:01] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2024-05-21 09:21:01] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-21 09:21:01] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-21 09:21:01] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-21 09:21:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-21 09:21:01] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-05-21 09:21:01] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-21 09:21:01] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 3 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-21 09:21:01] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
[2024-05-21 09:21:01] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 20/85 constraints. Problems are: Problem set: 20 solved, 44 unsolved
[2024-05-21 09:21:01] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-21 09:21:01] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-21 09:21:01] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-21 09:21:01] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-21 09:21:01] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2024-05-21 09:21:01] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2024-05-21 09:21:01] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-05-21 09:21:01] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 8/93 constraints. Problems are: Problem set: 28 solved, 36 unsolved
[2024-05-21 09:21:01] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-21 09:21:01] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-21 09:21:01] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 3/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 1/161 variables, 1/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 96/257 variables, 161/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 0/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 12 (OVERLAPS) 0/257 variables, 0/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 258 constraints, problems are : Problem set: 31 solved, 33 unsolved in 2410 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 31 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 94/160 variables, 63/63 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 2/65 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 31/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 1/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 96/257 variables, 161/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 33/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/257 variables, 0/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 291 constraints, problems are : Problem set: 31 solved, 33 unsolved in 1538 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 33/64 constraints, Known Traps: 31/31 constraints]
After SMT, in 3965ms problems are : Problem set: 31 solved, 33 unsolved
Search for dead transitions found 31 dead transitions in 3966ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 161/161 places, 65/96 transitions.
Graph (complete) has 260 edges and 161 vertex of which 130 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.3 ms
Discarding 31 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 17 ms. Remains 130 /161 variables (removed 31) and now considering 65/65 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 130/161 places, 65/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4038 ms. Remains : 130/161 places, 65/96 transitions.
Built C files in :
/tmp/ltsmin300997222408233811
[2024-05-21 09:21:04] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin300997222408233811
Running compilation step : cd /tmp/ltsmin300997222408233811;'/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 333 ms.
Running link step : cd /tmp/ltsmin300997222408233811;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin300997222408233811;'/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/stateBased5152861658329771354.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Applied a total of 0 rules in 7 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 161 cols
[2024-05-21 09:21:19] [INFO ] Computed 66 invariants in 2 ms
[2024-05-21 09:21:19] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-21 09:21:19] [INFO ] Invariant cache hit.
[2024-05-21 09:21:19] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-21 09:21:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 63/160 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 227 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1746 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 63/160 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 64/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 291 constraints, problems are : Problem set: 0 solved, 64 unsolved in 5284 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 7040ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 7041ms
Finished structural reductions in LTL mode , in 1 iterations and 7253 ms. Remains : 161/161 places, 96/96 transitions.
Built C files in :
/tmp/ltsmin7506835283187395733
[2024-05-21 09:21:26] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7506835283187395733
Running compilation step : cd /tmp/ltsmin7506835283187395733;'/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 237 ms.
Running link step : cd /tmp/ltsmin7506835283187395733;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7506835283187395733;'/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/stateBased4382222102352699037.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 09:21:41] [INFO ] Flatten gal took : 7 ms
[2024-05-21 09:21:41] [INFO ] Flatten gal took : 10 ms
[2024-05-21 09:21:41] [INFO ] Time to serialize gal into /tmp/LTL17082655745462151019.gal : 3 ms
[2024-05-21 09:21:41] [INFO ] Time to serialize properties into /tmp/LTL10673215364588246465.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17082655745462151019.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7888625379118196720.hoa' '-atoms' '/tmp/LTL10673215364588246465.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10673215364588246465.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7888625379118196720.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 09:21:56] [INFO ] Flatten gal took : 6 ms
[2024-05-21 09:21:56] [INFO ] Flatten gal took : 6 ms
[2024-05-21 09:21:56] [INFO ] Time to serialize gal into /tmp/LTL3545346718521270017.gal : 2 ms
[2024-05-21 09:21:56] [INFO ] Time to serialize properties into /tmp/LTL9302502823506276389.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3545346718521270017.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9302502823506276389.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F("(F29>Section_28)"))))
Formula 0 simplified : XG!"(F29>Section_28)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 09:22:11] [INFO ] Flatten gal took : 8 ms
[2024-05-21 09:22:11] [INFO ] Applying decomposition
[2024-05-21 09:22:11] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10249366671807980090.txt' '-o' '/tmp/graph10249366671807980090.bin' '-w' '/tmp/graph10249366671807980090.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10249366671807980090.bin' '-l' '-1' '-v' '-w' '/tmp/graph10249366671807980090.weights' '-q' '0' '-e' '0.001'
[2024-05-21 09:22:11] [INFO ] Decomposing Gal with order
[2024-05-21 09:22:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 09:22:12] [INFO ] Flatten gal took : 182 ms
[2024-05-21 09:22:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-21 09:22:12] [INFO ] Time to serialize gal into /tmp/LTL13126677235518862895.gal : 6 ms
[2024-05-21 09:22:12] [INFO ] Time to serialize properties into /tmp/LTL5904175564370170273.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13126677235518862895.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5904175564370170273.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F("(gu12.F29>gu12.Section_28)"))))
Formula 0 simplified : XG!"(gu12.F29>gu12.Section_28)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-096-LTLCardinality-03 finished in 98441 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(p0)))'
Support contains 3 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 96/96 transitions.
Applied a total of 0 rules in 5 ms. Remains 169 /169 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 169 cols
[2024-05-21 09:22:27] [INFO ] Computed 74 invariants in 2 ms
[2024-05-21 09:22:27] [INFO ] Implicit Places using invariants in 119 ms returned [3, 7, 99, 105, 112, 132, 149, 164, 166]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 120 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/169 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 126 ms. Remains : 160/169 places, 96/96 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-096-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-096-LTLCardinality-05 finished in 221 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(X(X((p0 U (p1||G(p0))))))))'
Support contains 3 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 169 /169 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-21 09:22:27] [INFO ] Invariant cache hit.
[2024-05-21 09:22:27] [INFO ] Implicit Places using invariants in 90 ms returned [3, 7, 99, 105, 112, 132, 149, 164, 166]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 91 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/169 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 94 ms. Remains : 160/169 places, 96/96 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-096-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-096-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-096-LTLCardinality-10 finished in 293 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((p0||X(F((p1||G(p2))))))))'
Support contains 5 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-21 09:22:27] [INFO ] Invariant cache hit.
[2024-05-21 09:22:27] [INFO ] Implicit Places using invariants in 87 ms returned [3, 99, 105, 112, 132, 164, 166]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 88 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/169 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 162 /162 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 91 ms. Remains : 162/169 places, 96/96 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-096-LTLCardinality-11
Product exploration explored 100000 steps with 4340 reset in 431 ms.
Product exploration explored 100000 steps with 4403 reset in 470 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 321 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 440 steps (0 resets) in 14 ms. (29 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p1 (NOT p2)))), (F p2), (F p0), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 1 factoid took 466 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 96 rows 162 cols
[2024-05-21 09:22:30] [INFO ] Computed 67 invariants in 7 ms
[2024-05-21 09:22:30] [INFO ] [Real]Absence check using 62 positive place invariants in 9 ms returned sat
[2024-05-21 09:22:30] [INFO ] [Real]Absence check using 62 positive and 5 generalized place invariants in 6 ms returned sat
[2024-05-21 09:22:30] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-21 09:22:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:22:30] [INFO ] [Nat]Absence check using 62 positive place invariants in 10 ms returned sat
[2024-05-21 09:22:30] [INFO ] [Nat]Absence check using 62 positive and 5 generalized place invariants in 5 ms returned sat
[2024-05-21 09:22:30] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2024-05-21 09:22:30] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-21 09:22:30] [INFO ] Added : 61 causal constraints over 13 iterations in 239 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
Support contains 5 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 162 /162 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-21 09:22:30] [INFO ] Invariant cache hit.
[2024-05-21 09:22:30] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 09:22:30] [INFO ] Invariant cache hit.
[2024-05-21 09:22:31] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-21 09:22:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 62/160 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 2/162 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/258 variables, 162/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/258 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 229 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1532 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 62/160 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 2/162 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/258 variables, 162/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 64/293 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/258 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 293 constraints, problems are : Problem set: 0 solved, 64 unsolved in 4717 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 6258ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 6258ms
Finished structural reductions in LTL mode , in 1 iterations and 6455 ms. Remains : 162/162 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 360 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 606 steps (0 resets) in 15 ms. (37 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p1 (NOT p2)))), (F p2), (F p0), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 1 factoid took 436 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2024-05-21 09:22:38] [INFO ] Invariant cache hit.
[2024-05-21 09:22:38] [INFO ] [Real]Absence check using 62 positive place invariants in 10 ms returned sat
[2024-05-21 09:22:38] [INFO ] [Real]Absence check using 62 positive and 5 generalized place invariants in 5 ms returned sat
[2024-05-21 09:22:38] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2024-05-21 09:22:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:22:38] [INFO ] [Nat]Absence check using 62 positive place invariants in 9 ms returned sat
[2024-05-21 09:22:38] [INFO ] [Nat]Absence check using 62 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-21 09:22:38] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-21 09:22:38] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-21 09:22:39] [INFO ] Added : 61 causal constraints over 13 iterations in 231 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 4331 reset in 405 ms.
Product exploration explored 100000 steps with 4303 reset in 424 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 96/96 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 162 transition count 96
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 26 place count 162 transition count 96
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 162 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 162 transition count 96
Deduced a syphon composed of 31 places in 0 ms
Applied a total of 31 rules in 16 ms. Remains 162 /162 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-21 09:22:40] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 162 cols
[2024-05-21 09:22:40] [INFO ] Computed 67 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 62/160 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-21 09:22:40] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-21 09:22:40] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-21 09:22:40] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-21 09:22:40] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-21 09:22:40] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-05-21 09:22:40] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-21 09:22:40] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2024-05-21 09:22:40] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-21 09:22:40] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2024-05-21 09:22:40] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-21 09:22:41] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-21 09:22:41] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 10 ms to minimize.
[2024-05-21 09:22:41] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2024-05-21 09:22:41] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-21 09:22:41] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
[2024-05-21 09:22:41] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-05-21 09:22:41] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-21 09:22:41] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-21 09:22:41] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-21 09:22:41] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 20/85 constraints. Problems are: Problem set: 20 solved, 44 unsolved
[2024-05-21 09:22:41] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-05-21 09:22:41] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 2/87 constraints. Problems are: Problem set: 22 solved, 42 unsolved
[2024-05-21 09:22:41] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-21 09:22:41] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-21 09:22:41] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-21 09:22:41] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2024-05-21 09:22:41] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-21 09:22:41] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 6/93 constraints. Problems are: Problem set: 28 solved, 36 unsolved
[2024-05-21 09:22:41] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-21 09:22:41] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2024-05-21 09:22:41] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD6 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 3/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 2/162 variables, 2/98 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/98 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 96/258 variables, 162/260 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/260 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 12 (OVERLAPS) 0/258 variables, 0/260 constraints. Problems are: Problem set: 31 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 260 constraints, problems are : Problem set: 31 solved, 33 unsolved in 2256 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 31 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 93/158 variables, 62/62 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 31/93 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/93 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 4/162 variables, 5/98 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/98 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 96/258 variables, 162/260 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 33/293 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/293 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/258 variables, 0/293 constraints. Problems are: Problem set: 31 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 293 constraints, problems are : Problem set: 31 solved, 33 unsolved in 1378 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 33/64 constraints, Known Traps: 31/31 constraints]
After SMT, in 3653ms problems are : Problem set: 31 solved, 33 unsolved
Search for dead transitions found 31 dead transitions in 3654ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 162/162 places, 65/96 transitions.
Graph (complete) has 264 edges and 162 vertex of which 131 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.2 ms
Discarding 31 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 131 /162 variables (removed 31) and now considering 65/65 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 131/162 places, 65/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3693 ms. Remains : 131/162 places, 65/96 transitions.
Built C files in :
/tmp/ltsmin15179076620925629241
[2024-05-21 09:22:44] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15179076620925629241
Running compilation step : cd /tmp/ltsmin15179076620925629241;'/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 213 ms.
Running link step : cd /tmp/ltsmin15179076620925629241;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin15179076620925629241;'/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/stateBased16303831403223820681.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 162 /162 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 162 cols
[2024-05-21 09:22:59] [INFO ] Computed 67 invariants in 2 ms
[2024-05-21 09:22:59] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-21 09:22:59] [INFO ] Invariant cache hit.
[2024-05-21 09:22:59] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-21 09:22:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 62/160 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 2/162 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/258 variables, 162/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/258 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 229 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1528 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 62/160 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 2/162 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/258 variables, 162/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 64/293 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/258 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 293 constraints, problems are : Problem set: 0 solved, 64 unsolved in 4778 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 6315ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 6317ms
Finished structural reductions in LTL mode , in 1 iterations and 6536 ms. Remains : 162/162 places, 96/96 transitions.
Built C files in :
/tmp/ltsmin1606667442691938985
[2024-05-21 09:23:05] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1606667442691938985
Running compilation step : cd /tmp/ltsmin1606667442691938985;'/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 215 ms.
Running link step : cd /tmp/ltsmin1606667442691938985;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1606667442691938985;'/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/stateBased16423215380123401772.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 09:23:20] [INFO ] Flatten gal took : 9 ms
[2024-05-21 09:23:20] [INFO ] Flatten gal took : 6 ms
[2024-05-21 09:23:20] [INFO ] Time to serialize gal into /tmp/LTL2148635206590412763.gal : 1 ms
[2024-05-21 09:23:20] [INFO ] Time to serialize properties into /tmp/LTL7237306780474159443.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2148635206590412763.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7195136683774574745.hoa' '-atoms' '/tmp/LTL7237306780474159443.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7237306780474159443.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7195136683774574745.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 09:23:35] [INFO ] Flatten gal took : 5 ms
[2024-05-21 09:23:35] [INFO ] Flatten gal took : 5 ms
[2024-05-21 09:23:35] [INFO ] Time to serialize gal into /tmp/LTL14055020867537999746.gal : 2 ms
[2024-05-21 09:23:35] [INFO ] Time to serialize properties into /tmp/LTL9481798691039067144.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14055020867537999746.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9481798691039067144.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("(F32<=Section_19)")||(X(F(("(F52<=Section_80)")||(G("(F5>=2)")))))))))
Formula 0 simplified : XF(!"(F32<=Section_19)" & XG(!"(F52<=Section_80)" & F!"(F5>=2)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 09:23:50] [INFO ] Flatten gal took : 13 ms
[2024-05-21 09:23:50] [INFO ] Applying decomposition
[2024-05-21 09:23:51] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3724315442818816939.txt' '-o' '/tmp/graph3724315442818816939.bin' '-w' '/tmp/graph3724315442818816939.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3724315442818816939.bin' '-l' '-1' '-v' '-w' '/tmp/graph3724315442818816939.weights' '-q' '0' '-e' '0.001'
[2024-05-21 09:23:51] [INFO ] Decomposing Gal with order
[2024-05-21 09:23:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 09:23:51] [INFO ] Flatten gal took : 8 ms
[2024-05-21 09:23:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 09:23:51] [INFO ] Time to serialize gal into /tmp/LTL18409223899452254013.gal : 2 ms
[2024-05-21 09:23:51] [INFO ] Time to serialize properties into /tmp/LTL1545301634845459371.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18409223899452254013.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1545301634845459371.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("(gu1.F32<=gu1.Section_19)")||(X(F(("(gu30.F52<=gu30.Section_80)")||(G("(gi1.gi1.gi0.gu9.F5>=2)")))))))))
Formula 0 simplified : XF(!"(gu1.F32<=gu1.Section_19)" & XG(!"(gu30.F52<=gu30.Section_80)" & F!"(gi1.gi1.gi0.gu9.F5>=2)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-096-LTLCardinality-11 finished in 98235 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)&&F(G(p1)))))'
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 169 transition count 77
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 150 transition count 77
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 38 place count 150 transition count 73
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 46 place count 146 transition count 73
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 52 place count 143 transition count 70
Applied a total of 52 rules in 15 ms. Remains 143 /169 variables (removed 26) and now considering 70/96 (removed 26) transitions.
// Phase 1: matrix 70 rows 143 cols
[2024-05-21 09:24:06] [INFO ] Computed 74 invariants in 1 ms
[2024-05-21 09:24:06] [INFO ] Implicit Places using invariants in 80 ms returned [2, 6, 85, 91, 97, 115, 128, 140]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 80 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/169 places, 70/96 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 135 transition count 67
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 132 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 131 transition count 66
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 8 place count 131 transition count 64
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 12 place count 129 transition count 64
Applied a total of 12 rules in 6 ms. Remains 129 /135 variables (removed 6) and now considering 64/70 (removed 6) transitions.
// Phase 1: matrix 64 rows 129 cols
[2024-05-21 09:24:06] [INFO ] Computed 66 invariants in 1 ms
[2024-05-21 09:24:06] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 09:24:06] [INFO ] Invariant cache hit.
[2024-05-21 09:24:06] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 129/169 places, 64/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 267 ms. Remains : 129/169 places, 64/96 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-096-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 320 ms.
Product exploration explored 100000 steps with 0 reset in 435 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 192 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 956 steps (0 resets) in 11 ms. (79 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F p0), (F p1)]
Knowledge based reduction with 2 factoid took 256 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-21 09:24:08] [INFO ] Invariant cache hit.
[2024-05-21 09:24:08] [INFO ] [Real]Absence check using 62 positive place invariants in 8 ms returned sat
[2024-05-21 09:24:08] [INFO ] [Real]Absence check using 62 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 09:24:08] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-21 09:24:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:24:08] [INFO ] [Nat]Absence check using 62 positive place invariants in 8 ms returned sat
[2024-05-21 09:24:08] [INFO ] [Nat]Absence check using 62 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-21 09:24:08] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-21 09:24:08] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-21 09:24:08] [INFO ] Added : 31 causal constraints over 7 iterations in 209 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-21 09:24:08] [INFO ] Invariant cache hit.
[2024-05-21 09:24:08] [INFO ] [Real]Absence check using 62 positive place invariants in 8 ms returned sat
[2024-05-21 09:24:08] [INFO ] [Real]Absence check using 62 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 09:24:08] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-21 09:24:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:24:08] [INFO ] [Nat]Absence check using 62 positive place invariants in 8 ms returned sat
[2024-05-21 09:24:08] [INFO ] [Nat]Absence check using 62 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-21 09:24:08] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-21 09:24:08] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-21 09:24:08] [INFO ] Added : 30 causal constraints over 6 iterations in 129 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 64/64 transitions.
Applied a total of 0 rules in 6 ms. Remains 129 /129 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-21 09:24:08] [INFO ] Invariant cache hit.
[2024-05-21 09:24:08] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-21 09:24:08] [INFO ] Invariant cache hit.
[2024-05-21 09:24:09] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-05-21 09:24:09] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-21 09:24:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 62/126 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 3/129 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 64/193 variables, 129/195 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 195 constraints, problems are : Problem set: 0 solved, 32 unsolved in 640 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 62/126 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 3/129 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 64/193 variables, 129/195 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 32/227 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/193 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 227 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1669 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2315ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2315ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2509 ms. Remains : 129/129 places, 64/64 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 222 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 765 steps (0 resets) in 10 ms. (69 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F p0), (F p1)]
Knowledge based reduction with 2 factoid took 271 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-21 09:24:12] [INFO ] Invariant cache hit.
[2024-05-21 09:24:12] [INFO ] [Real]Absence check using 62 positive place invariants in 8 ms returned sat
[2024-05-21 09:24:12] [INFO ] [Real]Absence check using 62 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 09:24:12] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-21 09:24:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:24:12] [INFO ] [Nat]Absence check using 62 positive place invariants in 8 ms returned sat
[2024-05-21 09:24:12] [INFO ] [Nat]Absence check using 62 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-21 09:24:12] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-21 09:24:12] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-21 09:24:12] [INFO ] Added : 31 causal constraints over 7 iterations in 195 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-21 09:24:12] [INFO ] Invariant cache hit.
[2024-05-21 09:24:12] [INFO ] [Real]Absence check using 62 positive place invariants in 8 ms returned sat
[2024-05-21 09:24:12] [INFO ] [Real]Absence check using 62 positive and 4 generalized place invariants in 5 ms returned sat
[2024-05-21 09:24:12] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-21 09:24:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:24:12] [INFO ] [Nat]Absence check using 62 positive place invariants in 8 ms returned sat
[2024-05-21 09:24:12] [INFO ] [Nat]Absence check using 62 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-21 09:24:12] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-21 09:24:12] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-21 09:24:12] [INFO ] Added : 30 causal constraints over 6 iterations in 135 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 320 ms.
Product exploration explored 100000 steps with 0 reset in 382 ms.
Built C files in :
/tmp/ltsmin3913092170965094616
[2024-05-21 09:24:13] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2024-05-21 09:24:13] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:24:13] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2024-05-21 09:24:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:24:13] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2024-05-21 09:24:13] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:24:13] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3913092170965094616
Running compilation step : cd /tmp/ltsmin3913092170965094616;'/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 188 ms.
Running link step : cd /tmp/ltsmin3913092170965094616;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin3913092170965094616;'/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/stateBased3550228967468728363.hoa' '--buchi-type=spotba'
LTSmin run took 253 ms.
FORMULA CircularTrains-PT-096-LTLCardinality-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-096-LTLCardinality-12 finished in 8207 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 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 169 transition count 78
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 151 transition count 78
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 36 place count 151 transition count 73
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 46 place count 146 transition count 73
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 52 place count 143 transition count 70
Applied a total of 52 rules in 10 ms. Remains 143 /169 variables (removed 26) and now considering 70/96 (removed 26) transitions.
// Phase 1: matrix 70 rows 143 cols
[2024-05-21 09:24:14] [INFO ] Computed 74 invariants in 1 ms
[2024-05-21 09:24:14] [INFO ] Implicit Places using invariants in 78 ms returned [2, 6, 86, 92, 98, 115, 128, 139, 140]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 78 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/169 places, 70/96 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 134 transition count 65
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 129 transition count 65
Applied a total of 10 rules in 4 ms. Remains 129 /134 variables (removed 5) and now considering 65/70 (removed 5) transitions.
// Phase 1: matrix 65 rows 129 cols
[2024-05-21 09:24:14] [INFO ] Computed 65 invariants in 0 ms
[2024-05-21 09:24:14] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 09:24:14] [INFO ] Invariant cache hit.
[2024-05-21 09:24:14] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 129/169 places, 65/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 249 ms. Remains : 129/169 places, 65/96 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 307 ms.
Product exploration explored 100000 steps with 0 reset in 385 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 259 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
RANDOM walk for 160 steps (0 resets) in 4 ms. (32 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 177 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 65/65 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-21 09:24:15] [INFO ] Invariant cache hit.
[2024-05-21 09:24:15] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 09:24:15] [INFO ] Invariant cache hit.
[2024-05-21 09:24:16] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-05-21 09:24:16] [INFO ] Redundant transitions in 0 ms returned []
Running 33 sub problems to find dead transitions.
[2024-05-21 09:24:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 63/128 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 1/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 65/194 variables, 129/194 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 0/194 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 194 constraints, problems are : Problem set: 0 solved, 33 unsolved in 651 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 63/128 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 1/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 65/194 variables, 129/194 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/194 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 227 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1219 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 1875ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 1875ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2044 ms. Remains : 129/129 places, 65/65 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 150 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
RANDOM walk for 242 steps (0 resets) in 6 ms. (34 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 159 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 311 ms.
Product exploration explored 100000 steps with 0 reset in 376 ms.
Built C files in :
/tmp/ltsmin6834990123496195207
[2024-05-21 09:24:19] [INFO ] Computing symmetric may disable matrix : 65 transitions.
[2024-05-21 09:24:19] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:24:19] [INFO ] Computing symmetric may enable matrix : 65 transitions.
[2024-05-21 09:24:19] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:24:19] [INFO ] Computing Do-Not-Accords matrix : 65 transitions.
[2024-05-21 09:24:19] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:24:19] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6834990123496195207
Running compilation step : cd /tmp/ltsmin6834990123496195207;'/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 177 ms.
Running link step : cd /tmp/ltsmin6834990123496195207;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6834990123496195207;'/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/stateBased3824781897394505222.hoa' '--buchi-type=spotba'
LTSmin run took 201 ms.
FORMULA CircularTrains-PT-096-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-096-LTLCardinality-13 finished in 5202 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(F(p0)))'
Found a Shortening insensitive property : CircularTrains-PT-096-LTLCardinality-03
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 169/169 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 169 transition count 77
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 150 transition count 77
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 38 place count 150 transition count 74
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 44 place count 147 transition count 74
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 52 place count 143 transition count 70
Applied a total of 52 rules in 12 ms. Remains 143 /169 variables (removed 26) and now considering 70/96 (removed 26) transitions.
// Phase 1: matrix 70 rows 143 cols
[2024-05-21 09:24:19] [INFO ] Computed 74 invariants in 1 ms
[2024-05-21 09:24:19] [INFO ] Implicit Places using invariants in 77 ms returned [2, 6, 92, 98, 115, 128, 139, 140]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 78 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 135/169 places, 70/96 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 135 transition count 66
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 131 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 130 transition count 65
Applied a total of 10 rules in 5 ms. Remains 130 /135 variables (removed 5) and now considering 65/70 (removed 5) transitions.
// Phase 1: matrix 65 rows 130 cols
[2024-05-21 09:24:19] [INFO ] Computed 66 invariants in 0 ms
[2024-05-21 09:24:19] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 09:24:19] [INFO ] Invariant cache hit.
[2024-05-21 09:24:19] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 130/169 places, 65/96 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 252 ms. Remains : 130/169 places, 65/96 transitions.
Running random walk in product with property : CircularTrains-PT-096-LTLCardinality-03
Product exploration explored 100000 steps with 36814 reset in 280 ms.
Product exploration explored 100000 steps with 35589 reset in 318 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 241 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 359 steps (0 resets) in 8 ms. (39 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 138 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-21 09:24:21] [INFO ] Invariant cache hit.
[2024-05-21 09:24:21] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 09:24:21] [INFO ] Invariant cache hit.
[2024-05-21 09:24:21] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 33 sub problems to find dead transitions.
[2024-05-21 09:24:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 63/129 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 196 constraints, problems are : Problem set: 0 solved, 33 unsolved in 733 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 63/129 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 33/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 229 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1402 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 2142ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2142ms
Finished structural reductions in LTL mode , in 1 iterations and 2314 ms. Remains : 130/130 places, 65/65 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 145 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 337 steps (0 resets) in 6 ms. (48 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 176 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 37380 reset in 283 ms.
Product exploration explored 100000 steps with 36601 reset in 314 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 4 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-21 09:24:24] [INFO ] Redundant transitions in 1 ms returned []
Running 33 sub problems to find dead transitions.
[2024-05-21 09:24:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 63/129 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 196 constraints, problems are : Problem set: 0 solved, 33 unsolved in 743 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 63/129 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 33/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 229 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1337 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 2086ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2086ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2097 ms. Remains : 130/130 places, 65/65 transitions.
Built C files in :
/tmp/ltsmin10174325700417064119
[2024-05-21 09:24:26] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10174325700417064119
Running compilation step : cd /tmp/ltsmin10174325700417064119;'/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 162 ms.
Running link step : cd /tmp/ltsmin10174325700417064119;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin10174325700417064119;'/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/stateBased3586480356368796279.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-21 09:24:42] [INFO ] Invariant cache hit.
[2024-05-21 09:24:42] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 09:24:42] [INFO ] Invariant cache hit.
[2024-05-21 09:24:42] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 33 sub problems to find dead transitions.
[2024-05-21 09:24:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 63/129 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 196 constraints, problems are : Problem set: 0 solved, 33 unsolved in 769 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 63/129 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 33/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 229 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1364 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 2140ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2141ms
Finished structural reductions in LTL mode , in 1 iterations and 2330 ms. Remains : 130/130 places, 65/65 transitions.
Built C files in :
/tmp/ltsmin8743469353971652398
[2024-05-21 09:24:44] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8743469353971652398
Running compilation step : cd /tmp/ltsmin8743469353971652398;'/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 175 ms.
Running link step : cd /tmp/ltsmin8743469353971652398;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8743469353971652398;'/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/stateBased2255687299645155874.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 09:24:59] [INFO ] Flatten gal took : 7 ms
[2024-05-21 09:24:59] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:24:59] [INFO ] Time to serialize gal into /tmp/LTL9506063135282472077.gal : 1 ms
[2024-05-21 09:24:59] [INFO ] Time to serialize properties into /tmp/LTL27678847187698780.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9506063135282472077.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12713844219542463496.hoa' '-atoms' '/tmp/LTL27678847187698780.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL27678847187698780.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12713844219542463496.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 09:25:14] [INFO ] Flatten gal took : 4 ms
[2024-05-21 09:25:14] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:25:14] [INFO ] Time to serialize gal into /tmp/LTL2789981921289521619.gal : 0 ms
[2024-05-21 09:25:14] [INFO ] Time to serialize properties into /tmp/LTL10825443506082911473.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2789981921289521619.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10825443506082911473.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F("(F29>Section_28)"))))
Formula 0 simplified : XG!"(F29>Section_28)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 09:25:29] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:25:29] [INFO ] Applying decomposition
[2024-05-21 09:25:29] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15136195150067127728.txt' '-o' '/tmp/graph15136195150067127728.bin' '-w' '/tmp/graph15136195150067127728.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15136195150067127728.bin' '-l' '-1' '-v' '-w' '/tmp/graph15136195150067127728.weights' '-q' '0' '-e' '0.001'
[2024-05-21 09:25:29] [INFO ] Decomposing Gal with order
[2024-05-21 09:25:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 09:25:29] [INFO ] Flatten gal took : 7 ms
[2024-05-21 09:25:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 09:25:29] [INFO ] Time to serialize gal into /tmp/LTL17573187466573541201.gal : 1 ms
[2024-05-21 09:25:29] [INFO ] Time to serialize properties into /tmp/LTL7903627823766317612.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17573187466573541201.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7903627823766317612.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F("(gu40.F29>gu40.Section_28)"))))
Formula 0 simplified : XG!"(gu40.F29>gu40.Section_28)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-096-LTLCardinality-03 finished in 85244 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((p0||X(F((p1||G(p2))))))))'
Found a Lengthening insensitive property : CircularTrains-PT-096-LTLCardinality-11
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 169 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 169/169 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 169 transition count 79
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 152 transition count 79
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 34 place count 152 transition count 74
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 44 place count 147 transition count 74
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 52 place count 143 transition count 70
Applied a total of 52 rules in 12 ms. Remains 143 /169 variables (removed 26) and now considering 70/96 (removed 26) transitions.
// Phase 1: matrix 70 rows 143 cols
[2024-05-21 09:25:45] [INFO ] Computed 74 invariants in 1 ms
[2024-05-21 09:25:45] [INFO ] Implicit Places using invariants in 84 ms returned [2, 85, 91, 97, 115, 139, 140]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 85 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 136/169 places, 70/96 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 136 transition count 67
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 133 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 133 transition count 66
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 132 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 131 transition count 65
Applied a total of 10 rules in 5 ms. Remains 131 /136 variables (removed 5) and now considering 65/70 (removed 5) transitions.
// Phase 1: matrix 65 rows 131 cols
[2024-05-21 09:25:45] [INFO ] Computed 67 invariants in 1 ms
[2024-05-21 09:25:45] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 09:25:45] [INFO ] Invariant cache hit.
[2024-05-21 09:25:45] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 131/169 places, 65/96 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 265 ms. Remains : 131/169 places, 65/96 transitions.
Running random walk in product with property : CircularTrains-PT-096-LTLCardinality-11
Product exploration explored 100000 steps with 6094 reset in 385 ms.
Product exploration explored 100000 steps with 6036 reset in 460 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 333 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 1795 steps (0 resets) in 14 ms. (119 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p1 (NOT p2)))), (F p2), (F p0), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 1 factoid took 425 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2024-05-21 09:25:47] [INFO ] Invariant cache hit.
[2024-05-21 09:25:47] [INFO ] [Real]Absence check using 62 positive place invariants in 8 ms returned sat
[2024-05-21 09:25:47] [INFO ] [Real]Absence check using 62 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-21 09:25:47] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-21 09:25:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:25:47] [INFO ] [Nat]Absence check using 62 positive place invariants in 8 ms returned sat
[2024-05-21 09:25:47] [INFO ] [Nat]Absence check using 62 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-21 09:25:47] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-05-21 09:25:47] [INFO ] Computed and/alt/rep : 33/65/33 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-21 09:25:47] [INFO ] Added : 31 causal constraints over 7 iterations in 121 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
Support contains 5 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 65/65 transitions.
Applied a total of 0 rules in 3 ms. Remains 131 /131 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-21 09:25:47] [INFO ] Invariant cache hit.
[2024-05-21 09:25:47] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 09:25:47] [INFO ] Invariant cache hit.
[2024-05-21 09:25:47] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 33 sub problems to find dead transitions.
[2024-05-21 09:25:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 62/127 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 4/131 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 65/196 variables, 131/198 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 198 constraints, problems are : Problem set: 0 solved, 33 unsolved in 654 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 62/127 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 4/131 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 65/196 variables, 131/198 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 33/231 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 231 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1565 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 2228ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2228ms
Finished structural reductions in LTL mode , in 1 iterations and 2397 ms. Remains : 131/131 places, 65/65 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 377 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 579 steps (0 resets) in 12 ms. (44 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p1 (NOT p2)))), (F p2), (F p0), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 1 factoid took 481 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2024-05-21 09:25:51] [INFO ] Invariant cache hit.
[2024-05-21 09:25:51] [INFO ] [Real]Absence check using 62 positive place invariants in 8 ms returned sat
[2024-05-21 09:25:51] [INFO ] [Real]Absence check using 62 positive and 5 generalized place invariants in 18 ms returned sat
[2024-05-21 09:25:51] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-21 09:25:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:25:51] [INFO ] [Nat]Absence check using 62 positive place invariants in 8 ms returned sat
[2024-05-21 09:25:51] [INFO ] [Nat]Absence check using 62 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-21 09:25:51] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-05-21 09:25:51] [INFO ] Computed and/alt/rep : 33/65/33 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-21 09:25:51] [INFO ] Added : 31 causal constraints over 7 iterations in 120 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 6153 reset in 394 ms.
Product exploration explored 100000 steps with 6077 reset in 439 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 131 /131 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-21 09:25:52] [INFO ] Redundant transitions in 1 ms returned []
Running 33 sub problems to find dead transitions.
[2024-05-21 09:25:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 62/127 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 4/131 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 65/196 variables, 131/198 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 198 constraints, problems are : Problem set: 0 solved, 33 unsolved in 666 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 62/127 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 4/131 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 65/196 variables, 131/198 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 33/231 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 231 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1555 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 2227ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2227ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2235 ms. Remains : 131/131 places, 65/65 transitions.
Built C files in :
/tmp/ltsmin13654865543465363119
[2024-05-21 09:25:55] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13654865543465363119
Running compilation step : cd /tmp/ltsmin13654865543465363119;'/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 179 ms.
Running link step : cd /tmp/ltsmin13654865543465363119;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13654865543465363119;'/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/stateBased1362868028815451310.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 65/65 transitions.
Applied a total of 0 rules in 3 ms. Remains 131 /131 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-21 09:26:10] [INFO ] Invariant cache hit.
[2024-05-21 09:26:10] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 09:26:10] [INFO ] Invariant cache hit.
[2024-05-21 09:26:10] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 33 sub problems to find dead transitions.
[2024-05-21 09:26:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 62/127 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 4/131 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 65/196 variables, 131/198 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 198 constraints, problems are : Problem set: 0 solved, 33 unsolved in 664 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 62/127 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 4/131 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 65/196 variables, 131/198 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 33/231 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 231 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1599 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 2269ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2269ms
Finished structural reductions in LTL mode , in 1 iterations and 2455 ms. Remains : 131/131 places, 65/65 transitions.
Built C files in :
/tmp/ltsmin13356503902233124320
[2024-05-21 09:26:12] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13356503902233124320
Running compilation step : cd /tmp/ltsmin13356503902233124320;'/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 183 ms.
Running link step : cd /tmp/ltsmin13356503902233124320;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin13356503902233124320;'/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/stateBased15363188318849591677.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 09:26:27] [INFO ] Flatten gal took : 7 ms
[2024-05-21 09:26:27] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:26:27] [INFO ] Time to serialize gal into /tmp/LTL8581731235102422027.gal : 1 ms
[2024-05-21 09:26:27] [INFO ] Time to serialize properties into /tmp/LTL2290936771154950622.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8581731235102422027.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5003719020228493264.hoa' '-atoms' '/tmp/LTL2290936771154950622.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2290936771154950622.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5003719020228493264.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 09:26:42] [INFO ] Flatten gal took : 5 ms
[2024-05-21 09:26:42] [INFO ] Flatten gal took : 5 ms
[2024-05-21 09:26:42] [INFO ] Time to serialize gal into /tmp/LTL13902760634870279526.gal : 2 ms
[2024-05-21 09:26:42] [INFO ] Time to serialize properties into /tmp/LTL14341579105657196909.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13902760634870279526.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14341579105657196909.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("(F32<=Section_19)")||(X(F(("(F52<=Section_80)")||(G("(F5>=2)")))))))))
Formula 0 simplified : XF(!"(F32<=Section_19)" & XG(!"(F52<=Section_80)" & F!"(F5>=2)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 09:26:57] [INFO ] Flatten gal took : 10 ms
[2024-05-21 09:26:57] [INFO ] Applying decomposition
[2024-05-21 09:26:57] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3300326125896261712.txt' '-o' '/tmp/graph3300326125896261712.bin' '-w' '/tmp/graph3300326125896261712.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3300326125896261712.bin' '-l' '-1' '-v' '-w' '/tmp/graph3300326125896261712.weights' '-q' '0' '-e' '0.001'
[2024-05-21 09:26:57] [INFO ] Decomposing Gal with order
[2024-05-21 09:26:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 09:26:57] [INFO ] Flatten gal took : 8 ms
[2024-05-21 09:26:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 09:26:57] [INFO ] Time to serialize gal into /tmp/LTL7890250858695295156.gal : 1 ms
[2024-05-21 09:26:57] [INFO ] Time to serialize properties into /tmp/LTL3018134081295807845.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7890250858695295156.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3018134081295807845.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G(("(gu49.F32<=gu49.Section_19)")||(X(F(("(gu55.F52<=gu55.Section_80)")||(G("(gi2.gi0.gi0.gi1.gu53.F5>=2)")))))))))
Formula 0 simplified : XF(!"(gu49.F32<=gu49.Section_19)" & XG(!"(gu55.F52<=gu55.Section_80)" & F!"(gi2.gi0.gi0.gi1.gu53.F5>=2)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-096-LTLCardinality-11 finished in 88205 ms.
[2024-05-21 09:27:12] [INFO ] Flatten gal took : 7 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3890813525817518388
[2024-05-21 09:27:12] [INFO ] Computing symmetric may disable matrix : 96 transitions.
[2024-05-21 09:27:12] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:27:12] [INFO ] Computing symmetric may enable matrix : 96 transitions.
[2024-05-21 09:27:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:27:12] [INFO ] Applying decomposition
[2024-05-21 09:27:12] [INFO ] Flatten gal took : 4 ms
[2024-05-21 09:27:12] [INFO ] Computing Do-Not-Accords matrix : 96 transitions.
[2024-05-21 09:27:12] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:27:12] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3890813525817518388
Running compilation step : cd /tmp/ltsmin3890813525817518388;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1155891119106455724.txt' '-o' '/tmp/graph1155891119106455724.bin' '-w' '/tmp/graph1155891119106455724.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1155891119106455724.bin' '-l' '-1' '-v' '-w' '/tmp/graph1155891119106455724.weights' '-q' '0' '-e' '0.001'
[2024-05-21 09:27:12] [INFO ] Decomposing Gal with order
[2024-05-21 09:27:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 09:27:12] [INFO ] Flatten gal took : 6 ms
[2024-05-21 09:27:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 09:27:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality10660894194947917432.gal : 1 ms
[2024-05-21 09:27:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality168188930532936092.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10660894194947917432.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality168188930532936092.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !((X(F("(gu18.F29>gu18.Section_28)"))))
Formula 0 simplified : XG!"(gu18.F29>gu18.Section_28)"
Compilation finished in 248 ms.
Running link step : cd /tmp/ltsmin3890813525817518388;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3890813525817518388;'/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' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.319: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.319: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.319: LTL layer: formula: X(<>((LTLAPp0==true)))
pins2lts-mc-linux64( 0/ 8), 0.320: "X(<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.320: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.325: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.326: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.326: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.326: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.327: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.327: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.335: buchi has 2 states
pins2lts-mc-linux64( 0/ 8), 0.375: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.517: DFS-FIFO for weak LTL, using special progress label 101
pins2lts-mc-linux64( 0/ 8), 0.517: There are 102 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.517: State length is 170, there are 98 groups
pins2lts-mc-linux64( 0/ 8), 0.517: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.517: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.517: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.517: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.747: ~92 levels ~960 states ~17592 transitions
pins2lts-mc-linux64( 7/ 8), 0.880: ~224 levels ~1920 states ~34744 transitions
pins2lts-mc-linux64( 7/ 8), 0.994: ~451 levels ~3840 states ~62120 transitions
pins2lts-mc-linux64( 7/ 8), 1.104: ~750 levels ~7680 states ~85776 transitions
pins2lts-mc-linux64( 2/ 8), 1.154: ~748 levels ~15360 states ~102152 transitions
pins2lts-mc-linux64( 2/ 8), 1.229: ~748 levels ~30720 states ~138888 transitions
pins2lts-mc-linux64( 2/ 8), 1.428: ~748 levels ~61440 states ~219568 transitions
pins2lts-mc-linux64( 2/ 8), 1.760: ~748 levels ~122880 states ~388272 transitions
pins2lts-mc-linux64( 0/ 8), 2.383: ~754 levels ~245760 states ~710880 transitions
pins2lts-mc-linux64( 0/ 8), 3.304: ~754 levels ~491520 states ~1452424 transitions
pins2lts-mc-linux64( 6/ 8), 4.808: ~744 levels ~983040 states ~2997552 transitions
pins2lts-mc-linux64( 6/ 8), 7.236: ~744 levels ~1966080 states ~6119944 transitions
pins2lts-mc-linux64( 6/ 8), 12.348: ~744 levels ~3932160 states ~12686352 transitions
pins2lts-mc-linux64( 3/ 8), 22.857: ~738 levels ~7864320 states ~26974376 transitions
pins2lts-mc-linux64( 2/ 8), 44.289: ~748 levels ~15728640 states ~57351240 transitions
pins2lts-mc-linux64( 2/ 8), 89.244: ~748 levels ~31457280 states ~119368688 transitions
pins2lts-mc-linux64( 2/ 8), 126.914: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 126.971:
pins2lts-mc-linux64( 0/ 8), 126.971: mean standard work distribution: 1.7% (states) 2.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 126.971:
pins2lts-mc-linux64( 0/ 8), 126.971: Explored 41505817 states 158929989 transitions, fanout: 3.829
pins2lts-mc-linux64( 0/ 8), 126.971: Total exploration time 126.440 sec (126.370 sec minimum, 126.399 sec on average)
pins2lts-mc-linux64( 0/ 8), 126.972: States per second: 328265, Transitions per second: 1256960
pins2lts-mc-linux64( 0/ 8), 126.972:
pins2lts-mc-linux64( 0/ 8), 126.972: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 126.972: Redundant explorations: -0.1762
pins2lts-mc-linux64( 0/ 8), 126.972:
pins2lts-mc-linux64( 0/ 8), 126.972: Queue width: 8B, total height: 5960, memory: 0.05MB
pins2lts-mc-linux64( 0/ 8), 126.972: Tree memory: 573.2MB, 14.5 B/state, compr.: 2.1%
pins2lts-mc-linux64( 0/ 8), 126.972: Tree fill ratio (roots/leafs): 30.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 126.972: Stored 97 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 126.972: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 126.972: Est. total memory use: 573.3MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3890813525817518388;'/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' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3890813525817518388;'/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' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
52526 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,525.276,2976996,1,0,1373,1.80311e+07,9,292,2300,2.11222e+07,2528
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CircularTrains-PT-096-LTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(G(("(gu30.F32<=gu30.Section_19)")||(X(F(("(gu40.F52<=gu40.Section_80)")||(G("(gi3.gu33.F5>=2)")))))))))
Formula 1 simplified : XF(!"(gu30.F32<=gu30.Section_19)" & XG(!"(gu40.F52<=gu40.Section_80)" & F!"(gi3.gu33.F5>=2)"))
Detected timeout of ITS tools.
[2024-05-21 09:49:21] [INFO ] Flatten gal took : 7 ms
[2024-05-21 09:49:21] [INFO ] Time to serialize gal into /tmp/LTLCardinality6402747244805789649.gal : 8 ms
[2024-05-21 09:49:21] [INFO ] Time to serialize properties into /tmp/LTLCardinality13336649339116426868.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6402747244805789649.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13336649339116426868.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((X(G(("(F32<=Section_19)")||(X(F(("(F52<=Section_80)")||(G("(F5>=2)")))))))))
Formula 0 simplified : XF(!"(F32<=Section_19)" & XG(!"(F52<=Section_80)" & F!"(F5>=2)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
122117 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1221.19,5475192,1,0,904,3.6959e+07,20,208,2308,3.9902e+07,1928
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CircularTrains-PT-096-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Total runtime 2951149 ms.
BK_STOP 1716286197481
--------------------
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-096"
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-096, 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-171620505700347"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CircularTrains-PT-096.tgz
mv CircularTrains-PT-096 execution
cd execution
if [ "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 '
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 ;