Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620398900163.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BridgeAndVehicles-PT-V04P05N02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620398900163
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 9.8K Apr 13 01:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 13 01:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 01:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 13 01:48 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 5.0K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 01:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 13 01:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 13 01:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 13 01:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 37K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716325582933

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V04P05N02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 21:06:24] [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 21:06:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:06:24] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2024-05-21 21:06:24] [INFO ] Transformed 28 places.
[2024-05-21 21:06:24] [INFO ] Transformed 52 transitions.
[2024-05-21 21:06:24] [INFO ] Parsed PT model containing 28 places and 52 transitions and 326 arcs in 147 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Applied a total of 0 rules in 8 ms. Remains 28 /28 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Running 49 sub problems to find dead transitions.
[2024-05-21 21:06:24] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2024-05-21 21:06:24] [INFO ] Computed 7 invariants in 27 ms
[2024-05-21 21:06:24] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-21 21:06:25] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 14 ms to minimize.
[2024-05-21 21:06:25] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
[2024-05-21 21:06:25] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 3/8 constraints. Problems are: Problem set: 8 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 8 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 2/28 variables, 2/10 constraints. Problems are: Problem set: 8 solved, 41 unsolved
[2024-05-21 21:06:25] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/11 constraints. Problems are: Problem set: 8 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 8 solved, 41 unsolved
Problem TDEAD4 is UNSAT
Problem TDEAD17 is UNSAT
At refinement iteration 6 (OVERLAPS) 34/62 variables, 28/39 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 6/45 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/45 constraints. Problems are: Problem set: 10 solved, 39 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/45 constraints. Problems are: Problem set: 10 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 45 constraints, problems are : Problem set: 10 solved, 39 unsolved in 1351 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 28/28 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 10 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 5/5 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 3/8 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 2/28 variables, 2/10 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/11 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 34/62 variables, 28/39 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 6/45 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 39/84 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/84 constraints. Problems are: Problem set: 10 solved, 39 unsolved
[2024-05-21 21:06:27] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/62 variables, 1/85 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/62 variables, 0/85 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 12 (OVERLAPS) 0/62 variables, 0/85 constraints. Problems are: Problem set: 10 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 85 constraints, problems are : Problem set: 10 solved, 39 unsolved in 1286 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 28/28 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 39/49 constraints, Known Traps: 5/5 constraints]
After SMT, in 2834ms problems are : Problem set: 10 solved, 39 unsolved
Search for dead transitions found 10 dead transitions in 2848ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 10 transitions.
[2024-05-21 21:06:27] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
// Phase 1: matrix 30 rows 28 cols
[2024-05-21 21:06:27] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 21:06:27] [INFO ] Implicit Places using invariants in 113 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 122 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 27/28 places, 42/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3019 ms. Remains : 27/28 places, 42/52 transitions.
Support contains 17 out of 27 places after structural reductions.
[2024-05-21 21:06:28] [INFO ] Flatten gal took : 66 ms
[2024-05-21 21:06:28] [INFO ] Flatten gal took : 21 ms
[2024-05-21 21:06:28] [INFO ] Input system was already deterministic with 42 transitions.
RANDOM walk for 40000 steps (919 resets) in 1128 ms. (35 steps per ms) remains 3/19 properties
BEST_FIRST walk for 40001 steps (378 resets) in 556 ms. (71 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (399 resets) in 360 ms. (110 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (404 resets) in 233 ms. (170 steps per ms) remains 3/3 properties
[2024-05-21 21:06:28] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
// Phase 1: matrix 30 rows 27 cols
[2024-05-21 21:06:28] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 21:06:28] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 7/10 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 9/19 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/20 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 7 (OVERLAPS) 4/24 variables, 2/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 30/54 variables, 24/31 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/54 variables, 4/35 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/54 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/57 variables, 3/38 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/57 variables, 1/39 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/57 variables, 0/39 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/57 variables, 0/39 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 57/57 variables, and 39 constraints, problems are : Problem set: 2 solved, 1 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/12 variables, 2/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/13 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/18 variables, 2/6 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 18/36 variables, 18/24 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/24 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/52 variables, 4/28 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/52 variables, 1/33 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/52 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/54 variables, 1/34 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/54 variables, 2/36 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/54 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/57 variables, 3/39 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/57 variables, 1/40 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/57 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/57 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 57/57 variables, and 40 constraints, problems are : Problem set: 2 solved, 1 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 266ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 42/42 transitions.
Graph (complete) has 127 edges and 27 vertex of which 25 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 24 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 24 transition count 41
Applied a total of 3 rules in 20 ms. Remains 24 /27 variables (removed 3) and now considering 41/42 (removed 1) transitions.
Running 38 sub problems to find dead transitions.
[2024-05-21 21:06:29] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
// Phase 1: matrix 29 rows 24 cols
[2024-05-21 21:06:29] [INFO ] Computed 6 invariants in 0 ms
[2024-05-21 21:06:29] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-21 21:06:29] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 29/53 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 0/53 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 35 constraints, problems are : Problem set: 0 solved, 38 unsolved in 580 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 29/53 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 38/73 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 73 constraints, problems are : Problem set: 0 solved, 38 unsolved in 523 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints]
After SMT, in 1150ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1152ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1172 ms. Remains : 24/27 places, 41/42 transitions.
RANDOM walk for 40000 steps (918 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (379 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
Probably explored full state space saw : 2874 states, properties seen :0
Probabilistic random walk after 10034 steps, saw 2874 distinct states, run finished after 47 ms. (steps per millisecond=213 ) properties seen :0
Explored full state space saw : 2874 states, properties seen :0
Exhaustive walk after 10034 steps, saw 2874 distinct states, run finished after 18 ms. (steps per millisecond=557 ) properties seen :0
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 18 stabilizing places and 18 stable transitions
Graph (complete) has 184 edges and 27 vertex of which 25 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 42/42 transitions.
Graph (complete) has 184 edges and 27 vertex of which 25 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 24 transition count 41
Applied a total of 3 rules in 22 ms. Remains 24 /27 variables (removed 3) and now considering 41/42 (removed 1) transitions.
Running 38 sub problems to find dead transitions.
[2024-05-21 21:06:30] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
// Phase 1: matrix 29 rows 24 cols
[2024-05-21 21:06:30] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 21:06:30] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-21 21:06:31] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 29/53 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 0/53 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 35 constraints, problems are : Problem set: 0 solved, 38 unsolved in 530 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 29/53 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 38/73 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-21 21:06:31] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 0/53 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 74 constraints, problems are : Problem set: 0 solved, 38 unsolved in 931 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints]
After SMT, in 1521ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1522ms
[2024-05-21 21:06:32] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2024-05-21 21:06:32] [INFO ] Invariant cache hit.
[2024-05-21 21:06:32] [INFO ] Implicit Places using invariants in 115 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 117 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/27 places, 41/42 transitions.
Applied a total of 0 rules in 5 ms. Remains 23 /23 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1667 ms. Remains : 23/27 places, 41/42 transitions.
Stuttering acceptance computed with spot in 328 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLCardinality-04
Product exploration explored 100000 steps with 6307 reset in 406 ms.
Product exploration explored 100000 steps with 6322 reset in 196 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Computed a total of 14 stabilizing places and 17 stable transitions
Detected a total of 14/23 stabilizing places and 17/41 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 46 steps (0 resets) in 5 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
[2024-05-21 21:06:34] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
// Phase 1: matrix 29 rows 23 cols
[2024-05-21 21:06:34] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 21:06:34] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-21 21:06:34] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-21 21:06:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:06:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-21 21:06:34] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-21 21:06:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 21:06:34] [INFO ] [Nat]Added 4 Read/Feed constraints in 6 ms returned sat
[2024-05-21 21:06:34] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:06:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-05-21 21:06:34] [INFO ] Computed and/alt/rep : 22/75/22 causal constraints (skipped 4 transitions) in 2 ms.
[2024-05-21 21:06:34] [INFO ] Added : 16 causal constraints over 4 iterations in 41 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 41/41 transitions.
Applied a total of 0 rules in 3 ms. Remains 23 /23 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Running 38 sub problems to find dead transitions.
[2024-05-21 21:06:34] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2024-05-21 21:06:34] [INFO ] Invariant cache hit.
[2024-05-21 21:06:34] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-21 21:06:34] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 29/52 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 33 constraints, problems are : Problem set: 0 solved, 38 unsolved in 553 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 23/23 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 29/52 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 38/71 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-21 21:06:35] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 72 constraints, problems are : Problem set: 0 solved, 38 unsolved in 640 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 23/23 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints]
After SMT, in 1215ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1216ms
[2024-05-21 21:06:35] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2024-05-21 21:06:35] [INFO ] Invariant cache hit.
[2024-05-21 21:06:35] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 21:06:35] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2024-05-21 21:06:35] [INFO ] Invariant cache hit.
[2024-05-21 21:06:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 21:06:35] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2024-05-21 21:06:35] [INFO ] Redundant transitions in 0 ms returned []
Running 38 sub problems to find dead transitions.
[2024-05-21 21:06:35] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2024-05-21 21:06:35] [INFO ] Invariant cache hit.
[2024-05-21 21:06:35] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-21 21:06:35] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 29/52 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 33 constraints, problems are : Problem set: 0 solved, 38 unsolved in 408 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 23/23 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 29/52 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 38/71 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-21 21:06:36] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 72 constraints, problems are : Problem set: 0 solved, 38 unsolved in 685 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 23/23 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints]
After SMT, in 1113ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1114ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2469 ms. Remains : 23/23 places, 41/41 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Computed a total of 14 stabilizing places and 17 stable transitions
Detected a total of 14/23 stabilizing places and 17/41 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 60 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
[2024-05-21 21:06:37] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2024-05-21 21:06:37] [INFO ] Invariant cache hit.
[2024-05-21 21:06:37] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-21 21:06:37] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-21 21:06:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:06:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-21 21:06:37] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-21 21:06:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 21:06:37] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2024-05-21 21:06:37] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:06:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-05-21 21:06:37] [INFO ] Computed and/alt/rep : 22/75/22 causal constraints (skipped 4 transitions) in 3 ms.
[2024-05-21 21:06:37] [INFO ] Added : 15 causal constraints over 4 iterations in 43 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6311 reset in 111 ms.
Product exploration explored 100000 steps with 6306 reset in 113 ms.
Built C files in :
/tmp/ltsmin357045417002553730
[2024-05-21 21:06:37] [INFO ] Computing symmetric may disable matrix : 41 transitions.
[2024-05-21 21:06:37] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:06:37] [INFO ] Computing symmetric may enable matrix : 41 transitions.
[2024-05-21 21:06:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:06:37] [INFO ] Computing Do-Not-Accords matrix : 41 transitions.
[2024-05-21 21:06:37] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:06:37] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin357045417002553730
Running compilation step : cd /tmp/ltsmin357045417002553730;'/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 453 ms.
Running link step : cd /tmp/ltsmin357045417002553730;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin357045417002553730;'/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/stateBased2681643432489176155.hoa' '--buchi-type=spotba'
LTSmin run took 175 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLCardinality-04 finished in 7987 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(p1))))'
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 42/42 transitions.
Graph (complete) has 184 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 25 transition count 41
Applied a total of 3 rules in 4 ms. Remains 25 /27 variables (removed 2) and now considering 41/42 (removed 1) transitions.
Running 38 sub problems to find dead transitions.
[2024-05-21 21:06:38] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
// Phase 1: matrix 29 rows 25 cols
[2024-05-21 21:06:38] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 21:06:38] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-21 21:06:38] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-21 21:06:39] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 29/54 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/54 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/54 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 38 constraints, problems are : Problem set: 0 solved, 38 unsolved in 656 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 29/54 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/54 variables, 38/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/54 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-21 21:06:39] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/54 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/54 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 13 (OVERLAPS) 0/54 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 77 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1071 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 3/3 constraints]
After SMT, in 1759ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1760ms
[2024-05-21 21:06:40] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2024-05-21 21:06:40] [INFO ] Invariant cache hit.
[2024-05-21 21:06:40] [INFO ] Implicit Places using invariants in 75 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/27 places, 41/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1842 ms. Remains : 24/27 places, 41/42 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLCardinality-07
Stuttering criterion allowed to conclude after 117 steps with 14 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLCardinality-07 finished in 2021 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 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 42/42 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 25 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 24 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 24 transition count 41
Applied a total of 4 rules in 1 ms. Remains 24 /27 variables (removed 3) and now considering 41/42 (removed 1) transitions.
Running 38 sub problems to find dead transitions.
[2024-05-21 21:06:40] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
// Phase 1: matrix 29 rows 24 cols
[2024-05-21 21:06:40] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 21:06:40] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-21 21:06:40] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 29/53 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 0/53 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 35 constraints, problems are : Problem set: 0 solved, 38 unsolved in 507 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 29/53 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 38/73 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 73 constraints, problems are : Problem set: 0 solved, 38 unsolved in 820 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints]
After SMT, in 1346ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1346ms
[2024-05-21 21:06:42] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2024-05-21 21:06:42] [INFO ] Invariant cache hit.
[2024-05-21 21:06:42] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 21:06:42] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2024-05-21 21:06:42] [INFO ] Invariant cache hit.
[2024-05-21 21:06:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 21:06:42] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 38 sub problems to find dead transitions.
[2024-05-21 21:06:42] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2024-05-21 21:06:42] [INFO ] Invariant cache hit.
[2024-05-21 21:06:42] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-21 21:06:42] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 29/53 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-21 21:06:42] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 36 constraints, problems are : Problem set: 0 solved, 38 unsolved in 584 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 29/53 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 38/74 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 74 constraints, problems are : Problem set: 0 solved, 38 unsolved in 478 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints]
After SMT, in 1093ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1094ms
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 41/42 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2571 ms. Remains : 24/27 places, 41/42 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLCardinality-08 finished in 2692 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)&&F(p1))))'
Support contains 4 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 42/42 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 25 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 24 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 24 transition count 41
Applied a total of 4 rules in 2 ms. Remains 24 /27 variables (removed 3) and now considering 41/42 (removed 1) transitions.
Running 38 sub problems to find dead transitions.
[2024-05-21 21:06:43] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2024-05-21 21:06:43] [INFO ] Invariant cache hit.
[2024-05-21 21:06:43] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-21 21:06:43] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 29/53 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-21 21:06:43] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 36 constraints, problems are : Problem set: 0 solved, 38 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 29/53 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 38/74 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 74 constraints, problems are : Problem set: 0 solved, 38 unsolved in 455 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints]
After SMT, in 1036ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1037ms
[2024-05-21 21:06:44] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2024-05-21 21:06:44] [INFO ] Invariant cache hit.
[2024-05-21 21:06:44] [INFO ] Implicit Places using invariants in 56 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/27 places, 41/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1097 ms. Remains : 23/27 places, 41/42 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 72 ms.
Product exploration explored 100000 steps with 50000 reset in 77 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Computed a total of 14 stabilizing places and 17 stable transitions
Detected a total of 14/23 stabilizing places and 17/41 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 30 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLCardinality-09 finished in 1462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F(p0)&&X(p1))))))'
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 42/42 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 42
Applied a total of 1 rules in 1 ms. Remains 26 /27 variables (removed 1) and now considering 42/42 (removed 0) transitions.
Running 39 sub problems to find dead transitions.
[2024-05-21 21:06:44] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
// Phase 1: matrix 30 rows 26 cols
[2024-05-21 21:06:44] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 21:06:44] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-21 21:06:45] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-21 21:06:45] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 30/56 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/56 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 39 constraints, problems are : Problem set: 0 solved, 39 unsolved in 687 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 30/56 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 39/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/56 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-21 21:06:46] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/56 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/56 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 13 (OVERLAPS) 0/56 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 79 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1081 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 3/3 constraints]
After SMT, in 1814ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1815ms
[2024-05-21 21:06:46] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2024-05-21 21:06:46] [INFO ] Invariant cache hit.
[2024-05-21 21:06:46] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-21 21:06:46] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2024-05-21 21:06:46] [INFO ] Invariant cache hit.
[2024-05-21 21:06:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 21:06:46] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 39 sub problems to find dead transitions.
[2024-05-21 21:06:46] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2024-05-21 21:06:46] [INFO ] Invariant cache hit.
[2024-05-21 21:06:46] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-21 21:06:47] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-21 21:06:47] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 30/56 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/56 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 39 constraints, problems are : Problem set: 0 solved, 39 unsolved in 796 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 30/56 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 39/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/56 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 0/56 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 78 constraints, problems are : Problem set: 0 solved, 39 unsolved in 705 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints]
After SMT, in 1520ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1521ms
Starting structural reductions in LTL mode, iteration 1 : 26/27 places, 42/42 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3471 ms. Remains : 26/27 places, 42/42 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLCardinality-10
Product exploration explored 100000 steps with 11324 reset in 119 ms.
Product exploration explored 100000 steps with 11308 reset in 112 ms.
Computed a total of 17 stabilizing places and 18 stable transitions
Graph (complete) has 183 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 18 stable transitions
Detected a total of 17/26 stabilizing places and 18/42 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 240 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
RANDOM walk for 957 steps (21 resets) in 11 ms. (79 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 247 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Running 39 sub problems to find dead transitions.
[2024-05-21 21:06:49] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2024-05-21 21:06:49] [INFO ] Invariant cache hit.
[2024-05-21 21:06:49] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-21 21:06:50] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-21 21:06:50] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 30/56 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/56 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 39 constraints, problems are : Problem set: 0 solved, 39 unsolved in 585 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 30/56 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 39/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/56 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 0/56 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 78 constraints, problems are : Problem set: 0 solved, 39 unsolved in 494 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints]
After SMT, in 1094ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1095ms
[2024-05-21 21:06:51] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2024-05-21 21:06:51] [INFO ] Invariant cache hit.
[2024-05-21 21:06:51] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 21:06:51] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2024-05-21 21:06:51] [INFO ] Invariant cache hit.
[2024-05-21 21:06:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 21:06:51] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 39 sub problems to find dead transitions.
[2024-05-21 21:06:51] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2024-05-21 21:06:51] [INFO ] Invariant cache hit.
[2024-05-21 21:06:51] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-21 21:06:51] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 13 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-21 21:06:51] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 30/56 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/56 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 39 constraints, problems are : Problem set: 0 solved, 39 unsolved in 453 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 30/56 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 39/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/56 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 0/56 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 78 constraints, problems are : Problem set: 0 solved, 39 unsolved in 576 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints]
After SMT, in 1066ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1067ms
Finished structural reductions in LTL mode , in 1 iterations and 2276 ms. Remains : 26/26 places, 42/42 transitions.
Computed a total of 17 stabilizing places and 18 stable transitions
Graph (complete) has 183 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 18 stable transitions
Detected a total of 17/26 stabilizing places and 18/42 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
RANDOM walk for 664 steps (14 resets) in 15 ms. (41 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 308 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 238 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 11319 reset in 209 ms.
Product exploration explored 100000 steps with 11301 reset in 140 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 264 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 42/42 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 42
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 6 ms. Remains 26 /26 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Running 39 sub problems to find dead transitions.
[2024-05-21 21:06:54] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
// Phase 1: matrix 30 rows 26 cols
[2024-05-21 21:06:54] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 21:06:54] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-21 21:06:54] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-21 21:06:55] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Problem TDEAD7 is UNSAT
At refinement iteration 7 (OVERLAPS) 30/56 variables, 26/35 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 4/39 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/56 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 39 constraints, problems are : Problem set: 1 solved, 38 unsolved in 698 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 2/26 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 30/56 variables, 26/35 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 4/39 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 38/77 constraints. Problems are: Problem set: 1 solved, 38 unsolved
[2024-05-21 21:06:55] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/56 variables, 1/78 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/56 variables, 0/78 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 12 (OVERLAPS) 0/56 variables, 0/78 constraints. Problems are: Problem set: 1 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 78 constraints, problems are : Problem set: 1 solved, 38 unsolved in 770 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/39 constraints, Known Traps: 3/3 constraints]
After SMT, in 1490ms problems are : Problem set: 1 solved, 38 unsolved
Search for dead transitions found 1 dead transitions in 1491ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
[2024-05-21 21:06:56] [INFO ] Redundant transitions in 0 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 26/26 places, 41/42 transitions.
Graph (complete) has 181 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 25 /26 variables (removed 1) and now considering 41/41 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/26 places, 41/42 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1506 ms. Remains : 25/26 places, 41/42 transitions.
Built C files in :
/tmp/ltsmin14148729125909791770
[2024-05-21 21:06:56] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14148729125909791770
Running compilation step : cd /tmp/ltsmin14148729125909791770;'/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 208 ms.
Running link step : cd /tmp/ltsmin14148729125909791770;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin14148729125909791770;'/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/stateBased9063099087551485463.hoa' '--buchi-type=spotba'
LTSmin run took 1819 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLCardinality-10 finished in 13362 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||G((p1 U p2))))))'
Support contains 5 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 42/42 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 42
Applied a total of 1 rules in 1 ms. Remains 26 /27 variables (removed 1) and now considering 42/42 (removed 0) transitions.
Running 39 sub problems to find dead transitions.
[2024-05-21 21:06:58] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
// Phase 1: matrix 30 rows 26 cols
[2024-05-21 21:06:58] [INFO ] Computed 7 invariants in 0 ms
[2024-05-21 21:06:58] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-21 21:06:58] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 1/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 30/56 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 38 constraints, problems are : Problem set: 0 solved, 39 unsolved in 502 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 1/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 30/56 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 39/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-21 21:06:59] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/56 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 0/56 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 78 constraints, problems are : Problem set: 0 solved, 39 unsolved in 790 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints]
After SMT, in 1309ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1310ms
[2024-05-21 21:06:59] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2024-05-21 21:06:59] [INFO ] Invariant cache hit.
[2024-05-21 21:06:59] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-21 21:06:59] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2024-05-21 21:06:59] [INFO ] Invariant cache hit.
[2024-05-21 21:06:59] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 21:06:59] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Running 39 sub problems to find dead transitions.
[2024-05-21 21:06:59] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2024-05-21 21:06:59] [INFO ] Invariant cache hit.
[2024-05-21 21:06:59] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-21 21:06:59] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 1/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 30/56 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 38 constraints, problems are : Problem set: 0 solved, 39 unsolved in 5163 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 1/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 30/56 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 39/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-21 21:07:05] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/56 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 0/56 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 78 constraints, problems are : Problem set: 0 solved, 39 unsolved in 757 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints]
After SMT, in 5939ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 5940ms
Starting structural reductions in LTL mode, iteration 1 : 26/27 places, 42/42 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7390 ms. Remains : 26/27 places, 42/42 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLCardinality-11
Product exploration explored 100000 steps with 31773 reset in 126 ms.
Product exploration explored 100000 steps with 31836 reset in 171 ms.
Computed a total of 17 stabilizing places and 18 stable transitions
Graph (complete) has 183 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 18 stable transitions
Detected a total of 17/26 stabilizing places and 18/42 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 933 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (916 resets) in 351 ms. (113 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (301 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
[2024-05-21 21:07:07] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2024-05-21 21:07:07] [INFO ] Invariant cache hit.
[2024-05-21 21:07:07] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 15/56 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 2/6 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/26 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 44ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 p2 p1))]
False Knowledge obtained : [(X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F p1), (F (NOT (AND (OR p0 (NOT p2)) (OR p0 (NOT p1))))), (F (NOT (OR p0 p2 (NOT p1)))), (F p2)]
Knowledge based reduction with 7 factoid took 1132 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 26 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Running 39 sub problems to find dead transitions.
[2024-05-21 21:07:08] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2024-05-21 21:07:08] [INFO ] Invariant cache hit.
[2024-05-21 21:07:08] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-21 21:07:09] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 1/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 30/56 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 38 constraints, problems are : Problem set: 0 solved, 39 unsolved in 2196 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 1/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 30/56 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 39/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-21 21:07:11] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/56 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 0/56 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 78 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints]
After SMT, in 3248ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 3251ms
[2024-05-21 21:07:12] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2024-05-21 21:07:12] [INFO ] Invariant cache hit.
[2024-05-21 21:07:12] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 21:07:12] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2024-05-21 21:07:12] [INFO ] Invariant cache hit.
[2024-05-21 21:07:12] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 21:07:12] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 39 sub problems to find dead transitions.
[2024-05-21 21:07:12] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2024-05-21 21:07:12] [INFO ] Invariant cache hit.
[2024-05-21 21:07:12] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-21 21:07:12] [INFO ] Deduced a trap composed of 5 places in 279 ms of which 27 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 1/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 30/56 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 38 constraints, problems are : Problem set: 0 solved, 39 unsolved in 2623 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 1/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 30/56 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 39/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-21 21:07:15] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/56 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 0/56 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 78 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1007 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints]
After SMT, in 3642ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 3643ms
Finished structural reductions in LTL mode , in 1 iterations and 7002 ms. Remains : 26/26 places, 42/42 transitions.
Computed a total of 17 stabilizing places and 18 stable transitions
Graph (complete) has 183 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 17 stabilizing places and 18 stable transitions
Detected a total of 17/26 stabilizing places and 18/42 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 4 factoid took 476 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 73 steps (1 resets) in 4 ms. (14 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F p2), (F (NOT (OR p0 p2))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 476 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 31746 reset in 79 ms.
Product exploration explored 100000 steps with 31740 reset in 82 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 42/42 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 42
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 4 ms. Remains 26 /26 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Running 39 sub problems to find dead transitions.
[2024-05-21 21:07:17] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
// Phase 1: matrix 30 rows 26 cols
[2024-05-21 21:07:17] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 21:07:17] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-21 21:07:18] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 1/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Problem TDEAD4 is UNSAT
At refinement iteration 6 (OVERLAPS) 30/56 variables, 26/34 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 4/38 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 38 constraints, problems are : Problem set: 1 solved, 38 unsolved in 566 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 2/26 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 30/56 variables, 26/34 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 4/38 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 38/76 constraints. Problems are: Problem set: 1 solved, 38 unsolved
[2024-05-21 21:07:18] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 1/77 constraints. Problems are: Problem set: 1 solved, 38 unsolved
[2024-05-21 21:07:18] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/56 variables, 1/78 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/56 variables, 0/78 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 12 (OVERLAPS) 0/56 variables, 0/78 constraints. Problems are: Problem set: 1 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 78 constraints, problems are : Problem set: 1 solved, 38 unsolved in 735 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/39 constraints, Known Traps: 3/3 constraints]
After SMT, in 1352ms problems are : Problem set: 1 solved, 38 unsolved
Search for dead transitions found 1 dead transitions in 1354ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
[2024-05-21 21:07:19] [INFO ] Redundant transitions in 0 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 26/26 places, 41/42 transitions.
Graph (complete) has 181 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 25 /26 variables (removed 1) and now considering 41/41 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/26 places, 41/42 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1380 ms. Remains : 25/26 places, 41/42 transitions.
Built C files in :
/tmp/ltsmin6116297242820960309
[2024-05-21 21:07:19] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6116297242820960309
Running compilation step : cd /tmp/ltsmin6116297242820960309;'/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 250 ms.
Running link step : cd /tmp/ltsmin6116297242820960309;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin6116297242820960309;'/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/stateBased6269692979896402993.hoa' '--buchi-type=spotba'
LTSmin run took 5880 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLCardinality-11 finished in 27280 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&&(p1||X(G(p1)))))))'
Support contains 5 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 42/42 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 42
Applied a total of 1 rules in 1 ms. Remains 26 /27 variables (removed 1) and now considering 42/42 (removed 0) transitions.
Running 39 sub problems to find dead transitions.
[2024-05-21 21:07:25] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
// Phase 1: matrix 30 rows 26 cols
[2024-05-21 21:07:25] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 21:07:25] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-21 21:07:26] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-21 21:07:28] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 30/56 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/56 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 39 constraints, problems are : Problem set: 0 solved, 39 unsolved in 6658 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 30/56 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 39/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/56 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-21 21:07:32] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/56 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/56 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 13 (OVERLAPS) 0/56 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 79 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1043 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 3/3 constraints]
After SMT, in 7757ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 7757ms
[2024-05-21 21:07:33] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2024-05-21 21:07:33] [INFO ] Invariant cache hit.
[2024-05-21 21:07:33] [INFO ] Implicit Places using invariants in 52 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/27 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7813 ms. Remains : 25/27 places, 42/42 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLCardinality-12
Product exploration explored 100000 steps with 7771 reset in 100 ms.
Product exploration explored 100000 steps with 7768 reset in 114 ms.
Computed a total of 16 stabilizing places and 18 stable transitions
Graph (complete) has 172 edges and 25 vertex of which 24 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 16 stabilizing places and 18 stable transitions
Detected a total of 16/25 stabilizing places and 18/42 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 332 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (AND p0 (NOT p1)), false]
RANDOM walk for 1044 steps (23 resets) in 7 ms. (130 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 847 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (AND p0 (NOT p1)), false]
[2024-05-21 21:07:35] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
// Phase 1: matrix 30 rows 25 cols
[2024-05-21 21:07:35] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 21:07:35] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-21 21:07:35] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-21 21:07:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:07:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-21 21:07:35] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-21 21:07:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 21:07:35] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2024-05-21 21:07:35] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:07:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-05-21 21:07:35] [INFO ] Computed and/alt/rep : 23/79/23 causal constraints (skipped 4 transitions) in 3 ms.
[2024-05-21 21:07:35] [INFO ] Added : 12 causal constraints over 3 iterations in 31 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Running 39 sub problems to find dead transitions.
[2024-05-21 21:07:35] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2024-05-21 21:07:35] [INFO ] Invariant cache hit.
[2024-05-21 21:07:35] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-21 21:07:36] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 30/55 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 36 constraints, problems are : Problem set: 0 solved, 39 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 25/25 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 30/55 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 39/75 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/55 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/55 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 75 constraints, problems are : Problem set: 0 solved, 39 unsolved in 526 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 25/25 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints]
After SMT, in 1051ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1051ms
[2024-05-21 21:07:36] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2024-05-21 21:07:36] [INFO ] Invariant cache hit.
[2024-05-21 21:07:37] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 21:07:37] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2024-05-21 21:07:37] [INFO ] Invariant cache hit.
[2024-05-21 21:07:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 21:07:37] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-21 21:07:37] [INFO ] Redundant transitions in 1 ms returned []
Running 39 sub problems to find dead transitions.
[2024-05-21 21:07:37] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2024-05-21 21:07:37] [INFO ] Invariant cache hit.
[2024-05-21 21:07:37] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-21 21:07:37] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 13 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 30/55 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 36 constraints, problems are : Problem set: 0 solved, 39 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 25/25 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 30/55 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 39/75 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/55 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/55 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 75 constraints, problems are : Problem set: 0 solved, 39 unsolved in 583 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 25/25 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints]
After SMT, in 1061ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1063ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2241 ms. Remains : 25/25 places, 42/42 transitions.
Computed a total of 16 stabilizing places and 18 stable transitions
Graph (complete) has 172 edges and 25 vertex of which 24 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 16 stabilizing places and 18 stable transitions
Detected a total of 16/25 stabilizing places and 18/42 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 392 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (AND p0 (NOT p1)), false]
RANDOM walk for 975 steps (21 resets) in 6 ms. (139 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 15 factoid took 911 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (AND p0 (NOT p1)), false]
[2024-05-21 21:07:40] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2024-05-21 21:07:40] [INFO ] Invariant cache hit.
[2024-05-21 21:07:40] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-21 21:07:40] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-21 21:07:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:07:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-21 21:07:40] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-21 21:07:40] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 21:07:40] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-05-21 21:07:40] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:07:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-21 21:07:40] [INFO ] Computed and/alt/rep : 23/79/23 causal constraints (skipped 4 transitions) in 3 ms.
[2024-05-21 21:07:40] [INFO ] Added : 12 causal constraints over 3 iterations in 22 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (AND p0 (NOT p1)), false]
Product exploration explored 100000 steps with 7804 reset in 101 ms.
Product exploration explored 100000 steps with 7745 reset in 118 ms.
Built C files in :
/tmp/ltsmin17478817358060968436
[2024-05-21 21:07:41] [INFO ] Computing symmetric may disable matrix : 42 transitions.
[2024-05-21 21:07:41] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:07:41] [INFO ] Computing symmetric may enable matrix : 42 transitions.
[2024-05-21 21:07:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:07:41] [INFO ] Computing Do-Not-Accords matrix : 42 transitions.
[2024-05-21 21:07:41] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:07:41] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17478817358060968436
Running compilation step : cd /tmp/ltsmin17478817358060968436;'/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 180 ms.
Running link step : cd /tmp/ltsmin17478817358060968436;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin17478817358060968436;'/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/stateBased16389957836798605017.hoa' '--buchi-type=spotba'
LTSmin run took 180 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLCardinality-12 finished in 15957 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 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 42/42 transitions.
Graph (complete) has 184 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 25 transition count 41
Applied a total of 3 rules in 3 ms. Remains 25 /27 variables (removed 2) and now considering 41/42 (removed 1) transitions.
Running 38 sub problems to find dead transitions.
[2024-05-21 21:07:41] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
// Phase 1: matrix 29 rows 25 cols
[2024-05-21 21:07:41] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 21:07:41] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-21 21:07:41] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 1/25 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-21 21:07:41] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 29/54 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/54 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/54 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 38 constraints, problems are : Problem set: 0 solved, 38 unsolved in 590 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 1/25 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 29/54 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/54 variables, 38/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/54 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 0/54 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 76 constraints, problems are : Problem set: 0 solved, 38 unsolved in 540 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints]
After SMT, in 1144ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1144ms
[2024-05-21 21:07:42] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2024-05-21 21:07:42] [INFO ] Invariant cache hit.
[2024-05-21 21:07:42] [INFO ] Implicit Places using invariants in 38 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/27 places, 41/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1188 ms. Remains : 24/27 places, 41/42 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLCardinality-14
Product exploration explored 100000 steps with 2592 reset in 85 ms.
Product exploration explored 100000 steps with 2591 reset in 97 ms.
Computed a total of 15 stabilizing places and 17 stable transitions
Graph (complete) has 170 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 15 stabilizing places and 17 stable transitions
Detected a total of 15/24 stabilizing places and 17/41 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 132 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 54 ms :[(NOT p0)]
RANDOM walk for 5687 steps (144 resets) in 10 ms. (517 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 151 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 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Running 38 sub problems to find dead transitions.
[2024-05-21 21:07:43] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
// Phase 1: matrix 29 rows 24 cols
[2024-05-21 21:07:43] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 21:07:43] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-21 21:07:43] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-21 21:07:43] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 29/53 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 0/53 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 36 constraints, problems are : Problem set: 0 solved, 38 unsolved in 728 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 29/53 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 38/74 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/53 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-21 21:07:44] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 4 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/53 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/53 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (OVERLAPS) 0/53 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 75 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1103 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 3/3 constraints]
After SMT, in 1856ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1857ms
[2024-05-21 21:07:45] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2024-05-21 21:07:45] [INFO ] Invariant cache hit.
[2024-05-21 21:07:45] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-21 21:07:45] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2024-05-21 21:07:45] [INFO ] Invariant cache hit.
[2024-05-21 21:07:45] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 21:07:45] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2024-05-21 21:07:45] [INFO ] Redundant transitions in 0 ms returned []
Running 38 sub problems to find dead transitions.
[2024-05-21 21:07:45] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2024-05-21 21:07:45] [INFO ] Invariant cache hit.
[2024-05-21 21:07:45] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-21 21:07:45] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-21 21:07:45] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 29/53 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 0/53 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 36 constraints, problems are : Problem set: 0 solved, 38 unsolved in 774 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 29/53 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 38/74 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/53 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-21 21:07:46] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 17 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/53 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/53 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (OVERLAPS) 0/53 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 75 constraints, problems are : Problem set: 0 solved, 38 unsolved in 2743 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 3/3 constraints]
After SMT, in 3537ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 3538ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5532 ms. Remains : 24/24 places, 41/41 transitions.
Computed a total of 15 stabilizing places and 17 stable transitions
Graph (complete) has 170 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 15 stabilizing places and 17 stable transitions
Detected a total of 15/24 stabilizing places and 17/41 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 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 64 ms :[(NOT p0)]
RANDOM walk for 10934 steps (279 resets) in 36 ms. (295 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 200 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 59 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2593 reset in 137 ms.
Product exploration explored 100000 steps with 2589 reset in 201 ms.
Built C files in :
/tmp/ltsmin3946254422465862303
[2024-05-21 21:07:49] [INFO ] Computing symmetric may disable matrix : 41 transitions.
[2024-05-21 21:07:49] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:07:49] [INFO ] Computing symmetric may enable matrix : 41 transitions.
[2024-05-21 21:07:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:07:49] [INFO ] Computing Do-Not-Accords matrix : 41 transitions.
[2024-05-21 21:07:49] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:07:49] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3946254422465862303
Running compilation step : cd /tmp/ltsmin3946254422465862303;'/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 226 ms.
Running link step : cd /tmp/ltsmin3946254422465862303;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin3946254422465862303;'/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/stateBased4520196667527813046.hoa' '--buchi-type=spotba'
LTSmin run took 431 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLCardinality-14 finished in 9207 ms.
All properties solved by simple procedures.
Total runtime 86288 ms.

BK_STOP 1716325670773

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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="BridgeAndVehicles-PT-V04P05N02"
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 BridgeAndVehicles-PT-V04P05N02, 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 r048-tajo-171620398900163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V04P05N02.tgz
mv BridgeAndVehicles-PT-V04P05N02 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;