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-171620397800236.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-V50P20N20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397800236
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.2M
-rw-r--r-- 1 mcc users 25K Apr 13 00:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 153K Apr 13 00:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 226K Apr 13 00:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 875K Apr 13 00:50 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 11K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 68K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 195K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 13 01:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 13 01:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 723K Apr 13 01:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.8M Apr 13 01:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.9M 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-V50P20N20-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716287190002

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P20N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 10:26:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 10:26:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 10:26:31] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2024-05-21 10:26:31] [INFO ] Transformed 138 places.
[2024-05-21 10:26:31] [INFO ] Transformed 2348 transitions.
[2024-05-21 10:26:31] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 294 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 136 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Applied a total of 2 rules in 46 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2024-05-21 10:26:32] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-21 10:26:32] [INFO ] Computed 5 invariants in 17 ms
[2024-05-21 10:26:32] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 10:27:00] [INFO ] Deduced a trap composed of 5 places in 305 ms of which 19 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20106 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/2345 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 10:27:30] [INFO ] Deduced a trap composed of 25 places in 263 ms of which 3 ms to minimize.
Problem TDEAD1248 is UNSAT
Problem TDEAD1269 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 7 constraints, problems are : Problem set: 2 solved, 2343 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2345 constraints, Known Traps: 2/2 constraints]
After SMT, in 59031ms problems are : Problem set: 2 solved, 2343 unsolved
Search for dead transitions found 2 dead transitions in 59090ms
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:27:31] [INFO ] Flow matrix only has 290 transitions (discarded 2056 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-21 10:27:31] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 10:27:31] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 10:27:31] [INFO ] Flow matrix only has 290 transitions (discarded 2056 similar events)
[2024-05-21 10:27:31] [INFO ] Invariant cache hit.
[2024-05-21 10:27:31] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:27:31] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2346/2348 transitions.
Applied a total of 0 rules in 19 ms. Remains 136 /136 variables (removed 0) and now considering 2346/2346 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59423 ms. Remains : 136/138 places, 2346/2348 transitions.
Support contains 136 out of 136 places after structural reductions.
[2024-05-21 10:27:31] [INFO ] Flatten gal took : 210 ms
[2024-05-21 10:27:32] [INFO ] Flatten gal took : 164 ms
[2024-05-21 10:27:32] [INFO ] Input system was already deterministic with 2346 transitions.
Reduction of identical properties reduced properties to check from 25 to 22
RANDOM walk for 40000 steps (92 resets) in 3212 ms. (12 steps per ms) remains 8/22 properties
BEST_FIRST walk for 40003 steps (28 resets) in 982 ms. (40 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (36 resets) in 272 ms. (146 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40002 steps (32 resets) in 246 ms. (161 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (36 resets) in 328 ms. (121 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (36 resets) in 261 ms. (152 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (40 resets) in 364 ms. (109 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (42 resets) in 202 ms. (197 steps per ms) remains 6/6 properties
[2024-05-21 10:27:34] [INFO ] Flow matrix only has 290 transitions (discarded 2056 similar events)
[2024-05-21 10:27:34] [INFO ] Invariant cache hit.
[2024-05-21 10:27:34] [INFO ] State equation strengthened by 42 read => feed constraints.
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 3 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 2 (OVERLAPS) 68/136 variables, 3/5 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 290/426 variables, 136/141 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/426 variables, 42/183 constraints. Problems are: Problem set: 4 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 0/183 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/426 variables, 0/183 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 183 constraints, problems are : Problem set: 4 solved, 2 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 124/130 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 288/418 variables, 130/134 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 42/176 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 0/176 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 8/426 variables, 6/182 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 1/183 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 2/185 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 0/185 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/426 variables, 0/185 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 185 constraints, problems are : Problem set: 4 solved, 2 unsolved in 605 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1071ms problems are : Problem set: 4 solved, 2 unsolved
Parikh walk visited 0 properties in 367 ms.
Support contains 6 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2346/2346 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2345
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2345
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 133 transition count 2344
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 132 transition count 2343
Applied a total of 7 rules in 530 ms. Remains 132 /136 variables (removed 4) and now considering 2343/2346 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 531 ms. Remains : 132/136 places, 2343/2346 transitions.
RANDOM walk for 40000 steps (128 resets) in 559 ms. (71 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40000 steps (60 resets) in 297 ms. (134 steps per ms) remains 1/1 properties
[2024-05-21 10:27:36] [INFO ] Flow matrix only has 287 transitions (discarded 2056 similar events)
// Phase 1: matrix 287 rows 132 cols
[2024-05-21 10:27:36] [INFO ] Computed 4 invariants in 5 ms
[2024-05-21 10:27:36] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 124/128 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 287/415 variables, 128/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 42/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/419 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/419 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/419 variables, and 178 constraints, problems are : Problem set: 0 solved, 1 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 132/132 constraints, ReadFeed: 42/42 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 124/128 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 287/415 variables, 128/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 42/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/419 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/419 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 419/419 variables, and 179 constraints, problems are : Problem set: 0 solved, 1 unsolved in 583 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 132/132 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 814ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 68 ms.
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 2343/2343 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 131 transition count 2342
Applied a total of 2 rules in 328 ms. Remains 131 /132 variables (removed 1) and now considering 2342/2343 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 328 ms. Remains : 131/132 places, 2342/2343 transitions.
RANDOM walk for 40000 steps (128 resets) in 625 ms. (63 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (61 resets) in 387 ms. (103 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 143859 steps, run visited all 1 properties in 2029 ms. (steps per millisecond=70 )
Probabilistic random walk after 143859 steps, saw 48540 distinct states, run finished after 2033 ms. (steps per millisecond=70 ) properties seen :1
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 109 stabilizing places and 204 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(G(p1)))))'
Support contains 55 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2346/2346 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2345
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2345
Applied a total of 2 rules in 36 ms. Remains 135 /136 variables (removed 1) and now considering 2345/2346 (removed 1) transitions.
Running 2342 sub problems to find dead transitions.
[2024-05-21 10:27:40] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
// Phase 1: matrix 289 rows 135 cols
[2024-05-21 10:27:40] [INFO ] Computed 5 invariants in 7 ms
[2024-05-21 10:27:40] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
[2024-05-21 10:28:08] [INFO ] Deduced a trap composed of 5 places in 260 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2342 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2342/2342 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2342 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
[2024-05-21 10:28:39] [INFO ] Deduced a trap composed of 25 places in 265 ms of which 2 ms to minimize.
Problem TDEAD1287 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/424 variables, and 7 constraints, problems are : Problem set: 1 solved, 2341 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2342 constraints, Known Traps: 2/2 constraints]
After SMT, in 58231ms problems are : Problem set: 1 solved, 2341 unsolved
Search for dead transitions found 1 dead transitions in 58256ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
[2024-05-21 10:28:39] [INFO ] Flow matrix only has 289 transitions (discarded 2055 similar events)
[2024-05-21 10:28:39] [INFO ] Invariant cache hit.
[2024-05-21 10:28:39] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-21 10:28:39] [INFO ] Flow matrix only has 289 transitions (discarded 2055 similar events)
[2024-05-21 10:28:39] [INFO ] Invariant cache hit.
[2024-05-21 10:28:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:28:40] [INFO ] Implicit Places using invariants and state equation in 1429 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1817 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/136 places, 2344/2346 transitions.
Applied a total of 0 rules in 14 ms. Remains 133 /133 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60131 ms. Remains : 133/136 places, 2344/2346 transitions.
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLFireability-00
Stuttering criterion allowed to conclude after 5643 steps with 30 reset in 113 ms.
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLFireability-00 finished in 60621 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((X((p1||G(F(p2))))||p0)))'
Support contains 57 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2346/2346 transitions.
Applied a total of 0 rules in 16 ms. Remains 136 /136 variables (removed 0) and now considering 2346/2346 (removed 0) transitions.
Running 2343 sub problems to find dead transitions.
[2024-05-21 10:28:41] [INFO ] Flow matrix only has 290 transitions (discarded 2056 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-21 10:28:41] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 10:28:41] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
[2024-05-21 10:29:27] [INFO ] Deduced a trap composed of 5 places in 443 ms of which 4 ms to minimize.
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 19.0)
(s55 1.0)
(s56 0.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 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.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)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2343 unsolved in 20111 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2343/2343 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2343 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2343 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2343 constraints, Known Traps: 1/1 constraints]
After SMT, in 73518ms problems are : Problem set: 0 solved, 2343 unsolved
Search for dead transitions found 0 dead transitions in 73571ms
[2024-05-21 10:29:54] [INFO ] Flow matrix only has 290 transitions (discarded 2056 similar events)
[2024-05-21 10:29:54] [INFO ] Invariant cache hit.
[2024-05-21 10:29:55] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-05-21 10:29:55] [INFO ] Flow matrix only has 290 transitions (discarded 2056 similar events)
[2024-05-21 10:29:55] [INFO ] Invariant cache hit.
[2024-05-21 10:29:55] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:29:56] [INFO ] Implicit Places using invariants and state equation in 821 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1233 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/136 places, 2346/2346 transitions.
Applied a total of 0 rules in 21 ms. Remains 135 /135 variables (removed 0) and now considering 2346/2346 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74848 ms. Remains : 135/136 places, 2346/2346 transitions.
Stuttering acceptance computed with spot in 351 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLFireability-01
Product exploration explored 100000 steps with 576 reset in 841 ms.
Product exploration explored 100000 steps with 582 reset in 627 ms.
Computed a total of 108 stabilizing places and 204 stable transitions
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/135 stabilizing places and 204/2346 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 203 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 578 steps (0 resets) in 31 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 6 factoid took 177 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 118 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p2), (NOT p2)]
Support contains 3 out of 135 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 : 135/135 places, 2346/2346 transitions.
Applied a total of 0 rules in 392 ms. Remains 135 /135 variables (removed 0) and now considering 2346/2346 (removed 0) transitions.
Running 2343 sub problems to find dead transitions.
[2024-05-21 10:29:59] [INFO ] Flow matrix only has 290 transitions (discarded 2056 similar events)
// Phase 1: matrix 290 rows 135 cols
[2024-05-21 10:29:59] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 10:29:59] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
[2024-05-21 10:30:29] [INFO ] Deduced a trap composed of 5 places in 261 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2343 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2343/2343 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2343 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
[2024-05-21 10:31:00] [INFO ] Deduced a trap composed of 25 places in 212 ms of which 3 ms to minimize.
Problem TDEAD1288 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1330 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/425 variables, and 7 constraints, problems are : Problem set: 3 solved, 2340 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2343 constraints, Known Traps: 2/2 constraints]
After SMT, in 61991ms problems are : Problem set: 3 solved, 2340 unsolved
Search for dead transitions found 3 dead transitions in 62031ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 3 transitions.
[2024-05-21 10:31:01] [INFO ] Flow matrix only has 290 transitions (discarded 2053 similar events)
[2024-05-21 10:31:01] [INFO ] Invariant cache hit.
[2024-05-21 10:31:01] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-21 10:31:01] [INFO ] Flow matrix only has 290 transitions (discarded 2053 similar events)
[2024-05-21 10:31:01] [INFO ] Invariant cache hit.
[2024-05-21 10:31:01] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:31:02] [INFO ] Implicit Places using invariants and state equation in 1280 ms returned []
Implicit Place search using SMT with State Equation took 1601 ms to find 0 implicit places.
[2024-05-21 10:31:03] [INFO ] Redundant transitions in 166 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 135/135 places, 2343/2346 transitions.
Applied a total of 0 rules in 285 ms. Remains 135 /135 variables (removed 0) and now considering 2343/2343 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64495 ms. Remains : 135/135 places, 2343/2346 transitions.
Computed a total of 108 stabilizing places and 204 stable transitions
Computed a total of 108 stabilizing places and 204 stable transitions
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 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 91 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 543 steps (0 resets) in 14 ms. (36 steps per ms) remains 0/1 properties
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 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 84 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 582 reset in 729 ms.
Product exploration explored 100000 steps with 579 reset in 543 ms.
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 2343/2343 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 2342
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 2342
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 132 transition count 2341
Applied a total of 5 rules in 221 ms. Remains 132 /135 variables (removed 3) and now considering 2341/2343 (removed 2) transitions.
[2024-05-21 10:31:05] [INFO ] Flow matrix only has 288 transitions (discarded 2053 similar events)
// Phase 1: matrix 288 rows 132 cols
[2024-05-21 10:31:05] [INFO ] Computed 4 invariants in 4 ms
[2024-05-21 10:31:06] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-21 10:31:06] [INFO ] Flow matrix only has 288 transitions (discarded 2053 similar events)
[2024-05-21 10:31:06] [INFO ] Invariant cache hit.
[2024-05-21 10:31:06] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:31:07] [INFO ] Implicit Places using invariants and state equation in 1500 ms returned [105]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1873 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/135 places, 2341/2343 transitions.
Applied a total of 0 rules in 268 ms. Remains 131 /131 variables (removed 0) and now considering 2341/2341 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2362 ms. Remains : 131/135 places, 2341/2343 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLFireability-01 finished in 146807 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&(F(!p2)||p1)))))'
Support contains 126 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2346/2346 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2345
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2345
Applied a total of 2 rules in 36 ms. Remains 135 /136 variables (removed 1) and now considering 2345/2346 (removed 1) transitions.
Running 2342 sub problems to find dead transitions.
[2024-05-21 10:31:08] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
// Phase 1: matrix 289 rows 135 cols
[2024-05-21 10:31:08] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 10:31:08] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
[2024-05-21 10:31:37] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2342 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2342/2342 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2342 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
[2024-05-21 10:32:07] [INFO ] Deduced a trap composed of 25 places in 199 ms of which 1 ms to minimize.
Problem TDEAD1287 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1371 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/424 variables, and 7 constraints, problems are : Problem set: 5 solved, 2337 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2342 constraints, Known Traps: 2/2 constraints]
After SMT, in 60146ms problems are : Problem set: 5 solved, 2337 unsolved
Search for dead transitions found 5 dead transitions in 60179ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 5 transitions.
[2024-05-21 10:32:08] [INFO ] Flow matrix only has 289 transitions (discarded 2051 similar events)
[2024-05-21 10:32:08] [INFO ] Invariant cache hit.
[2024-05-21 10:32:08] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-21 10:32:08] [INFO ] Flow matrix only has 289 transitions (discarded 2051 similar events)
[2024-05-21 10:32:08] [INFO ] Invariant cache hit.
[2024-05-21 10:32:08] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:32:09] [INFO ] Implicit Places using invariants and state equation in 626 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 750 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/136 places, 2340/2346 transitions.
Applied a total of 0 rules in 13 ms. Remains 133 /133 variables (removed 0) and now considering 2340/2340 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60985 ms. Remains : 133/136 places, 2340/2346 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), true, p2]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLFireability-02 finished in 61201 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(X((X((F(p2)||p1)) U p3)))&&p0)))'
Support contains 105 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2346/2346 transitions.
Applied a total of 0 rules in 13 ms. Remains 136 /136 variables (removed 0) and now considering 2346/2346 (removed 0) transitions.
Running 2343 sub problems to find dead transitions.
[2024-05-21 10:32:09] [INFO ] Flow matrix only has 290 transitions (discarded 2056 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-21 10:32:09] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 10:32:09] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
[2024-05-21 10:32:36] [INFO ] Deduced a trap composed of 5 places in 351 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2343 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2343/2343 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2343 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
[2024-05-21 10:33:08] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 1 ms to minimize.
SMT process timed out in 59128ms, After SMT, problems are : Problem set: 0 solved, 2343 unsolved
Search for dead transitions found 0 dead transitions in 59158ms
[2024-05-21 10:33:08] [INFO ] Flow matrix only has 290 transitions (discarded 2056 similar events)
[2024-05-21 10:33:08] [INFO ] Invariant cache hit.
[2024-05-21 10:33:08] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-21 10:33:08] [INFO ] Flow matrix only has 290 transitions (discarded 2056 similar events)
[2024-05-21 10:33:08] [INFO ] Invariant cache hit.
[2024-05-21 10:33:08] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:33:09] [INFO ] Implicit Places using invariants and state equation in 1145 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1312 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/136 places, 2346/2346 transitions.
Applied a total of 0 rules in 21 ms. Remains 134 /134 variables (removed 0) and now considering 2346/2346 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60510 ms. Remains : 134/136 places, 2346/2346 transitions.
Stuttering acceptance computed with spot in 425 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (OR (NOT p3) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLFireability-05
Product exploration explored 100000 steps with 459 reset in 993 ms.
Product exploration explored 100000 steps with 462 reset in 855 ms.
Computed a total of 107 stabilizing places and 204 stable transitions
Computed a total of 107 stabilizing places and 204 stable transitions
Detected a total of 107/134 stabilizing places and 204/2346 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p3 p1 (NOT p2)), (X p3), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p3)))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 932 ms. Reduced automaton from 8 states, 24 edges and 4 AP (stutter sensitive) to 8 states, 24 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 454 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (OR (NOT p3) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Reduction of identical properties reduced properties to check from 15 to 11
RANDOM walk for 40000 steps (92 resets) in 1268 ms. (31 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40000 steps (36 resets) in 1463 ms. (27 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (37 resets) in 753 ms. (53 steps per ms) remains 2/2 properties
[2024-05-21 10:33:14] [INFO ] Flow matrix only has 290 transitions (discarded 2056 similar events)
// Phase 1: matrix 290 rows 134 cols
[2024-05-21 10:33:14] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 10:33:14] [INFO ] State equation strengthened by 42 read => feed constraints.
Problem apf3 is UNSAT
Problem apf11 is UNSAT
After SMT solving in domain Real declared 105/424 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 150ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p3 p1 (NOT p2)), (X p3), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p3)))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 p1 p2)), (G (OR (NOT p0) p3 (NOT p1) p2))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR p0 p3))), (F (NOT (OR p0 p3 p2))), (F p0), (F (NOT p1)), (F (NOT (OR (NOT p0) p3 p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p3))), (F (NOT (OR p1 p2))), (F p2), (F (NOT p3)), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p0 p3 (NOT p1) p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 4325 ms. Reduced automaton from 8 states, 24 edges and 4 AP (stutter sensitive) to 5 states, 14 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
[2024-05-21 10:33:19] [INFO ] Flow matrix only has 290 transitions (discarded 2056 similar events)
[2024-05-21 10:33:19] [INFO ] Invariant cache hit.
[2024-05-21 10:33:20] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-21 10:33:20] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-05-21 10:33:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:33:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 10:33:21] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-05-21 10:33:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:33:21] [INFO ] [Nat]Added 42 Read/Feed constraints in 55 ms returned sat
[2024-05-21 10:33:22] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 158 ms.
[2024-05-21 10:33:22] [INFO ] Added : 22 causal constraints over 6 iterations in 437 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 105 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 2346/2346 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 133 transition count 2345
Applied a total of 2 rules in 281 ms. Remains 133 /134 variables (removed 1) and now considering 2345/2346 (removed 1) transitions.
Running 2342 sub problems to find dead transitions.
[2024-05-21 10:33:22] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
// Phase 1: matrix 289 rows 133 cols
[2024-05-21 10:33:22] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 10:33:22] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
[2024-05-21 10:33:50] [INFO ] Deduced a trap composed of 5 places in 290 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2342 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2342/2342 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2342 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2342 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2342 constraints, Known Traps: 1/1 constraints]
After SMT, in 60342ms problems are : Problem set: 0 solved, 2342 unsolved
Search for dead transitions found 0 dead transitions in 60380ms
[2024-05-21 10:34:23] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
[2024-05-21 10:34:23] [INFO ] Invariant cache hit.
[2024-05-21 10:34:23] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-21 10:34:23] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
[2024-05-21 10:34:23] [INFO ] Invariant cache hit.
[2024-05-21 10:34:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:34:23] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 830 ms to find 0 implicit places.
[2024-05-21 10:34:24] [INFO ] Redundant transitions in 135 ms returned []
Running 2342 sub problems to find dead transitions.
[2024-05-21 10:34:24] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
[2024-05-21 10:34:24] [INFO ] Invariant cache hit.
[2024-05-21 10:34:24] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
[2024-05-21 10:34:52] [INFO ] Deduced a trap composed of 5 places in 233 ms of which 0 ms to minimize.
[2024-05-21 10:35:13] [INFO ] Deduced a trap composed of 25 places in 222 ms of which 1 ms to minimize.
Problem TDEAD1237 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1279 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/422 variables, and 7 constraints, problems are : Problem set: 3 solved, 2339 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2342/2342 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2339 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 2339 unsolved
Problem TDEAD1300 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1762 is UNSAT
Problem TDEAD1783 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1846 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1888 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1930 is UNSAT
Problem TDEAD1951 is UNSAT
Problem TDEAD1972 is UNSAT
Problem TDEAD1993 is UNSAT
Problem TDEAD2014 is UNSAT
Problem TDEAD2035 is UNSAT
Problem TDEAD2056 is UNSAT
Problem TDEAD2077 is UNSAT
Problem TDEAD2098 is UNSAT
Problem TDEAD2119 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2161 is UNSAT
Problem TDEAD2182 is UNSAT
Problem TDEAD2203 is UNSAT
Problem TDEAD2224 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 2/7 constraints. Problems are: Problem set: 48 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/422 variables, and 7 constraints, problems are : Problem set: 48 solved, 2294 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2342 constraints, Known Traps: 2/2 constraints]
After SMT, in 80485ms problems are : Problem set: 48 solved, 2294 unsolved
Search for dead transitions found 48 dead transitions in 80514ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 133/134 places, 2297/2346 transitions.
Applied a total of 0 rules in 235 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
[2024-05-21 10:35:44] [INFO ] Redundant transitions in 66 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 142469 ms. Remains : 133/134 places, 2297/2346 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2297 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p3 p1 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p3))), (X (NOT p0)), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p3)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 1423 ms. Reduced automaton from 5 states, 14 edges and 4 AP (stutter insensitive) to 5 states, 14 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 2864 steps (6 resets) in 56 ms. (50 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p0) p3 p1 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p3))), (X (NOT p0)), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p3)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) p3)))), (F (NOT (OR p1 p2 p3))), (F (NOT (OR (NOT p1) p2 p3))), (F p0), (F (NOT (OR p3 (NOT p0)))), (F (NOT p3)), (F p2), (F (NOT (OR p1 p2))), (F (NOT p1))]
Knowledge based reduction with 23 factoid took 3951 ms. Reduced automaton from 5 states, 14 edges and 4 AP (stutter insensitive) to 5 states, 14 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
[2024-05-21 10:35:51] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
// Phase 1: matrix 288 rows 133 cols
[2024-05-21 10:35:51] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 10:35:52] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 10:35:52] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-21 10:35:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:35:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 10:35:53] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-05-21 10:35:53] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 10:35:53] [INFO ] [Nat]Added 41 Read/Feed constraints in 449 ms returned sat
[2024-05-21 10:35:53] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 165 transitions) in 93 ms.
[2024-05-21 10:35:54] [INFO ] Added : 22 causal constraints over 6 iterations in 302 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 511 reset in 1234 ms.
Product exploration explored 100000 steps with 513 reset in 998 ms.
Support contains 105 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2297/2297 transitions.
Applied a total of 0 rules in 174 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Running 2294 sub problems to find dead transitions.
[2024-05-21 10:35:56] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 10:35:56] [INFO ] Invariant cache hit.
[2024-05-21 10:35:56] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 10:36:25] [INFO ] Deduced a trap composed of 5 places in 319 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 59733ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 59757ms
[2024-05-21 10:36:56] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 10:36:56] [INFO ] Invariant cache hit.
[2024-05-21 10:36:56] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-21 10:36:56] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 10:36:56] [INFO ] Invariant cache hit.
[2024-05-21 10:36:56] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 10:36:57] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
[2024-05-21 10:36:57] [INFO ] Redundant transitions in 54 ms returned []
Running 2294 sub problems to find dead transitions.
[2024-05-21 10:36:57] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 10:36:57] [INFO ] Invariant cache hit.
[2024-05-21 10:36:57] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 10:37:23] [INFO ] Deduced a trap composed of 5 places in 259 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 78336ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 78361ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 138998 ms. Remains : 133/133 places, 2297/2297 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLFireability-05 finished in 366395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2346/2346 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2345
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2345
Applied a total of 2 rules in 325 ms. Remains 135 /136 variables (removed 1) and now considering 2345/2346 (removed 1) transitions.
Running 2342 sub problems to find dead transitions.
[2024-05-21 10:38:16] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
// Phase 1: matrix 289 rows 135 cols
[2024-05-21 10:38:16] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 10:38:16] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
[2024-05-21 10:38:43] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 1 ms to minimize.
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 20.0)
(s55 1.0)
(s56 0.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 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2342 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2342/2342 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2342 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
[2024-05-21 10:39:14] [INFO ] Deduced a trap composed of 25 places in 239 ms of which 1 ms to minimize.
Problem TDEAD1287 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1371 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/424 variables, and 7 constraints, problems are : Problem set: 5 solved, 2337 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2342 constraints, Known Traps: 2/2 constraints]
After SMT, in 59414ms problems are : Problem set: 5 solved, 2337 unsolved
Search for dead transitions found 5 dead transitions in 59441ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 5 transitions.
[2024-05-21 10:39:15] [INFO ] Flow matrix only has 289 transitions (discarded 2051 similar events)
[2024-05-21 10:39:15] [INFO ] Invariant cache hit.
[2024-05-21 10:39:15] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-21 10:39:15] [INFO ] Flow matrix only has 289 transitions (discarded 2051 similar events)
[2024-05-21 10:39:15] [INFO ] Invariant cache hit.
[2024-05-21 10:39:15] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:39:17] [INFO ] Implicit Places using invariants and state equation in 1129 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1471 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/136 places, 2340/2346 transitions.
Applied a total of 0 rules in 282 ms. Remains 133 /133 variables (removed 0) and now considering 2340/2340 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61525 ms. Remains : 133/136 places, 2340/2346 transitions.
Stuttering acceptance computed with spot in 40 ms :[p0]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLFireability-06
Product exploration explored 100000 steps with 941 reset in 645 ms.
Product exploration explored 100000 steps with 946 reset in 527 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[p0]
RANDOM walk for 276 steps (0 resets) in 6 ms. (39 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[p0]
Stuttering acceptance computed with spot in 28 ms :[p0]
[2024-05-21 10:39:18] [INFO ] Flow matrix only has 289 transitions (discarded 2051 similar events)
// Phase 1: matrix 289 rows 133 cols
[2024-05-21 10:39:18] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 10:39:19] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2024-05-21 10:39:19] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2024-05-21 10:39:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:39:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 10:39:19] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2024-05-21 10:39:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:39:20] [INFO ] [Nat]Added 42 Read/Feed constraints in 570 ms returned sat
[2024-05-21 10:39:20] [INFO ] Deduced a trap composed of 5 places in 320 ms of which 1 ms to minimize.
[2024-05-21 10:39:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 391 ms
[2024-05-21 10:39:20] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 66 ms.
[2024-05-21 10:39:21] [INFO ] Added : 20 causal constraints over 5 iterations in 316 ms. Result :sat
Could not prove EG p0
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2340/2340 transitions.
Applied a total of 0 rules in 364 ms. Remains 133 /133 variables (removed 0) and now considering 2340/2340 (removed 0) transitions.
Running 2337 sub problems to find dead transitions.
[2024-05-21 10:39:21] [INFO ] Flow matrix only has 289 transitions (discarded 2051 similar events)
[2024-05-21 10:39:21] [INFO ] Invariant cache hit.
[2024-05-21 10:39:21] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2337 unsolved
[2024-05-21 10:39:49] [INFO ] Deduced a trap composed of 5 places in 255 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2337 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2337/2337 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2337 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2337 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2337 constraints, Known Traps: 1/1 constraints]
After SMT, in 59599ms problems are : Problem set: 0 solved, 2337 unsolved
Search for dead transitions found 0 dead transitions in 59626ms
[2024-05-21 10:40:21] [INFO ] Flow matrix only has 289 transitions (discarded 2051 similar events)
[2024-05-21 10:40:21] [INFO ] Invariant cache hit.
[2024-05-21 10:40:21] [INFO ] Implicit Places using invariants in 373 ms returned []
[2024-05-21 10:40:21] [INFO ] Flow matrix only has 289 transitions (discarded 2051 similar events)
[2024-05-21 10:40:21] [INFO ] Invariant cache hit.
[2024-05-21 10:40:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:40:23] [INFO ] Implicit Places using invariants and state equation in 1677 ms returned []
Implicit Place search using SMT with State Equation took 2052 ms to find 0 implicit places.
[2024-05-21 10:40:23] [INFO ] Redundant transitions in 47 ms returned []
Running 2337 sub problems to find dead transitions.
[2024-05-21 10:40:23] [INFO ] Flow matrix only has 289 transitions (discarded 2051 similar events)
[2024-05-21 10:40:23] [INFO ] Invariant cache hit.
[2024-05-21 10:40:23] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2337 unsolved
[2024-05-21 10:40:50] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 1 ms to minimize.
[2024-05-21 10:41:13] [INFO ] Deduced a trap composed of 25 places in 217 ms of which 1 ms to minimize.
SMT process timed out in 49725ms, After SMT, problems are : Problem set: 0 solved, 2337 unsolved
Search for dead transitions found 0 dead transitions in 49750ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 111862 ms. Remains : 133/133 places, 2340/2340 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[p0]
RANDOM walk for 466 steps (0 resets) in 8 ms. (51 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[p0]
Stuttering acceptance computed with spot in 40 ms :[p0]
[2024-05-21 10:41:13] [INFO ] Flow matrix only has 289 transitions (discarded 2051 similar events)
[2024-05-21 10:41:13] [INFO ] Invariant cache hit.
[2024-05-21 10:41:13] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 10:41:14] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2024-05-21 10:41:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:41:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-21 10:41:14] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2024-05-21 10:41:14] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:41:14] [INFO ] [Nat]Added 42 Read/Feed constraints in 355 ms returned sat
[2024-05-21 10:41:15] [INFO ] Deduced a trap composed of 5 places in 262 ms of which 1 ms to minimize.
[2024-05-21 10:41:16] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1776 ms
Could not prove EG p0
Stuttering acceptance computed with spot in 34 ms :[p0]
Product exploration explored 100000 steps with 953 reset in 492 ms.
Product exploration explored 100000 steps with 931 reset in 493 ms.
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2340/2340 transitions.
Applied a total of 0 rules in 381 ms. Remains 133 /133 variables (removed 0) and now considering 2340/2340 (removed 0) transitions.
Running 2337 sub problems to find dead transitions.
[2024-05-21 10:41:18] [INFO ] Flow matrix only has 289 transitions (discarded 2051 similar events)
[2024-05-21 10:41:18] [INFO ] Invariant cache hit.
[2024-05-21 10:41:18] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2337 unsolved
[2024-05-21 10:41:45] [INFO ] Deduced a trap composed of 5 places in 293 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2337 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2337/2337 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2337 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2337 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2337 constraints, Known Traps: 1/1 constraints]
After SMT, in 59305ms problems are : Problem set: 0 solved, 2337 unsolved
Search for dead transitions found 0 dead transitions in 59334ms
[2024-05-21 10:42:17] [INFO ] Flow matrix only has 289 transitions (discarded 2051 similar events)
[2024-05-21 10:42:17] [INFO ] Invariant cache hit.
[2024-05-21 10:42:17] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-05-21 10:42:17] [INFO ] Flow matrix only has 289 transitions (discarded 2051 similar events)
[2024-05-21 10:42:17] [INFO ] Invariant cache hit.
[2024-05-21 10:42:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:42:19] [INFO ] Implicit Places using invariants and state equation in 1425 ms returned []
Implicit Place search using SMT with State Equation took 1810 ms to find 0 implicit places.
[2024-05-21 10:42:19] [INFO ] Redundant transitions in 66 ms returned []
Running 2337 sub problems to find dead transitions.
[2024-05-21 10:42:19] [INFO ] Flow matrix only has 289 transitions (discarded 2051 similar events)
[2024-05-21 10:42:19] [INFO ] Invariant cache hit.
[2024-05-21 10:42:19] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2337 unsolved
[2024-05-21 10:42:46] [INFO ] Deduced a trap composed of 5 places in 282 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2337 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2337/2337 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2337 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2337 unsolved
[2024-05-21 10:43:32] [INFO ] Deduced a trap composed of 25 places in 250 ms of which 1 ms to minimize.
Problem TDEAD1387 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1723 is UNSAT
Problem TDEAD1744 is UNSAT
Problem TDEAD1765 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1828 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/422 variables, and 7 constraints, problems are : Problem set: 22 solved, 2315 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2337 constraints, Known Traps: 2/2 constraints]
After SMT, in 78781ms problems are : Problem set: 22 solved, 2315 unsolved
Search for dead transitions found 22 dead transitions in 78809ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 133/133 places, 2318/2340 transitions.
Applied a total of 0 rules in 355 ms. Remains 133 /133 variables (removed 0) and now considering 2318/2318 (removed 0) transitions.
[2024-05-21 10:43:38] [INFO ] Redundant transitions in 63 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 140842 ms. Remains : 133/133 places, 2318/2340 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLFireability-06 finished in 322956 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(G(p1)))))'
Support contains 6 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2346/2346 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2345
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2345
Applied a total of 2 rules in 32 ms. Remains 135 /136 variables (removed 1) and now considering 2345/2346 (removed 1) transitions.
Running 2342 sub problems to find dead transitions.
[2024-05-21 10:43:38] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
// Phase 1: matrix 289 rows 135 cols
[2024-05-21 10:43:38] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 10:43:38] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
[2024-05-21 10:44:09] [INFO ] Deduced a trap composed of 5 places in 391 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2342 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2342/2342 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2342 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2342 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2342 constraints, Known Traps: 1/1 constraints]
After SMT, in 60442ms problems are : Problem set: 0 solved, 2342 unsolved
Search for dead transitions found 0 dead transitions in 60470ms
[2024-05-21 10:44:39] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
[2024-05-21 10:44:39] [INFO ] Invariant cache hit.
[2024-05-21 10:44:39] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-05-21 10:44:39] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
[2024-05-21 10:44:39] [INFO ] Invariant cache hit.
[2024-05-21 10:44:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:44:40] [INFO ] Implicit Places using invariants and state equation in 943 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1322 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/136 places, 2345/2346 transitions.
Applied a total of 0 rules in 14 ms. Remains 134 /134 variables (removed 0) and now considering 2345/2345 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61846 ms. Remains : 134/136 places, 2345/2346 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLFireability-08 finished in 61999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2346/2346 transitions.
Applied a total of 0 rules in 12 ms. Remains 136 /136 variables (removed 0) and now considering 2346/2346 (removed 0) transitions.
Running 2343 sub problems to find dead transitions.
[2024-05-21 10:44:40] [INFO ] Flow matrix only has 290 transitions (discarded 2056 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-21 10:44:40] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 10:44:40] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
[2024-05-21 10:45:08] [INFO ] Deduced a trap composed of 5 places in 296 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2343 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2343/2343 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2343 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2343 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2343 constraints, Known Traps: 1/1 constraints]
After SMT, in 58321ms problems are : Problem set: 0 solved, 2343 unsolved
Search for dead transitions found 0 dead transitions in 58345ms
[2024-05-21 10:45:39] [INFO ] Flow matrix only has 290 transitions (discarded 2056 similar events)
[2024-05-21 10:45:39] [INFO ] Invariant cache hit.
[2024-05-21 10:45:39] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-21 10:45:39] [INFO ] Flow matrix only has 290 transitions (discarded 2056 similar events)
[2024-05-21 10:45:39] [INFO ] Invariant cache hit.
[2024-05-21 10:45:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:45:40] [INFO ] Implicit Places using invariants and state equation in 891 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1218 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/136 places, 2346/2346 transitions.
Applied a total of 0 rules in 21 ms. Remains 134 /134 variables (removed 0) and now considering 2346/2346 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59603 ms. Remains : 134/136 places, 2346/2346 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLFireability-09
Product exploration explored 100000 steps with 3134 reset in 573 ms.
Product exploration explored 100000 steps with 3028 reset in 523 ms.
Computed a total of 107 stabilizing places and 204 stable transitions
Computed a total of 107 stabilizing places and 204 stable transitions
Detected a total of 107/134 stabilizing places and 204/2346 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 sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 196 steps (0 resets) in 6 ms. (28 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 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
[2024-05-21 10:45:41] [INFO ] Flow matrix only has 290 transitions (discarded 2056 similar events)
// Phase 1: matrix 290 rows 134 cols
[2024-05-21 10:45:41] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 10:45:42] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 10:45:42] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2024-05-21 10:45:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:45:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 10:45:43] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-21 10:45:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:45:44] [INFO ] [Nat]Added 42 Read/Feed constraints in 491 ms returned sat
[2024-05-21 10:45:44] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 97 ms.
[2024-05-21 10:45:44] [INFO ] Added : 39 causal constraints over 10 iterations in 374 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 2346/2346 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 133 transition count 2345
Applied a total of 2 rules in 234 ms. Remains 133 /134 variables (removed 1) and now considering 2345/2346 (removed 1) transitions.
Running 2342 sub problems to find dead transitions.
[2024-05-21 10:45:44] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
// Phase 1: matrix 289 rows 133 cols
[2024-05-21 10:45:44] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 10:45:44] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
[2024-05-21 10:46:10] [INFO ] Deduced a trap composed of 5 places in 296 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2342 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2342/2342 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2342 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2342 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2342 constraints, Known Traps: 1/1 constraints]
After SMT, in 58418ms problems are : Problem set: 0 solved, 2342 unsolved
Search for dead transitions found 0 dead transitions in 58440ms
[2024-05-21 10:46:43] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
[2024-05-21 10:46:43] [INFO ] Invariant cache hit.
[2024-05-21 10:46:43] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-21 10:46:43] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
[2024-05-21 10:46:43] [INFO ] Invariant cache hit.
[2024-05-21 10:46:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:46:44] [INFO ] Implicit Places using invariants and state equation in 682 ms returned []
Implicit Place search using SMT with State Equation took 963 ms to find 0 implicit places.
[2024-05-21 10:46:44] [INFO ] Redundant transitions in 58 ms returned []
Running 2342 sub problems to find dead transitions.
[2024-05-21 10:46:44] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
[2024-05-21 10:46:44] [INFO ] Invariant cache hit.
[2024-05-21 10:46:44] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
[2024-05-21 10:47:09] [INFO ] Deduced a trap composed of 5 places in 366 ms of which 1 ms to minimize.
[2024-05-21 10:47:26] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 2 ms to minimize.
Problem TDEAD1237 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1762 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/422 variables, and 7 constraints, problems are : Problem set: 26 solved, 2316 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2342/2342 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 26 solved, 2316 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 26 solved, 2316 unsolved
Problem TDEAD1783 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1846 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1888 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1930 is UNSAT
Problem TDEAD1951 is UNSAT
Problem TDEAD1972 is UNSAT
Problem TDEAD1993 is UNSAT
Problem TDEAD2014 is UNSAT
Problem TDEAD2035 is UNSAT
Problem TDEAD2056 is UNSAT
Problem TDEAD2077 is UNSAT
Problem TDEAD2098 is UNSAT
Problem TDEAD2119 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2161 is UNSAT
Problem TDEAD2182 is UNSAT
Problem TDEAD2203 is UNSAT
Problem TDEAD2224 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 2/7 constraints. Problems are: Problem set: 48 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/422 variables, and 7 constraints, problems are : Problem set: 48 solved, 2294 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2342 constraints, Known Traps: 2/2 constraints]
After SMT, in 77891ms problems are : Problem set: 48 solved, 2294 unsolved
Search for dead transitions found 48 dead transitions in 77914ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 133/134 places, 2297/2346 transitions.
Applied a total of 0 rules in 179 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
[2024-05-21 10:48:02] [INFO ] Redundant transitions in 41 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 137858 ms. Remains : 133/134 places, 2297/2346 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2297 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 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 129 steps (0 resets) in 8 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
[2024-05-21 10:48:03] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
// Phase 1: matrix 288 rows 133 cols
[2024-05-21 10:48:03] [INFO ] Computed 5 invariants in 6 ms
[2024-05-21 10:48:03] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 10:48:04] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2024-05-21 10:48:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:48:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 10:48:04] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-05-21 10:48:04] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 10:48:06] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-21 10:48:08] [INFO ] [Nat]Added 41 Read/Feed constraints in 3018 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3493 reset in 771 ms.
Product exploration explored 100000 steps with 3481 reset in 610 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2297/2297 transitions.
Applied a total of 0 rules in 211 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Running 2294 sub problems to find dead transitions.
[2024-05-21 10:48:09] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 10:48:09] [INFO ] Invariant cache hit.
[2024-05-21 10:48:09] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 10:48:37] [INFO ] Deduced a trap composed of 5 places in 211 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 60422ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 60456ms
[2024-05-21 10:49:10] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 10:49:10] [INFO ] Invariant cache hit.
[2024-05-21 10:49:10] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-05-21 10:49:10] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 10:49:10] [INFO ] Invariant cache hit.
[2024-05-21 10:49:10] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 10:49:11] [INFO ] Implicit Places using invariants and state equation in 644 ms returned []
Implicit Place search using SMT with State Equation took 1044 ms to find 0 implicit places.
[2024-05-21 10:49:11] [INFO ] Redundant transitions in 66 ms returned []
Running 2294 sub problems to find dead transitions.
[2024-05-21 10:49:11] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 10:49:11] [INFO ] Invariant cache hit.
[2024-05-21 10:49:11] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 10:49:37] [INFO ] Deduced a trap composed of 5 places in 251 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 77512ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 77540ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 139341 ms. Remains : 133/133 places, 2297/2297 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLFireability-09 finished in 348302 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)&&F(!p0)))'
Support contains 1 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2346/2346 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 135 transition count 2345
Applied a total of 2 rules in 256 ms. Remains 135 /136 variables (removed 1) and now considering 2345/2346 (removed 1) transitions.
Running 2342 sub problems to find dead transitions.
[2024-05-21 10:50:29] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
// Phase 1: matrix 289 rows 135 cols
[2024-05-21 10:50:29] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 10:50:29] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
[2024-05-21 10:50:57] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2342 unsolved in 20076 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2342/2342 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2342 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2342 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2342 constraints, Known Traps: 1/1 constraints]
After SMT, in 59900ms problems are : Problem set: 0 solved, 2342 unsolved
Search for dead transitions found 0 dead transitions in 59928ms
[2024-05-21 10:51:29] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
[2024-05-21 10:51:29] [INFO ] Invariant cache hit.
[2024-05-21 10:51:29] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-05-21 10:51:29] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
[2024-05-21 10:51:29] [INFO ] Invariant cache hit.
[2024-05-21 10:51:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:51:30] [INFO ] Implicit Places using invariants and state equation in 917 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1321 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/136 places, 2345/2346 transitions.
Applied a total of 0 rules in 199 ms. Remains 133 /133 variables (removed 0) and now considering 2345/2345 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61712 ms. Remains : 133/136 places, 2345/2346 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, p0, (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLFireability-10
Product exploration explored 100000 steps with 3586 reset in 514 ms.
Product exploration explored 100000 steps with 3586 reset in 526 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2345 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 114 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 286 steps (0 resets) in 7 ms. (35 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 140 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 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
[2024-05-21 10:51:32] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
// Phase 1: matrix 289 rows 133 cols
[2024-05-21 10:51:32] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 10:51:33] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 10:51:33] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2024-05-21 10:51:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:51:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 10:51:34] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-05-21 10:51:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:51:34] [INFO ] [Nat]Added 42 Read/Feed constraints in 494 ms returned sat
[2024-05-21 10:51:34] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 53 ms.
[2024-05-21 10:51:35] [INFO ] Added : 19 causal constraints over 4 iterations in 196 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2345/2345 transitions.
Applied a total of 0 rules in 243 ms. Remains 133 /133 variables (removed 0) and now considering 2345/2345 (removed 0) transitions.
Running 2342 sub problems to find dead transitions.
[2024-05-21 10:51:35] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
[2024-05-21 10:51:35] [INFO ] Invariant cache hit.
[2024-05-21 10:51:35] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
[2024-05-21 10:52:01] [INFO ] Deduced a trap composed of 5 places in 321 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2342 unsolved in 20068 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2342/2342 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2342 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2342 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2342 constraints, Known Traps: 1/1 constraints]
After SMT, in 59057ms problems are : Problem set: 0 solved, 2342 unsolved
Search for dead transitions found 0 dead transitions in 59094ms
[2024-05-21 10:52:34] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
[2024-05-21 10:52:34] [INFO ] Invariant cache hit.
[2024-05-21 10:52:34] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-21 10:52:34] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
[2024-05-21 10:52:34] [INFO ] Invariant cache hit.
[2024-05-21 10:52:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:52:35] [INFO ] Implicit Places using invariants and state equation in 601 ms returned []
Implicit Place search using SMT with State Equation took 940 ms to find 0 implicit places.
[2024-05-21 10:52:35] [INFO ] Redundant transitions in 65 ms returned []
Running 2342 sub problems to find dead transitions.
[2024-05-21 10:52:35] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
[2024-05-21 10:52:35] [INFO ] Invariant cache hit.
[2024-05-21 10:52:35] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
[2024-05-21 10:53:02] [INFO ] Deduced a trap composed of 5 places in 281 ms of which 1 ms to minimize.
[2024-05-21 10:53:22] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 1 ms to minimize.
Problem TDEAD1237 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1321 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/422 variables, and 7 constraints, problems are : Problem set: 5 solved, 2337 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2342/2342 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 5 solved, 2337 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 5 solved, 2337 unsolved
Problem TDEAD1342 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1762 is UNSAT
Problem TDEAD1783 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1846 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1888 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1930 is UNSAT
Problem TDEAD1951 is UNSAT
Problem TDEAD1972 is UNSAT
Problem TDEAD1993 is UNSAT
Problem TDEAD2014 is UNSAT
Problem TDEAD2035 is UNSAT
Problem TDEAD2056 is UNSAT
Problem TDEAD2077 is UNSAT
Problem TDEAD2098 is UNSAT
Problem TDEAD2119 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2161 is UNSAT
Problem TDEAD2182 is UNSAT
Problem TDEAD2203 is UNSAT
Problem TDEAD2224 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 2/7 constraints. Problems are: Problem set: 48 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/422 variables, and 7 constraints, problems are : Problem set: 48 solved, 2294 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2342 constraints, Known Traps: 2/2 constraints]
After SMT, in 78373ms problems are : Problem set: 48 solved, 2294 unsolved
Search for dead transitions found 48 dead transitions in 78402ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 133/133 places, 2297/2345 transitions.
Applied a total of 0 rules in 180 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
[2024-05-21 10:53:54] [INFO ] Redundant transitions in 43 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 138998 ms. Remains : 133/133 places, 2297/2345 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2297 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 130 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 103 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 291 steps (0 resets) in 7 ms. (36 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 149 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 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2024-05-21 10:53:54] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
// Phase 1: matrix 288 rows 133 cols
[2024-05-21 10:53:54] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 10:53:55] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 10:53:55] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2024-05-21 10:53:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:53:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 10:53:56] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-05-21 10:53:56] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 10:53:58] [INFO ] [Nat]Added 41 Read/Feed constraints in 1477 ms returned sat
[2024-05-21 10:53:58] [INFO ] Deduced a trap composed of 24 places in 192 ms of which 5 ms to minimize.
[2024-05-21 10:53:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2024-05-21 10:53:58] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 165 transitions) in 76 ms.
[2024-05-21 10:53:59] [INFO ] Added : 66 causal constraints over 14 iterations in 912 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3454 reset in 688 ms.
Product exploration explored 100000 steps with 3595 reset in 539 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2297/2297 transitions.
Applied a total of 0 rules in 166 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Running 2294 sub problems to find dead transitions.
[2024-05-21 10:54:00] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 10:54:00] [INFO ] Invariant cache hit.
[2024-05-21 10:54:01] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 10:54:25] [INFO ] Deduced a trap composed of 5 places in 292 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20063 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 57545ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 57568ms
[2024-05-21 10:54:58] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 10:54:58] [INFO ] Invariant cache hit.
[2024-05-21 10:54:58] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-05-21 10:54:58] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 10:54:58] [INFO ] Invariant cache hit.
[2024-05-21 10:54:59] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 10:54:59] [INFO ] Implicit Places using invariants and state equation in 873 ms returned []
Implicit Place search using SMT with State Equation took 1242 ms to find 0 implicit places.
[2024-05-21 10:54:59] [INFO ] Redundant transitions in 67 ms returned []
Running 2294 sub problems to find dead transitions.
[2024-05-21 10:54:59] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 10:54:59] [INFO ] Invariant cache hit.
[2024-05-21 10:54:59] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 10:55:23] [INFO ] Deduced a trap composed of 5 places in 244 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 77250ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 77277ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 136340 ms. Remains : 133/133 places, 2297/2297 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLFireability-10 finished in 348240 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((F(G(p1))&&p0))))'
Support contains 6 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2346/2346 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2345
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2345
Applied a total of 2 rules in 23 ms. Remains 135 /136 variables (removed 1) and now considering 2345/2346 (removed 1) transitions.
Running 2342 sub problems to find dead transitions.
[2024-05-21 10:56:17] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
// Phase 1: matrix 289 rows 135 cols
[2024-05-21 10:56:17] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 10:56:17] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
[2024-05-21 10:56:48] [INFO ] Deduced a trap composed of 5 places in 348 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2342 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2342/2342 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2342 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2342 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2342 constraints, Known Traps: 1/1 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 2342 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
[2024-05-21 10:57:17] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
[2024-05-21 10:57:17] [INFO ] Invariant cache hit.
[2024-05-21 10:57:17] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-05-21 10:57:17] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
[2024-05-21 10:57:17] [INFO ] Invariant cache hit.
[2024-05-21 10:57:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:57:18] [INFO ] Implicit Places using invariants and state equation in 969 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1353 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/136 places, 2345/2346 transitions.
Applied a total of 0 rules in 16 ms. Remains 133 /133 variables (removed 0) and now considering 2345/2345 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61516 ms. Remains : 133/136 places, 2345/2346 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLFireability-11
Stuttering criterion allowed to conclude after 415 steps with 0 reset in 6 ms.
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLFireability-11 finished in 61738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||(F(!p1) U G(!p2))))))'
Support contains 4 out of 136 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2346/2346 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2345
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2345
Applied a total of 2 rules in 37 ms. Remains 135 /136 variables (removed 1) and now considering 2345/2346 (removed 1) transitions.
Running 2342 sub problems to find dead transitions.
[2024-05-21 10:57:19] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
[2024-05-21 10:57:19] [INFO ] Invariant cache hit.
[2024-05-21 10:57:19] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
[2024-05-21 10:57:47] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2342 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2342/2342 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2342 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2342 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2342 constraints, Known Traps: 1/1 constraints]
After SMT, in 60361ms problems are : Problem set: 0 solved, 2342 unsolved
Search for dead transitions found 0 dead transitions in 60397ms
[2024-05-21 10:58:19] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
[2024-05-21 10:58:19] [INFO ] Invariant cache hit.
[2024-05-21 10:58:19] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-21 10:58:19] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
[2024-05-21 10:58:19] [INFO ] Invariant cache hit.
[2024-05-21 10:58:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:58:20] [INFO ] Implicit Places using invariants and state equation in 850 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1124 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/136 places, 2345/2346 transitions.
Applied a total of 0 rules in 11 ms. Remains 133 /133 variables (removed 0) and now considering 2345/2345 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61578 ms. Remains : 133/136 places, 2345/2346 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLFireability-12
Product exploration explored 100000 steps with 616 reset in 523 ms.
Product exploration explored 100000 steps with 602 reset in 542 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2345 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
RANDOM walk for 40000 steps (92 resets) in 373 ms. (106 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (36 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
[2024-05-21 10:58:22] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
// Phase 1: matrix 289 rows 133 cols
[2024-05-21 10:58:22] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 10:58:22] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 237/316 variables, 79/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 21/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 105/421 variables, 53/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 21/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/422 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/422 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 180 constraints, problems are : Problem set: 0 solved, 1 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 42/42 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 237/316 variables, 79/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 21/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 105/421 variables, 53/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 21/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/422 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/422 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 181 constraints, problems are : Problem set: 0 solved, 1 unsolved in 522 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 42/42 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 141 ms.
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2345/2345 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 131 transition count 2344
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 130 transition count 2343
Applied a total of 5 rules in 206 ms. Remains 130 /133 variables (removed 3) and now considering 2343/2345 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 130/133 places, 2343/2345 transitions.
RANDOM walk for 40000 steps (128 resets) in 541 ms. (73 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (56 resets) in 206 ms. (193 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 277982 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 1
Probabilistic random walk after 277982 steps, saw 94448 distinct states, run finished after 3005 ms. (steps per millisecond=92 ) properties seen :0
[2024-05-21 10:58:26] [INFO ] Flow matrix only has 287 transitions (discarded 2056 similar events)
// Phase 1: matrix 287 rows 130 cols
[2024-05-21 10:58:26] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 10:58:26] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 74/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 236/314 variables, 78/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 21/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 102/416 variables, 51/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 21/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/417 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/417 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 176 constraints, problems are : Problem set: 0 solved, 1 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 130/130 constraints, ReadFeed: 42/42 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 74/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 236/314 variables, 78/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 21/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 102/416 variables, 51/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 21/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/417 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/417 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 177 constraints, problems are : Problem set: 0 solved, 1 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 130/130 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 496ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 44 ms.
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 2343/2343 transitions.
Applied a total of 0 rules in 188 ms. Remains 130 /130 variables (removed 0) and now considering 2343/2343 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 130/130 places, 2343/2343 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 2343/2343 transitions.
Applied a total of 0 rules in 188 ms. Remains 130 /130 variables (removed 0) and now considering 2343/2343 (removed 0) transitions.
[2024-05-21 10:58:27] [INFO ] Flow matrix only has 287 transitions (discarded 2056 similar events)
[2024-05-21 10:58:27] [INFO ] Invariant cache hit.
[2024-05-21 10:58:27] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-21 10:58:27] [INFO ] Flow matrix only has 287 transitions (discarded 2056 similar events)
[2024-05-21 10:58:27] [INFO ] Invariant cache hit.
[2024-05-21 10:58:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:58:28] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 821 ms to find 0 implicit places.
[2024-05-21 10:58:28] [INFO ] Redundant transitions in 47 ms returned []
Running 2340 sub problems to find dead transitions.
[2024-05-21 10:58:28] [INFO ] Flow matrix only has 287 transitions (discarded 2056 similar events)
[2024-05-21 10:58:28] [INFO ] Invariant cache hit.
[2024-05-21 10:58:28] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2340 unsolved
[2024-05-21 10:58:54] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 130/417 variables, and 5 constraints, problems are : Problem set: 0 solved, 2340 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/130 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2340/2340 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2340 unsolved
[2024-05-21 10:59:40] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 1 ms to minimize.
Problem TDEAD1335 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1734 is UNSAT
Problem TDEAD1755 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 130/417 variables, and 6 constraints, problems are : Problem set: 21 solved, 2319 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/130 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2340 constraints, Known Traps: 2/2 constraints]
After SMT, in 78396ms problems are : Problem set: 21 solved, 2319 unsolved
Search for dead transitions found 21 dead transitions in 78419ms
Found 21 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 21 transitions
Dead transitions reduction (with SMT) removed 21 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 130/130 places, 2322/2343 transitions.
Applied a total of 0 rules in 238 ms. Remains 130 /130 variables (removed 0) and now considering 2322/2322 (removed 0) transitions.
[2024-05-21 10:59:46] [INFO ] Redundant transitions in 64 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 79794 ms. Remains : 130/130 places, 2322/2343 transitions.
RANDOM walk for 40000 steps (128 resets) in 499 ms. (80 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (56 resets) in 213 ms. (186 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 296832 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 1
Probabilistic random walk after 296832 steps, saw 100792 distinct states, run finished after 3002 ms. (steps per millisecond=98 ) properties seen :0
[2024-05-21 10:59:50] [INFO ] Flow matrix only has 287 transitions (discarded 2035 similar events)
[2024-05-21 10:59:50] [INFO ] Invariant cache hit.
[2024-05-21 10:59:50] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 74/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 236/314 variables, 78/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 21/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 102/416 variables, 51/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 21/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/417 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/417 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 176 constraints, problems are : Problem set: 0 solved, 1 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 130/130 constraints, ReadFeed: 42/42 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 74/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 236/314 variables, 78/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 21/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 102/416 variables, 51/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 21/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/417 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/417 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 177 constraints, problems are : Problem set: 0 solved, 1 unsolved in 412 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 130/130 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 695ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 49 ms.
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 2322/2322 transitions.
Applied a total of 0 rules in 196 ms. Remains 130 /130 variables (removed 0) and now considering 2322/2322 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 130/130 places, 2322/2322 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 2322/2322 transitions.
Applied a total of 0 rules in 171 ms. Remains 130 /130 variables (removed 0) and now considering 2322/2322 (removed 0) transitions.
[2024-05-21 10:59:51] [INFO ] Flow matrix only has 287 transitions (discarded 2035 similar events)
[2024-05-21 10:59:51] [INFO ] Invariant cache hit.
[2024-05-21 10:59:51] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-21 10:59:51] [INFO ] Flow matrix only has 287 transitions (discarded 2035 similar events)
[2024-05-21 10:59:51] [INFO ] Invariant cache hit.
[2024-05-21 10:59:51] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:59:53] [INFO ] Implicit Places using invariants and state equation in 1734 ms returned []
Implicit Place search using SMT with State Equation took 2071 ms to find 0 implicit places.
[2024-05-21 10:59:53] [INFO ] Redundant transitions in 91 ms returned []
Running 2319 sub problems to find dead transitions.
[2024-05-21 10:59:53] [INFO ] Flow matrix only has 287 transitions (discarded 2035 similar events)
[2024-05-21 10:59:53] [INFO ] Invariant cache hit.
[2024-05-21 10:59:53] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2319 unsolved
[2024-05-21 11:00:19] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 130/417 variables, and 5 constraints, problems are : Problem set: 0 solved, 2319 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/130 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2319/2319 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2319 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2319 unsolved
[2024-05-21 11:01:12] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 0 ms to minimize.
Problem TDEAD1755 is UNSAT
Problem TDEAD1776 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1818 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 130/417 variables, and 6 constraints, problems are : Problem set: 4 solved, 2315 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/130 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2319 constraints, Known Traps: 2/2 constraints]
After SMT, in 79369ms problems are : Problem set: 4 solved, 2315 unsolved
Search for dead transitions found 4 dead transitions in 79396ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 130/130 places, 2318/2322 transitions.
Applied a total of 0 rules in 172 ms. Remains 130 /130 variables (removed 0) and now considering 2318/2318 (removed 0) transitions.
[2024-05-21 11:01:13] [INFO ] Redundant transitions in 46 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 81968 ms. Remains : 130/130 places, 2318/2322 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F (NOT (OR (NOT p0) p2))), (F p2)]
Knowledge based reduction with 10 factoid took 299 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Support contains 4 out of 133 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 : 133/133 places, 2345/2345 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 131 transition count 2344
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 130 transition count 2343
Applied a total of 5 rules in 305 ms. Remains 130 /133 variables (removed 3) and now considering 2343/2345 (removed 2) transitions.
[2024-05-21 11:01:14] [INFO ] Flow matrix only has 287 transitions (discarded 2056 similar events)
[2024-05-21 11:01:14] [INFO ] Invariant cache hit.
[2024-05-21 11:01:14] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-21 11:01:14] [INFO ] Flow matrix only has 287 transitions (discarded 2056 similar events)
[2024-05-21 11:01:14] [INFO ] Invariant cache hit.
[2024-05-21 11:01:14] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:01:15] [INFO ] Implicit Places using invariants and state equation in 696 ms returned []
Implicit Place search using SMT with State Equation took 1013 ms to find 0 implicit places.
[2024-05-21 11:01:15] [INFO ] Redundant transitions in 65 ms returned []
Running 2340 sub problems to find dead transitions.
[2024-05-21 11:01:15] [INFO ] Flow matrix only has 287 transitions (discarded 2056 similar events)
[2024-05-21 11:01:15] [INFO ] Invariant cache hit.
[2024-05-21 11:01:15] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2340 unsolved
[2024-05-21 11:01:41] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 130/417 variables, and 5 constraints, problems are : Problem set: 0 solved, 2340 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/130 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2340/2340 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2340 unsolved
[2024-05-21 11:02:31] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 5 ms to minimize.
Problem TDEAD1335 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1566 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 130/417 variables, and 6 constraints, problems are : Problem set: 12 solved, 2328 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/130 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2340 constraints, Known Traps: 2/2 constraints]
After SMT, in 79572ms problems are : Problem set: 12 solved, 2328 unsolved
Search for dead transitions found 12 dead transitions in 79598ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 130/133 places, 2331/2345 transitions.
Applied a total of 0 rules in 246 ms. Remains 130 /130 variables (removed 0) and now considering 2331/2331 (removed 0) transitions.
[2024-05-21 11:02:35] [INFO ] Redundant transitions in 64 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 81310 ms. Remains : 130/133 places, 2331/2345 transitions.
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/130 stabilizing places and 202/2331 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 185 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
RANDOM walk for 40000 steps (128 resets) in 475 ms. (84 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (56 resets) in 235 ms. (169 steps per ms) remains 1/1 properties
[2024-05-21 11:02:35] [INFO ] Flow matrix only has 287 transitions (discarded 2044 similar events)
[2024-05-21 11:02:35] [INFO ] Invariant cache hit.
[2024-05-21 11:02:35] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 74/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 236/314 variables, 78/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 21/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 102/416 variables, 51/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 21/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/417 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/417 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 176 constraints, problems are : Problem set: 0 solved, 1 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 130/130 constraints, ReadFeed: 42/42 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 74/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 236/314 variables, 78/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 21/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 102/416 variables, 51/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 21/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/417 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/417 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 177 constraints, problems are : Problem set: 0 solved, 1 unsolved in 436 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 130/130 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 703ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 120 ms.
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 2331/2331 transitions.
Applied a total of 0 rules in 182 ms. Remains 130 /130 variables (removed 0) and now considering 2331/2331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 130/130 places, 2331/2331 transitions.
RANDOM walk for 40000 steps (128 resets) in 487 ms. (81 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (56 resets) in 220 ms. (180 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 258715 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 1
Probabilistic random walk after 258715 steps, saw 87961 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
[2024-05-21 11:02:39] [INFO ] Flow matrix only has 287 transitions (discarded 2044 similar events)
[2024-05-21 11:02:39] [INFO ] Invariant cache hit.
[2024-05-21 11:02:39] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 74/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 236/314 variables, 78/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 21/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 102/416 variables, 51/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 21/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/417 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/417 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 176 constraints, problems are : Problem set: 0 solved, 1 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 130/130 constraints, ReadFeed: 42/42 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 74/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 236/314 variables, 78/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 21/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 102/416 variables, 51/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 21/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/417 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/417 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 177 constraints, problems are : Problem set: 0 solved, 1 unsolved in 370 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 130/130 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 645ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 154 ms.
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 2331/2331 transitions.
Applied a total of 0 rules in 180 ms. Remains 130 /130 variables (removed 0) and now considering 2331/2331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 130/130 places, 2331/2331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 2331/2331 transitions.
Applied a total of 0 rules in 180 ms. Remains 130 /130 variables (removed 0) and now considering 2331/2331 (removed 0) transitions.
[2024-05-21 11:02:41] [INFO ] Flow matrix only has 287 transitions (discarded 2044 similar events)
[2024-05-21 11:02:41] [INFO ] Invariant cache hit.
[2024-05-21 11:02:41] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-21 11:02:41] [INFO ] Flow matrix only has 287 transitions (discarded 2044 similar events)
[2024-05-21 11:02:41] [INFO ] Invariant cache hit.
[2024-05-21 11:02:41] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:02:42] [INFO ] Implicit Places using invariants and state equation in 1288 ms returned []
Implicit Place search using SMT with State Equation took 1611 ms to find 0 implicit places.
[2024-05-21 11:02:42] [INFO ] Redundant transitions in 94 ms returned []
Running 2328 sub problems to find dead transitions.
[2024-05-21 11:02:42] [INFO ] Flow matrix only has 287 transitions (discarded 2044 similar events)
[2024-05-21 11:02:42] [INFO ] Invariant cache hit.
[2024-05-21 11:02:42] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2328 unsolved
[2024-05-21 11:03:09] [INFO ] Deduced a trap composed of 5 places in 268 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.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 1.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 0.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 0.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 130/417 variables, and 5 constraints, problems are : Problem set: 0 solved, 2328 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/130 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2328/2328 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 130/417 variables, and 5 constraints, problems are : Problem set: 0 solved, 2328 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/130 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2328 constraints, Known Traps: 1/1 constraints]
After SMT, in 79648ms problems are : Problem set: 0 solved, 2328 unsolved
Search for dead transitions found 0 dead transitions in 79675ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81571 ms. Remains : 130/130 places, 2331/2331 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 2044 transitions
Reduce isomorphic transitions removed 2044 transitions.
Iterating post reduction 0 with 2044 rules applied. Total rules applied 2044 place count 130 transition count 287
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2045 place count 130 transition count 286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2046 place count 129 transition count 286
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 2047 place count 129 transition count 286
Applied a total of 2047 rules in 31 ms. Remains 129 /130 variables (removed 1) and now considering 286/2331 (removed 2045) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 286 rows 129 cols
[2024-05-21 11:04:02] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 11:04:02] [INFO ] [Real]Absence check using 4 positive place invariants in 22 ms returned sat
[2024-05-21 11:04:02] [INFO ] After 472ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 11:04:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 11:04:03] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 11:04:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 11:04:03] [INFO ] After 27ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 11:04:03] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 11:04:03] [INFO ] After 229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 751 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F (NOT (OR (NOT p0) p2))), (F p2)]
Knowledge based reduction with 14 factoid took 494 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Product exploration explored 100000 steps with 714 reset in 684 ms.
Product exploration explored 100000 steps with 724 reset in 580 ms.
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 2331/2331 transitions.
Applied a total of 0 rules in 213 ms. Remains 130 /130 variables (removed 0) and now considering 2331/2331 (removed 0) transitions.
[2024-05-21 11:04:05] [INFO ] Flow matrix only has 287 transitions (discarded 2044 similar events)
// Phase 1: matrix 287 rows 130 cols
[2024-05-21 11:04:05] [INFO ] Computed 4 invariants in 15 ms
[2024-05-21 11:04:05] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-05-21 11:04:05] [INFO ] Flow matrix only has 287 transitions (discarded 2044 similar events)
[2024-05-21 11:04:05] [INFO ] Invariant cache hit.
[2024-05-21 11:04:06] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:04:07] [INFO ] Implicit Places using invariants and state equation in 1327 ms returned []
Implicit Place search using SMT with State Equation took 1674 ms to find 0 implicit places.
[2024-05-21 11:04:07] [INFO ] Redundant transitions in 47 ms returned []
Running 2328 sub problems to find dead transitions.
[2024-05-21 11:04:07] [INFO ] Flow matrix only has 287 transitions (discarded 2044 similar events)
[2024-05-21 11:04:07] [INFO ] Invariant cache hit.
[2024-05-21 11:04:07] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2328 unsolved
[2024-05-21 11:04:33] [INFO ] Deduced a trap composed of 5 places in 309 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 130/417 variables, and 5 constraints, problems are : Problem set: 0 solved, 2328 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/130 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2328/2328 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2328 unsolved
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-PT-V50P20N20

IS_COLORED=
IS_NUPN=

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


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


----------------------------------------------------------------------
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: 2302
MODEL NAME: /home/mcc/execution/model
138 places, 2348 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-V50P20N20-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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 LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-V50P20N20"
export BK_EXAMINATION="LTLFireability"
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-V50P20N20, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620397800236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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