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.r047-tajo-171620397800251.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 greatspnxred
Input is BridgeAndVehicles-PT-V50P50N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397800251
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.2M
-rw-r--r-- 1 mcc users 18K Apr 13 02:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 13 02:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 129K Apr 13 02:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 529K Apr 13 02:26 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 7.4K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 77K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 227K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 44K Apr 13 02:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 264K Apr 13 02:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 133K Apr 13 02:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 514K Apr 13 02:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.7K Apr 22 14:30 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 1.1M 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-V50P50N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716288319694

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P50N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 10:45:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 10:45:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 10:45:21] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2024-05-21 10:45:21] [INFO ] Transformed 128 places.
[2024-05-21 10:45:21] [INFO ] Transformed 1328 transitions.
[2024-05-21 10:45:21] [INFO ] Parsed PT model containing 128 places and 1328 transitions and 10010 arcs in 297 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 50 ms. Remains 128 /128 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Running 1325 sub problems to find dead transitions.
[2024-05-21 10:45:21] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2024-05-21 10:45:21] [INFO ] Computed 7 invariants in 22 ms
[2024-05-21 10:45:21] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
[2024-05-21 10:45:33] [INFO ] Deduced a trap composed of 5 places in 246 ms of which 8 ms to minimize.
[2024-05-21 10:45:37] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 1 ms to minimize.
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
[2024-05-21 10:45:41] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 2 ms to minimize.
Problem TDEAD178 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD717 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 3/8 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/378 variables, and 8 constraints, problems are : Problem set: 100 solved, 1225 unsolved in 20075 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/128 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1325/1325 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 3/8 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 2/10 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
[2024-05-21 10:46:00] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 1/11 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 128/378 variables, and 11 constraints, problems are : Problem set: 100 solved, 1225 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/128 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/1325 constraints, Known Traps: 4/4 constraints]
After SMT, in 46621ms problems are : Problem set: 100 solved, 1225 unsolved
Search for dead transitions found 100 dead transitions in 46673ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 100 transitions.
[2024-05-21 10:46:08] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 128 cols
[2024-05-21 10:46:08] [INFO ] Computed 7 invariants in 10 ms
[2024-05-21 10:46:08] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-21 10:46:08] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2024-05-21 10:46:08] [INFO ] Invariant cache hit.
[2024-05-21 10:46:08] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:46:09] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 128/128 places, 1228/1328 transitions.
Applied a total of 0 rules in 17 ms. Remains 128 /128 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47492 ms. Remains : 128/128 places, 1228/1328 transitions.
Support contains 19 out of 128 places after structural reductions.
[2024-05-21 10:46:09] [INFO ] Flatten gal took : 156 ms
[2024-05-21 10:46:09] [INFO ] Flatten gal took : 82 ms
[2024-05-21 10:46:09] [INFO ] Input system was already deterministic with 1228 transitions.
RANDOM walk for 40000 steps (88 resets) in 2342 ms. (17 steps per ms) remains 3/20 properties
BEST_FIRST walk for 40003 steps (33 resets) in 370 ms. (107 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (32 resets) in 257 ms. (155 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (28 resets) in 233 ms. (170 steps per ms) remains 3/3 properties
[2024-05-21 10:46:10] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2024-05-21 10:46:10] [INFO ] Invariant cache hit.
[2024-05-21 10:46:10] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp13 is UNSAT
At refinement iteration 1 (OVERLAPS) 57/63 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/66 variables, 1/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 248/314 variables, 66/71 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 20/91 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/91 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 62/376 variables, 62/153 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 2/155 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/155 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/376 variables, 0/155 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 155 constraints, problems are : Problem set: 2 solved, 1 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 20/20 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/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/60 variables, 2/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/264 variables, 60/64 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 0/64 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 99/363 variables, 55/119 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 1/120 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 20/140 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 1/141 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/363 variables, 0/141 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/365 variables, 1/142 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/365 variables, 2/144 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/365 variables, 0/144 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/376 variables, 11/155 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/376 variables, 1/156 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/376 variables, 0/156 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/376 variables, 0/156 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 156 constraints, problems are : Problem set: 2 solved, 1 unsolved in 625 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 987ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 139 ms.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 1220 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 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 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 125 transition count 1227
Applied a total of 3 rules in 177 ms. Remains 125 /128 variables (removed 3) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-05-21 10:46:12] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2024-05-21 10:46:12] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 10:46:12] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-21 10:46:22] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
SMT process timed out in 25495ms, After SMT, problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 25520ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25702 ms. Remains : 125/128 places, 1227/1228 transitions.
RANDOM walk for 40002 steps (88 resets) in 445 ms. (89 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (32 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 432581 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :0 out of 1
Probabilistic random walk after 432581 steps, saw 118225 distinct states, run finished after 3009 ms. (steps per millisecond=143 ) properties seen :0
[2024-05-21 10:46:40] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2024-05-21 10:46:41] [INFO ] Invariant cache hit.
[2024-05-21 10:46:41] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 152/205 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 153/358 variables, 58/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/360 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/372 variables, 12/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/372 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/372 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/372 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 152/205 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 153/358 variables, 58/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/360 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/372 variables, 12/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/372 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/372 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/372 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 643 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 957ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 131 ms.
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1227/1227 transitions.
Applied a total of 0 rules in 66 ms. Remains 125 /125 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 125/125 places, 1227/1227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1227/1227 transitions.
Applied a total of 0 rules in 67 ms. Remains 125 /125 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
[2024-05-21 10:46:42] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2024-05-21 10:46:42] [INFO ] Invariant cache hit.
[2024-05-21 10:46:42] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-21 10:46:42] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2024-05-21 10:46:42] [INFO ] Invariant cache hit.
[2024-05-21 10:46:42] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:46:43] [INFO ] Implicit Places using invariants and state equation in 783 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1110 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 123/125 places, 1227/1227 transitions.
Applied a total of 0 rules in 62 ms. Remains 123 /123 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1240 ms. Remains : 123/125 places, 1227/1227 transitions.
RANDOM walk for 40000 steps (88 resets) in 353 ms. (112 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (32 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 529137 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :0 out of 1
Probabilistic random walk after 529137 steps, saw 144497 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
[2024-05-21 10:46:46] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 123 cols
[2024-05-21 10:46:46] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 10:46:46] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 152/205 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/356 variables, 56/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/358 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/370 variables, 12/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/370 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/370 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 152/205 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/356 variables, 56/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/358 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/370 variables, 12/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/370 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 149 constraints, problems are : Problem set: 0 solved, 1 unsolved in 448 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 708ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 66 ms.
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1227/1227 transitions.
Applied a total of 0 rules in 73 ms. Remains 123 /123 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 123/123 places, 1227/1227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1227/1227 transitions.
Applied a total of 0 rules in 70 ms. Remains 123 /123 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
[2024-05-21 10:46:47] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2024-05-21 10:46:47] [INFO ] Invariant cache hit.
[2024-05-21 10:46:47] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-21 10:46:47] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2024-05-21 10:46:47] [INFO ] Invariant cache hit.
[2024-05-21 10:46:47] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:46:48] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
[2024-05-21 10:46:48] [INFO ] Redundant transitions in 70 ms returned []
Running 1224 sub problems to find dead transitions.
[2024-05-21 10:46:48] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2024-05-21 10:46:48] [INFO ] Invariant cache hit.
[2024-05-21 10:46:48] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-21 10:46:58] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/370 variables, 123/129 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/149 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/370 variables, and 149 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 247/370 variables, 123/129 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/149 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 1222/1371 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1371 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1224 constraints, Known Traps: 1/1 constraints]
After SMT, in 65534ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 65552ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 123/123 places, 1225/1227 transitions.
Applied a total of 0 rules in 69 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-05-21 10:47:53] [INFO ] Redundant transitions in 22 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 66543 ms. Remains : 123/123 places, 1225/1227 transitions.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 111 stabilizing places and 204 stable transitions
Graph (complete) has 2645 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.14 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(p0))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1228
Applied a total of 2 rules in 12 ms. Remains 126 /128 variables (removed 2) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2024-05-21 10:47:54] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 126 cols
[2024-05-21 10:47:54] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 10:47:54] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
[2024-05-21 10:48:03] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 3 (OVERLAPS) 248/374 variables, 126/132 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
SMT process timed out in 25421ms, After SMT, problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 25436ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 10:48:19] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 126 cols
[2024-05-21 10:48:19] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 10:48:19] [INFO ] Implicit Places using invariants in 207 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 230 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/128 places, 1226/1228 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25688 ms. Remains : 125/128 places, 1226/1228 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 9 steps with 4 reset in 2 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLCardinality-01 finished in 25961 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G(p1)))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 126 transition count 1227
Applied a total of 3 rules in 111 ms. Remains 126 /128 variables (removed 2) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-05-21 10:48:20] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 126 cols
[2024-05-21 10:48:20] [INFO ] Computed 6 invariants in 4 ms
[2024-05-21 10:48:20] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-21 10:48:28] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/373 variables, and 7 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 5 (OVERLAPS) 247/373 variables, 126/133 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 20/153 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/373 variables, and 1375 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 21595 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1224 constraints, Known Traps: 1/1 constraints]
After SMT, in 46641ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 46653ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 10:49:06] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 126 cols
[2024-05-21 10:49:06] [INFO ] Computed 8 invariants in 5 ms
[2024-05-21 10:49:07] [INFO ] Implicit Places using invariants in 264 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 266 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/128 places, 1225/1228 transitions.
Applied a total of 0 rules in 57 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 47092 ms. Remains : 125/128 places, 1225/1228 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 173 steps with 0 reset in 6 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLCardinality-02 finished in 47311 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)||G(p1))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 80 ms. Remains 127 /128 variables (removed 1) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2024-05-21 10:49:07] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 127 cols
[2024-05-21 10:49:07] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 10:49:07] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
[2024-05-21 10:49:16] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 127/375 variables, and 7 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/127 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 5 (OVERLAPS) 248/375 variables, 127/134 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 20/154 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 375/375 variables, and 1377 constraints, problems are : Problem set: 2 solved, 1223 unsolved in 22015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 127/127 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1225 constraints, Known Traps: 1/1 constraints]
After SMT, in 47371ms problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 47385ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 10:49:54] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 127 cols
[2024-05-21 10:49:54] [INFO ] Computed 8 invariants in 3 ms
[2024-05-21 10:49:55] [INFO ] Implicit Places using invariants in 331 ms returned [52, 109]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 335 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/128 places, 1226/1228 transitions.
Applied a total of 0 rules in 71 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 47876 ms. Remains : 125/128 places, 1226/1228 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLCardinality-04
Stuttering criterion allowed to conclude after 421 steps with 0 reset in 10 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLCardinality-04 finished in 47970 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 U (p1||G(p0))))))'
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 126 transition count 1227
Applied a total of 3 rules in 124 ms. Remains 126 /128 variables (removed 2) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-05-21 10:49:55] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 126 cols
[2024-05-21 10:49:55] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 10:49:55] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-21 10:50:05] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/373 variables, and 7 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-21 10:50:30] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 126/373 variables, and 8 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1224 constraints, Known Traps: 2/2 constraints]
After SMT, in 45742ms problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 45756ms
[2024-05-21 10:50:41] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2024-05-21 10:50:41] [INFO ] Invariant cache hit.
[2024-05-21 10:50:41] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-21 10:50:41] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2024-05-21 10:50:41] [INFO ] Invariant cache hit.
[2024-05-21 10:50:41] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:50:41] [INFO ] Implicit Places using invariants and state equation in 446 ms returned [52, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 628 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/128 places, 1227/1228 transitions.
Applied a total of 0 rules in 56 ms. Remains 124 /124 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 46567 ms. Remains : 124/128 places, 1227/1228 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLCardinality-05
Product exploration explored 100000 steps with 4048 reset in 546 ms.
Product exploration explored 100000 steps with 4000 reset in 395 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Graph (complete) has 2434 edges and 124 vertex of which 123 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 290 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 42 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 420 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1227/1227 transitions.
Applied a total of 0 rules in 55 ms. Remains 124 /124 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Running 1224 sub problems to find dead transitions.
[2024-05-21 10:50:44] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 124 cols
[2024-05-21 10:50:44] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 10:50:44] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-21 10:50:52] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/370 variables, 123/129 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
SMT process timed out in 24916ms, After SMT, problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 24929ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 10:51:09] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 124 cols
[2024-05-21 10:51:09] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 10:51:09] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-21 10:51:09] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:51:09] [INFO ] Invariant cache hit.
[2024-05-21 10:51:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:51:09] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
[2024-05-21 10:51:09] [INFO ] Redundant transitions in 13 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 124/124 places, 1225/1227 transitions.
Applied a total of 0 rules in 55 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25681 ms. Remains : 124/124 places, 1225/1227 transitions.
Computed a total of 107 stabilizing places and 201 stable transitions
Graph (complete) has 2430 edges and 124 vertex of which 123 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 107 stabilizing places and 201 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 357 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 115 steps (0 resets) in 4 ms. (23 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 328 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3887 reset in 375 ms.
Product exploration explored 100000 steps with 3913 reset in 363 ms.
Support contains 5 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1225/1225 transitions.
Applied a total of 0 rules in 54 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:51:11] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:51:11] [INFO ] Invariant cache hit.
[2024-05-21 10:51:11] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:51:20] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 7 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20056 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:51:46] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 124/369 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1222 constraints, Known Traps: 2/2 constraints]
After SMT, in 45287ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45299ms
[2024-05-21 10:51:56] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:51:56] [INFO ] Invariant cache hit.
[2024-05-21 10:51:56] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-21 10:51:56] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:51:56] [INFO ] Invariant cache hit.
[2024-05-21 10:51:57] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:51:57] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
[2024-05-21 10:51:57] [INFO ] Redundant transitions in 13 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:51:57] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:51:57] [INFO ] Invariant cache hit.
[2024-05-21 10:51:57] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:52:05] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:52:24] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 6 (OVERLAPS) 245/369 variables, 124/132 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1222/1374 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 1374 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
After SMT, in 65094ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65106ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 111032 ms. Remains : 124/124 places, 1225/1225 transitions.
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLCardinality-05 finished in 187199 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 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 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 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 125 transition count 1227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 1226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 121 transition count 1224
Applied a total of 10 rules in 105 ms. Remains 121 /128 variables (removed 7) and now considering 1224/1228 (removed 4) transitions.
[2024-05-21 10:53:02] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
// Phase 1: matrix 244 rows 121 cols
[2024-05-21 10:53:02] [INFO ] Computed 4 invariants in 4 ms
[2024-05-21 10:53:03] [INFO ] Implicit Places using invariants in 967 ms returned []
[2024-05-21 10:53:03] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
[2024-05-21 10:53:03] [INFO ] Invariant cache hit.
[2024-05-21 10:53:03] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:53:04] [INFO ] Implicit Places using invariants and state equation in 493 ms returned [52, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1468 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/128 places, 1224/1228 transitions.
Applied a total of 0 rules in 46 ms. Remains 119 /119 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1631 ms. Remains : 119/128 places, 1224/1228 transitions.
Stuttering acceptance computed with spot in 68 ms :[p0, p0]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLCardinality-06
Product exploration explored 100000 steps with 678 reset in 289 ms.
Product exploration explored 100000 steps with 679 reset in 309 ms.
Computed a total of 104 stabilizing places and 202 stable transitions
Computed a total of 104 stabilizing places and 202 stable transitions
Detected a total of 104/119 stabilizing places and 202/1224 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 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[p0, p0]
RANDOM walk for 556 steps (0 resets) in 9 ms. (55 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 112 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 56 ms :[p0, p0]
Stuttering acceptance computed with spot in 66 ms :[p0, p0]
[2024-05-21 10:53:05] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
// Phase 1: matrix 244 rows 119 cols
[2024-05-21 10:53:05] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 10:53:05] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 10:53:06] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2024-05-21 10:53:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:53:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-21 10:53:06] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-05-21 10:53:06] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:53:08] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-21 10:53:09] [INFO ] [Nat]Added 20 Read/Feed constraints in 3020 ms returned unknown
Could not prove EG p0
Support contains 1 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 1224/1224 transitions.
Applied a total of 0 rules in 46 ms. Remains 119 /119 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-05-21 10:53:09] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
[2024-05-21 10:53:09] [INFO ] Invariant cache hit.
[2024-05-21 10:53:09] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-21 10:53:09] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
[2024-05-21 10:53:09] [INFO ] Invariant cache hit.
[2024-05-21 10:53:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:53:10] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
[2024-05-21 10:53:10] [INFO ] Redundant transitions in 12 ms returned []
Running 1221 sub problems to find dead transitions.
[2024-05-21 10:53:10] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
[2024-05-21 10:53:10] [INFO ] Invariant cache hit.
[2024-05-21 10:53:10] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1221 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD101 is UNSAT
At refinement iteration 2 (OVERLAPS) 244/363 variables, 119/123 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 20/143 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
[2024-05-21 10:53:39] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 1/144 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/363 variables, and 144 constraints, problems are : Problem set: 2 solved, 1219 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1221/1221 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 1/5 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 3 (OVERLAPS) 244/363 variables, 119/124 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 20/144 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 1219/1363 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 363/363 variables, and 1363 constraints, problems are : Problem set: 2 solved, 1219 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1219/1221 constraints, Known Traps: 1/1 constraints]
After SMT, in 63876ms problems are : Problem set: 2 solved, 1219 unsolved
Search for dead transitions found 2 dead transitions in 63900ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 119/119 places, 1222/1224 transitions.
Applied a total of 0 rules in 46 ms. Remains 119 /119 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2024-05-21 10:54:14] [INFO ] Redundant transitions in 12 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 64722 ms. Remains : 119/119 places, 1222/1224 transitions.
Computed a total of 104 stabilizing places and 200 stable transitions
Computed a total of 104 stabilizing places and 200 stable transitions
Detected a total of 104/119 stabilizing places and 200/1222 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 143 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 52 ms :[p0, p0]
RANDOM walk for 602 steps (0 resets) in 7 ms. (75 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 103 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 54 ms :[p0, p0]
Stuttering acceptance computed with spot in 60 ms :[p0, p0]
[2024-05-21 10:54:14] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
// Phase 1: matrix 242 rows 119 cols
[2024-05-21 10:54:14] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 10:54:15] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 10:54:15] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2024-05-21 10:54:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:54:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2024-05-21 10:54:15] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-21 10:54:15] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:54:15] [INFO ] [Nat]Added 20 Read/Feed constraints in 26 ms returned sat
[2024-05-21 10:54:17] [INFO ] Deduced a trap composed of 13 places in 1205 ms of which 1 ms to minimize.
[2024-05-21 10:54:17] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 1 ms to minimize.
[2024-05-21 10:54:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1432 ms
[2024-05-21 10:54:17] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 131 transitions) in 68 ms.
[2024-05-21 10:54:17] [INFO ] Added : 51 causal constraints over 11 iterations in 552 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 79 ms :[p0, p0]
Product exploration explored 100000 steps with 682 reset in 270 ms.
Product exploration explored 100000 steps with 676 reset in 284 ms.
Support contains 1 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 1222/1222 transitions.
Applied a total of 0 rules in 49 ms. Remains 119 /119 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2024-05-21 10:54:18] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-05-21 10:54:18] [INFO ] Invariant cache hit.
[2024-05-21 10:54:18] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-21 10:54:18] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-05-21 10:54:18] [INFO ] Invariant cache hit.
[2024-05-21 10:54:18] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:54:19] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
[2024-05-21 10:54:19] [INFO ] Redundant transitions in 11 ms returned []
Running 1219 sub problems to find dead transitions.
[2024-05-21 10:54:19] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-05-21 10:54:19] [INFO ] Invariant cache hit.
[2024-05-21 10:54:19] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 2 (OVERLAPS) 242/361 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/361 variables, and 143 constraints, problems are : Problem set: 0 solved, 1219 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1219/1219 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 2 (OVERLAPS) 242/361 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 1219/1362 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/361 variables, and 1362 constraints, problems are : Problem set: 0 solved, 1219 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1219/1219 constraints, Known Traps: 0/0 constraints]
After SMT, in 64793ms problems are : Problem set: 0 solved, 1219 unsolved
Search for dead transitions found 0 dead transitions in 64804ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65580 ms. Remains : 119/119 places, 1222/1222 transitions.
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLCardinality-06 finished in 141541 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((X(X(p0)) U (p1 U p2))))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 125 transition count 1227
Applied a total of 3 rules in 111 ms. Remains 125 /128 variables (removed 3) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-05-21 10:55:24] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2024-05-21 10:55:24] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 10:55:24] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-21 10:55:33] [INFO ] Deduced a trap composed of 5 places in 198 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/372 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/151 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1373 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 21302 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1224 constraints, Known Traps: 1/1 constraints]
After SMT, in 46346ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 46368ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 10:56:10] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 125 cols
[2024-05-21 10:56:10] [INFO ] Computed 7 invariants in 4 ms
[2024-05-21 10:56:10] [INFO ] Implicit Places using invariants in 282 ms returned [107]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 284 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/128 places, 1225/1228 transitions.
Applied a total of 0 rules in 50 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 46817 ms. Remains : 124/128 places, 1225/1228 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLCardinality-09
Product exploration explored 100000 steps with 25950 reset in 531 ms.
Product exploration explored 100000 steps with 25982 reset in 544 ms.
Computed a total of 107 stabilizing places and 201 stable transitions
Computed a total of 107 stabilizing places and 201 stable transitions
Detected a total of 107/124 stabilizing places and 201/1225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
Knowledge based reduction with 9 factoid took 994 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 889 steps (0 resets) in 14 ms. (59 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F p0), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (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 9 factoid took 1463 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2024-05-21 10:56:15] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 124 cols
[2024-05-21 10:56:15] [INFO ] Computed 6 invariants in 3 ms
[2024-05-21 10:56:15] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-21 10:56:15] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2024-05-21 10:56:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:56:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-21 10:56:16] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-05-21 10:56:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:56:16] [INFO ] [Nat]Added 20 Read/Feed constraints in 67 ms returned sat
[2024-05-21 10:56:16] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 47 ms.
[2024-05-21 10:56:16] [INFO ] Added : 11 causal constraints over 3 iterations in 187 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1225/1225 transitions.
Applied a total of 0 rules in 63 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:56:16] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:56:16] [INFO ] Invariant cache hit.
[2024-05-21 10:56:16] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:56:25] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 7 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/369 variables, 124/131 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 1222/1373 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 44059ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 44073ms
[2024-05-21 10:57:00] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:57:00] [INFO ] Invariant cache hit.
[2024-05-21 10:57:00] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-21 10:57:00] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:57:00] [INFO ] Invariant cache hit.
[2024-05-21 10:57:01] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:57:01] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
[2024-05-21 10:57:01] [INFO ] Redundant transitions in 13 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:57:01] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:57:01] [INFO ] Invariant cache hit.
[2024-05-21 10:57:01] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:57:10] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/369 variables, 124/131 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:57:32] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 369/369 variables, and 152 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/369 variables, 124/132 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 1222/1374 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 1374 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
After SMT, in 65129ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65141ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 110035 ms. Remains : 124/124 places, 1225/1225 transitions.
Computed a total of 107 stabilizing places and 201 stable transitions
Computed a total of 107 stabilizing places and 201 stable transitions
Detected a total of 107/124 stabilizing places and 201/1225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p1)), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 11 factoid took 936 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 1603 steps (2 resets) in 40 ms. (39 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p1)), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (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 11 factoid took 1501 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(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))]
[2024-05-21 10:58:09] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:58:09] [INFO ] Invariant cache hit.
[2024-05-21 10:58:09] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-05-21 10:58:10] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2024-05-21 10:58:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:58:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-21 10:58:10] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2024-05-21 10:58:10] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:58:10] [INFO ] [Nat]Added 20 Read/Feed constraints in 114 ms returned sat
[2024-05-21 10:58:10] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 51 ms.
[2024-05-21 10:58:11] [INFO ] Added : 36 causal constraints over 8 iterations in 348 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 24969 reset in 790 ms.
Product exploration explored 100000 steps with 24881 reset in 608 ms.
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1225/1225 transitions.
Applied a total of 0 rules in 63 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:58:12] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:58:12] [INFO ] Invariant cache hit.
[2024-05-21 10:58:12] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:58:23] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 7 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/369 variables, 124/131 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20208 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 46186ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 46202ms
[2024-05-21 10:58:59] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:58:59] [INFO ] Invariant cache hit.
[2024-05-21 10:58:59] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-21 10:58:59] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:58:59] [INFO ] Invariant cache hit.
[2024-05-21 10:58:59] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:58:59] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
[2024-05-21 10:58:59] [INFO ] Redundant transitions in 12 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-21 10:58:59] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 10:58:59] [INFO ] Invariant cache hit.
[2024-05-21 10:58:59] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:59:09] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/369 variables, 124/131 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 10:59:33] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 369/369 variables, and 152 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/369 variables, 124/132 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 1222/1374 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 1374 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
After SMT, in 65430ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65441ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 112524 ms. Remains : 124/124 places, 1225/1225 transitions.
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLCardinality-09 finished in 281178 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 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 125 transition count 1227
Applied a total of 3 rules in 70 ms. Remains 125 /128 variables (removed 3) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-05-21 11:00:05] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2024-05-21 11:00:05] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 11:00:05] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-21 11:00:15] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/372 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/151 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1373 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 21324 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1224 constraints, Known Traps: 1/1 constraints]
After SMT, in 46749ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 46767ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 11:00:52] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 125 cols
[2024-05-21 11:00:52] [INFO ] Computed 7 invariants in 3 ms
[2024-05-21 11:00:52] [INFO ] Implicit Places using invariants in 301 ms returned [52, 107]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 304 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/128 places, 1225/1228 transitions.
Applied a total of 0 rules in 59 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 47206 ms. Remains : 123/128 places, 1225/1228 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLCardinality-10
Product exploration explored 100000 steps with 1724 reset in 333 ms.
Product exploration explored 100000 steps with 1747 reset in 341 ms.
Computed a total of 106 stabilizing places and 201 stable transitions
Computed a total of 106 stabilizing places and 201 stable transitions
Detected a total of 106/123 stabilizing places and 201/1225 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 100 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 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 285 steps (0 resets) in 4 ms. (57 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 105 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 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
[2024-05-21 11:00:53] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 123 cols
[2024-05-21 11:00:53] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 11:00:54] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 11:00:54] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2024-05-21 11:00:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:00:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 11:00:54] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-21 11:00:54] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 11:00:54] [INFO ] [Nat]Added 20 Read/Feed constraints in 51 ms returned sat
[2024-05-21 11:00:54] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 47 ms.
[2024-05-21 11:00:55] [INFO ] Added : 59 causal constraints over 12 iterations in 804 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 60 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-05-21 11:00:55] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 11:00:55] [INFO ] Invariant cache hit.
[2024-05-21 11:00:55] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 11:01:05] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 45596ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45615ms
[2024-05-21 11:01:41] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 11:01:41] [INFO ] Invariant cache hit.
[2024-05-21 11:01:41] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-21 11:01:41] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 11:01:41] [INFO ] Invariant cache hit.
[2024-05-21 11:01:41] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 11:01:41] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2024-05-21 11:01:41] [INFO ] Redundant transitions in 12 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-21 11:01:41] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 11:01:41] [INFO ] Invariant cache hit.
[2024-05-21 11:01:42] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 11:01:51] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/368 variables, and 149 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1222/1371 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 65451ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65462ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 111711 ms. Remains : 123/123 places, 1225/1225 transitions.
Computed a total of 106 stabilizing places and 201 stable transitions
Computed a total of 106 stabilizing places and 201 stable transitions
Detected a total of 106/123 stabilizing places and 201/1225 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 103 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 60 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 263 steps (0 resets) in 7 ms. (32 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 92 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 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
[2024-05-21 11:02:47] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 11:02:47] [INFO ] Invariant cache hit.
[2024-05-21 11:02:48] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 11:02:48] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2024-05-21 11:02:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:02:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 11:02:48] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-05-21 11:02:48] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 11:02:48] [INFO ] [Nat]Added 20 Read/Feed constraints in 28 ms returned sat
[2024-05-21 11:02:49] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 40 ms.
[2024-05-21 11:02:49] [INFO ] Added : 59 causal constraints over 12 iterations in 640 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1738 reset in 457 ms.
Product exploration explored 100000 steps with 1734 reset in 439 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 85 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-05-21 11:02:50] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 11:02:50] [INFO ] Invariant cache hit.
[2024-05-21 11:02:50] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 11:03:00] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20401 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 45970ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45986ms
[2024-05-21 11:03:36] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 11:03:36] [INFO ] Invariant cache hit.
[2024-05-21 11:03:36] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-05-21 11:03:36] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 11:03:36] [INFO ] Invariant cache hit.
[2024-05-21 11:03:37] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 11:03:37] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
[2024-05-21 11:03:37] [INFO ] Redundant transitions in 22 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-21 11:03:37] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 11:03:37] [INFO ] Invariant cache hit.
[2024-05-21 11:03:37] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 11:03:46] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 35498ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 35515ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 82453 ms. Remains : 123/123 places, 1225/1225 transitions.
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLCardinality-10 finished in 247792 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)))'
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1228
Applied a total of 2 rules in 7 ms. Remains 126 /128 variables (removed 2) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2024-05-21 11:04:13] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 126 cols
[2024-05-21 11:04:13] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 11:04:13] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
[2024-05-21 11:04:23] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/374 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 3 (OVERLAPS) 248/374 variables, 126/132 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 20/152 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 1375 constraints, problems are : Problem set: 2 solved, 1223 unsolved in 21322 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1225 constraints, Known Traps: 1/1 constraints]
After SMT, in 47115ms problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 47130ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 11:05:00] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 126 cols
[2024-05-21 11:05:00] [INFO ] Computed 7 invariants in 4 ms
[2024-05-21 11:05:00] [INFO ] Implicit Places using invariants in 317 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 321 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/128 places, 1226/1228 transitions.
Applied a total of 0 rules in 5 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47467 ms. Remains : 124/128 places, 1226/1228 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLCardinality-11
Product exploration explored 100000 steps with 1510 reset in 326 ms.
Product exploration explored 100000 steps with 1485 reset in 321 ms.
Computed a total of 107 stabilizing places and 202 stable transitions
Computed a total of 107 stabilizing places and 202 stable transitions
Detected a total of 107/124 stabilizing places and 202/1226 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 157 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 264 steps (0 resets) in 5 ms. (44 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 10 factoid took 125 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 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2024-05-21 11:05:01] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 124 cols
[2024-05-21 11:05:01] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 11:05:02] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 11:05:02] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2024-05-21 11:05:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:05:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 11:05:03] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2024-05-21 11:05:03] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 11:05:03] [INFO ] [Nat]Added 20 Read/Feed constraints in 44 ms returned sat
[2024-05-21 11:05:03] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 3 ms to minimize.
[2024-05-21 11:05:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2024-05-21 11:05:03] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 135 transitions) in 48 ms.
[2024-05-21 11:05:03] [INFO ] Added : 36 causal constraints over 8 iterations in 339 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 124 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 65 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Running 1223 sub problems to find dead transitions.
[2024-05-21 11:05:03] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 11:05:03] [INFO ] Invariant cache hit.
[2024-05-21 11:05:03] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 11:05:13] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/370 variables, and 6 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20490 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
After SMT, in 45860ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 45874ms
[2024-05-21 11:05:49] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 11:05:49] [INFO ] Invariant cache hit.
[2024-05-21 11:05:50] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-21 11:05:50] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 11:05:50] [INFO ] Invariant cache hit.
[2024-05-21 11:05:50] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 11:05:50] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
[2024-05-21 11:05:50] [INFO ] Redundant transitions in 17 ms returned []
Running 1223 sub problems to find dead transitions.
[2024-05-21 11:05:50] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 11:05:50] [INFO ] Invariant cache hit.
[2024-05-21 11:05:50] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 11:05:59] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/370 variables, and 150 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 1223/1373 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
After SMT, in 65254ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 65268ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 111983 ms. Remains : 124/124 places, 1226/1226 transitions.
Computed a total of 107 stabilizing places and 202 stable transitions
Computed a total of 107 stabilizing places and 202 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 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 93 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 264 steps (0 resets) in 7 ms. (33 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 142 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2024-05-21 11:06:56] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 11:06:56] [INFO ] Invariant cache hit.
[2024-05-21 11:06:56] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 11:06:57] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2024-05-21 11:06:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:06:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 11:06:57] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2024-05-21 11:06:57] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 11:06:57] [INFO ] [Nat]Added 20 Read/Feed constraints in 46 ms returned sat
[2024-05-21 11:06:57] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 1 ms to minimize.
[2024-05-21 11:06:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 304 ms
[2024-05-21 11:06:58] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 135 transitions) in 51 ms.
[2024-05-21 11:06:58] [INFO ] Added : 36 causal constraints over 8 iterations in 316 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1462 reset in 439 ms.
Product exploration explored 100000 steps with 1520 reset in 414 ms.
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 63 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Running 1223 sub problems to find dead transitions.
[2024-05-21 11:06:59] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 11:06:59] [INFO ] Invariant cache hit.
[2024-05-21 11:06:59] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 11:07:09] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/370 variables, and 6 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 21004 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
After SMT, in 47108ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 47125ms
[2024-05-21 11:07:46] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 11:07:46] [INFO ] Invariant cache hit.
[2024-05-21 11:07:46] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-21 11:07:46] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 11:07:46] [INFO ] Invariant cache hit.
[2024-05-21 11:07:46] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 11:07:47] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 740 ms to find 0 implicit places.
[2024-05-21 11:07:47] [INFO ] Redundant transitions in 11 ms returned []
Running 1223 sub problems to find dead transitions.
[2024-05-21 11:07:47] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 11:07:47] [INFO ] Invariant cache hit.
[2024-05-21 11:07:47] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 11:07:57] [INFO ] Deduced a trap composed of 5 places in 264 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
SMT process timed out in 35614ms, After SMT, problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 35631ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 83587 ms. Remains : 124/124 places, 1226/1226 transitions.
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLCardinality-11 finished in 249845 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((p0&&(X(p1)||G(p2)))))'
Support contains 6 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1228
Applied a total of 2 rules in 8 ms. Remains 126 /128 variables (removed 2) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2024-05-21 11:08:23] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 126 cols
[2024-05-21 11:08:23] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 11:08:23] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
[2024-05-21 11:08:34] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/374 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 3 (OVERLAPS) 248/374 variables, 126/132 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 20/152 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 1375 constraints, problems are : Problem set: 2 solved, 1223 unsolved in 21619 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1225 constraints, Known Traps: 1/1 constraints]
After SMT, in 47012ms problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 47028ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 11:09:10] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 126 cols
[2024-05-21 11:09:10] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 11:09:10] [INFO ] Implicit Places using invariants in 306 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 312 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/128 places, 1226/1228 transitions.
Applied a total of 0 rules in 5 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47357 ms. Remains : 124/128 places, 1226/1228 transitions.
Stuttering acceptance computed with spot in 275 ms :[true, (NOT p1), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLCardinality-13 finished in 47651 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(p0))&&(!p0||F(p1))))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 127 transition count 1228
Applied a total of 1 rules in 8 ms. Remains 127 /128 variables (removed 1) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2024-05-21 11:09:10] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 127 cols
[2024-05-21 11:09:10] [INFO ] Computed 6 invariants in 3 ms
[2024-05-21 11:09:10] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
[2024-05-21 11:09:20] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 48.0)
(s55 49.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1/127 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 127/375 variables, and 7 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/127 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 5 (OVERLAPS) 248/375 variables, 127/134 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 20/154 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 375/375 variables, and 1377 constraints, problems are : Problem set: 2 solved, 1223 unsolved in 21643 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 127/127 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1225 constraints, Known Traps: 1/1 constraints]
After SMT, in 47426ms problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 47444ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 11:09:58] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 127 cols
[2024-05-21 11:09:58] [INFO ] Computed 8 invariants in 17 ms
[2024-05-21 11:09:58] [INFO ] Implicit Places using invariants in 365 ms returned [52, 109]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 368 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/128 places, 1226/1228 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47831 ms. Remains : 125/128 places, 1226/1228 transitions.
Stuttering acceptance computed with spot in 315 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLCardinality-14 finished in 48169 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 U (p1||G(p0))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((X(X(p0)) U (p1 U p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Found a Shortening insensitive property : BridgeAndVehicles-PT-V50P50N10-LTLCardinality-11
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 30 ms. Remains 126 /128 variables (removed 2) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2024-05-21 11:09:59] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 126 cols
[2024-05-21 11:09:59] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 11:09:59] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
[2024-05-21 11:10:10] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/374 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 3 (OVERLAPS) 248/374 variables, 126/132 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 20/152 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 1375 constraints, problems are : Problem set: 2 solved, 1223 unsolved in 21139 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1225 constraints, Known Traps: 1/1 constraints]
After SMT, in 47779ms problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 47803ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 11:10:47] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 126 cols
[2024-05-21 11:10:47] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 11:10:48] [INFO ] Implicit Places using invariants in 357 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 384 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 124/128 places, 1226/1228 transitions.
Applied a total of 0 rules in 37 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 48266 ms. Remains : 124/128 places, 1226/1228 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLCardinality-11
Product exploration explored 100000 steps with 1458 reset in 422 ms.
Product exploration explored 100000 steps with 1494 reset in 360 ms.
Computed a total of 107 stabilizing places and 202 stable transitions
Computed a total of 107 stabilizing places and 202 stable transitions
Detected a total of 107/124 stabilizing places and 202/1226 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 269 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 370 steps (0 resets) in 5 ms. (61 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 10 factoid took 235 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 110 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
[2024-05-21 11:10:49] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 124 cols
[2024-05-21 11:10:49] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 11:10:50] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 11:10:50] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2024-05-21 11:10:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:10:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 11:10:51] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2024-05-21 11:10:51] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 11:10:51] [INFO ] [Nat]Added 20 Read/Feed constraints in 70 ms returned sat
[2024-05-21 11:10:51] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 1 ms to minimize.
[2024-05-21 11:10:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2024-05-21 11:10:51] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 135 transitions) in 41 ms.
[2024-05-21 11:10:51] [INFO ] Added : 36 causal constraints over 8 iterations in 302 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 124 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 66 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Running 1223 sub problems to find dead transitions.
[2024-05-21 11:10:51] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 11:10:51] [INFO ] Invariant cache hit.
[2024-05-21 11:10:51] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 11:11:01] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/370 variables, and 6 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20469 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
After SMT, in 46923ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 46937ms
[2024-05-21 11:11:38] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 11:11:38] [INFO ] Invariant cache hit.
[2024-05-21 11:11:38] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-21 11:11:38] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 11:11:38] [INFO ] Invariant cache hit.
[2024-05-21 11:11:39] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 11:11:39] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
[2024-05-21 11:11:39] [INFO ] Redundant transitions in 13 ms returned []
Running 1223 sub problems to find dead transitions.
[2024-05-21 11:11:39] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 11:11:39] [INFO ] Invariant cache hit.
[2024-05-21 11:11:39] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 11:11:48] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/370 variables, and 150 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 1223/1373 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
After SMT, in 65106ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 65117ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 113018 ms. Remains : 124/124 places, 1226/1226 transitions.
Computed a total of 107 stabilizing places and 202 stable transitions
Computed a total of 107 stabilizing places and 202 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 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 86 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 253 steps (0 resets) in 6 ms. (36 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
[2024-05-21 11:12:45] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 11:12:45] [INFO ] Invariant cache hit.
[2024-05-21 11:12:45] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 11:12:45] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2024-05-21 11:12:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:12:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 11:12:46] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2024-05-21 11:12:46] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 11:12:46] [INFO ] [Nat]Added 20 Read/Feed constraints in 32 ms returned sat
[2024-05-21 11:12:46] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 2 ms to minimize.
[2024-05-21 11:12:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 328 ms
[2024-05-21 11:12:46] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 135 transitions) in 32 ms.
[2024-05-21 11:12:47] [INFO ] Added : 36 causal constraints over 8 iterations in 372 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1491 reset in 437 ms.
Product exploration explored 100000 steps with 1497 reset in 405 ms.
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 73 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Running 1223 sub problems to find dead transitions.
[2024-05-21 11:12:48] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 11:12:48] [INFO ] Invariant cache hit.
[2024-05-21 11:12:48] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 11:12:57] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/370 variables, and 6 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20806 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
After SMT, in 46532ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 46544ms
[2024-05-21 11:13:34] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 11:13:34] [INFO ] Invariant cache hit.
[2024-05-21 11:13:34] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-05-21 11:13:34] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 11:13:34] [INFO ] Invariant cache hit.
[2024-05-21 11:13:35] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 11:13:35] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 788 ms to find 0 implicit places.
[2024-05-21 11:13:35] [INFO ] Redundant transitions in 17 ms returned []
Running 1223 sub problems to find dead transitions.
[2024-05-21 11:13:35] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 11:13:35] [INFO ] Invariant cache hit.
[2024-05-21 11:13:35] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 11:13:44] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 11:14:10] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/370 variables, and 151 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/131 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 1223/1374 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1374 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 2/2 constraints]
After SMT, in 65521ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 65537ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 112972 ms. Remains : 124/124 places, 1226/1226 transitions.
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLCardinality-11 finished in 281606 ms.
[2024-05-21 11:14:41] [INFO ] Flatten gal took : 47 ms
[2024-05-21 11:14:41] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-21 11:14:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 128 places, 1228 transitions and 9210 arcs took 15 ms.
Total runtime 1760052 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-PT-V50P50N10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/417/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 128
TRANSITIONS: 1228
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.069s, Sys 0.005s]


SAVING FILE /home/mcc/execution/417/model (.net / .def) ...
EXPORT TIME: [User 0.003s, Sys 0.003s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2241
MODEL NAME: /home/mcc/execution/417/model
128 places, 1228 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLCardinality-05 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLCardinality-06 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLCardinality-10 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716290645153

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-V50P50N10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is BridgeAndVehicles-PT-V50P50N10, 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 r047-tajo-171620397800251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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