About the Execution of ITS-Tools for Szymanski-PT-b06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16206.556 | 3600000.00 | 8620054.00 | 12216.70 | TTTFTFFTFFFTFT?T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r400-tall-171690533300875.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is Szymanski-PT-b06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690533300875
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 15:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 11 15:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.7M May 18 16:43 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 Szymanski-PT-b06-LTLCardinality-00
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-01
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-02
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-03
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-04
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-05
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-06
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-07
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-08
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-09
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-10
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-11
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-12
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-13
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-14
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717090695291
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-30 17:38:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 17:38:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 17:38:16] [INFO ] Load time of PNML (sax parser for PT used): 311 ms
[2024-05-30 17:38:16] [INFO ] Transformed 568 places.
[2024-05-30 17:38:16] [INFO ] Transformed 8320 transitions.
[2024-05-30 17:38:16] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 449 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 260 places in 17 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b06-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 306 transition count 8064
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 305 transition count 7936
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 305 transition count 7936
Applied a total of 4 rules in 213 ms. Remains 305 /308 variables (removed 3) and now considering 7936/8064 (removed 128) transitions.
[2024-05-30 17:38:17] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-30 17:38:17] [INFO ] Computed 1 invariants in 51 ms
[2024-05-30 17:38:17] [INFO ] Implicit Places using invariants in 724 ms returned []
[2024-05-30 17:38:17] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:38:18] [INFO ] Invariant cache hit.
[2024-05-30 17:38:18] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 17:38:36] [INFO ] Implicit Places using invariants and state equation in 18019 ms returned []
Implicit Place search using SMT with State Equation took 18777 ms to find 0 implicit places.
Running 7934 sub problems to find dead transitions.
[2024-05-30 17:38:36] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:38:36] [INFO ] Invariant cache hit.
[2024-05-30 17:38:36] [INFO ] State equation strengthened by 147 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30151 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30104 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints]
After SMT, in 88252ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 88355ms
Starting structural reductions in LTL mode, iteration 1 : 305/308 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107397 ms. Remains : 305/308 places, 7936/8064 transitions.
Support contains 12 out of 305 places after structural reductions.
[2024-05-30 17:40:05] [INFO ] Flatten gal took : 459 ms
[2024-05-30 17:40:05] [INFO ] Flatten gal took : 239 ms
[2024-05-30 17:40:05] [INFO ] Input system was already deterministic with 7936 transitions.
RANDOM walk for 40002 steps (11 resets) in 703 ms. (56 steps per ms) remains 5/11 properties
BEST_FIRST walk for 40003 steps (11 resets) in 183 ms. (217 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (12 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (13 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (11 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (13 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
[2024-05-30 17:40:06] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:40:06] [INFO ] Invariant cache hit.
[2024-05-30 17:40:06] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 300/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp9 is UNSAT
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3037 variables, 147/453 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 2 solved, 2 unsolved in 730 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 302/305 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 2 solved, 2 unsolved in 2574 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 3346ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 410 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 411 ms. Remains : 305/305 places, 7809/7936 transitions.
RANDOM walk for 40013 steps (9 resets) in 643 ms. (62 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 146555 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 2
Probabilistic random walk after 146555 steps, saw 76718 distinct states, run finished after 3004 ms. (steps per millisecond=48 ) properties seen :0
[2024-05-30 17:40:13] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2024-05-30 17:40:13] [INFO ] Computed 2 invariants in 21 ms
[2024-05-30 17:40:13] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 283/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/305 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2605/2910 variables, 305/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2910 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2910 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2910 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2910/2910 variables, and 454 constraints, problems are : Problem set: 0 solved, 2 unsolved in 656 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 283/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/305 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 17:40:14] [INFO ] Deduced a trap composed of 84 places in 547 ms of which 28 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2605/2910 variables, 305/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2910 variables, 147/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2910 variables, 2/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 17:40:17] [INFO ] Deduced a trap composed of 169 places in 534 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2910 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2910 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2910 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2910/2910 variables, and 458 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3662 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 4368ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 190 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 185 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2024-05-30 17:40:18] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-30 17:40:18] [INFO ] Invariant cache hit.
[2024-05-30 17:40:18] [INFO ] Implicit Places using invariants in 479 ms returned []
[2024-05-30 17:40:18] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-30 17:40:18] [INFO ] Invariant cache hit.
[2024-05-30 17:40:19] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 17:40:42] [INFO ] Implicit Places using invariants and state equation in 24062 ms returned []
Implicit Place search using SMT with State Equation took 24543 ms to find 0 implicit places.
[2024-05-30 17:40:43] [INFO ] Redundant transitions in 803 ms returned []
Running 7807 sub problems to find dead transitions.
[2024-05-30 17:40:43] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-30 17:40:43] [INFO ] Invariant cache hit.
[2024-05-30 17:40:43] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7807 unsolved
SMT process timed out in 57193ms, After SMT, problems are : Problem set: 0 solved, 7807 unsolved
Search for dead transitions found 0 dead transitions in 57265ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82832 ms. Remains : 305/305 places, 7809/7809 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 5264 edges and 305 vertex of which 38 / 305 are part of one of the 2 SCC in 5 ms
Free SCC test removed 36 places
Drop transitions (Empty/Sink Transition effects.) removed 4264 transitions
Ensure Unique test removed 1182 transitions
Reduce isomorphic transitions removed 5446 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 269 transition count 1947
Applied a total of 417 rules in 200 ms. Remains 269 /305 variables (removed 36) and now considering 1947/7809 (removed 5862) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1947 rows 269 cols
[2024-05-30 17:41:41] [INFO ] Computed 2 invariants in 14 ms
[2024-05-30 17:41:41] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-30 17:41:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-30 17:41:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-30 17:41:41] [INFO ] After 510ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-30 17:41:41] [INFO ] State equation strengthened by 504 read => feed constraints.
[2024-05-30 17:41:42] [INFO ] After 839ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-30 17:41:43] [INFO ] After 1893ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-30 17:41:44] [INFO ] After 3215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 3515 ms.
FORMULA Szymanski-PT-b06-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 5 simplifications.
FORMULA Szymanski-PT-b06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 11 stabilizing places and 2304 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' '!(X(F(p0)))'
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 26 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-30 17:41:44] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-30 17:41:44] [INFO ] Computed 1 invariants in 18 ms
[2024-05-30 17:41:44] [INFO ] Implicit Places using invariants in 439 ms returned []
[2024-05-30 17:41:44] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:41:44] [INFO ] Invariant cache hit.
[2024-05-30 17:41:45] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 17:42:01] [INFO ] Implicit Places using invariants and state equation in 16133 ms returned []
Implicit Place search using SMT with State Equation took 16576 ms to find 0 implicit places.
Running 7934 sub problems to find dead transitions.
[2024-05-30 17:42:01] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:42:01] [INFO ] Invariant cache hit.
[2024-05-30 17:42:01] [INFO ] State equation strengthened by 147 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30090 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30090 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints]
After SMT, in 87968ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 88036ms
Finished structural reductions in LTL mode , in 1 iterations and 104653 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b06-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 730 ms.
Product exploration explored 100000 steps with 50000 reset in 551 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Szymanski-PT-b06-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Szymanski-PT-b06-LTLCardinality-01 finished in 106242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U (p1&&X(p2))) U p3))'
Support contains 5 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 25 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-30 17:43:30] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:43:30] [INFO ] Invariant cache hit.
[2024-05-30 17:43:31] [INFO ] Implicit Places using invariants in 405 ms returned []
[2024-05-30 17:43:31] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:43:31] [INFO ] Invariant cache hit.
[2024-05-30 17:43:32] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 17:43:48] [INFO ] Implicit Places using invariants and state equation in 17808 ms returned []
Implicit Place search using SMT with State Equation took 18215 ms to find 0 implicit places.
Running 7934 sub problems to find dead transitions.
[2024-05-30 17:43:49] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:43:49] [INFO ] Invariant cache hit.
[2024-05-30 17:43:49] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30091 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30104 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints]
After SMT, in 87645ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 87713ms
Finished structural reductions in LTL mode , in 1 iterations and 105981 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 237 ms :[(NOT p3), true, (NOT p0), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Szymanski-PT-b06-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Szymanski-PT-b06-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b06-LTLCardinality-08 finished in 106255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 28 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-30 17:45:16] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:45:16] [INFO ] Invariant cache hit.
[2024-05-30 17:45:17] [INFO ] Implicit Places using invariants in 412 ms returned []
[2024-05-30 17:45:17] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:45:17] [INFO ] Invariant cache hit.
[2024-05-30 17:45:18] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 17:45:37] [INFO ] Implicit Places using invariants and state equation in 19970 ms returned []
Implicit Place search using SMT with State Equation took 20383 ms to find 0 implicit places.
Running 7934 sub problems to find dead transitions.
[2024-05-30 17:45:37] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:45:37] [INFO ] Invariant cache hit.
[2024-05-30 17:45:37] [INFO ] State equation strengthened by 147 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30110 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30095 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints]
After SMT, in 88125ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 88189ms
Finished structural reductions in LTL mode , in 1 iterations and 108615 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b06-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Szymanski-PT-b06-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b06-LTLCardinality-09 finished in 108846 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&&X(X(G(p1))))))'
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 28 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-30 17:47:05] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:47:05] [INFO ] Invariant cache hit.
[2024-05-30 17:47:06] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-05-30 17:47:06] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:47:06] [INFO ] Invariant cache hit.
[2024-05-30 17:47:07] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 17:47:23] [INFO ] Implicit Places using invariants and state equation in 17468 ms returned []
Implicit Place search using SMT with State Equation took 17902 ms to find 0 implicit places.
Running 7934 sub problems to find dead transitions.
[2024-05-30 17:47:23] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:47:23] [INFO ] Invariant cache hit.
[2024-05-30 17:47:23] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30088 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30081 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints]
After SMT, in 89262ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 89330ms
Finished structural reductions in LTL mode , in 1 iterations and 107275 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Szymanski-PT-b06-LTLCardinality-14
Product exploration explored 100000 steps with 2 reset in 372 ms.
Product exploration explored 100000 steps with 9 reset in 432 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 101 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter sensitive) to 4 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40006 steps (8 resets) in 230 ms. (173 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (13 resets) in 144 ms. (275 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (13 resets) in 133 ms. (298 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (13 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
[2024-05-30 17:48:54] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:48:54] [INFO ] Invariant cache hit.
[2024-05-30 17:48:54] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 303/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3037 variables, 147/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 0 solved, 3 unsolved in 724 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 303/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2650 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 3409ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 217 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 218 ms. Remains : 305/305 places, 7809/7936 transitions.
RANDOM walk for 40010 steps (8 resets) in 143 ms. (277 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 170351 steps, run timeout after 3003 ms. (steps per millisecond=56 ) properties seen :0 out of 2
Probabilistic random walk after 170351 steps, saw 82025 distinct states, run finished after 3004 ms. (steps per millisecond=56 ) properties seen :0
[2024-05-30 17:49:01] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2024-05-30 17:49:01] [INFO ] Computed 2 invariants in 13 ms
[2024-05-30 17:49:01] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 284/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/305 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2605/2910 variables, 305/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2910 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2910 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2910 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2910/2910 variables, and 454 constraints, problems are : Problem set: 0 solved, 2 unsolved in 636 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 284/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 17:49:02] [INFO ] Deduced a trap composed of 44 places in 351 ms of which 2 ms to minimize.
[2024-05-30 17:49:02] [INFO ] Deduced a trap composed of 74 places in 336 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 19/305 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2605/2910 variables, 305/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2910 variables, 147/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2910 variables, 2/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2910 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/2910 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2910/2910 variables, and 458 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2688 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 3365ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 185 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 177 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2024-05-30 17:49:05] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-30 17:49:05] [INFO ] Invariant cache hit.
[2024-05-30 17:49:05] [INFO ] Implicit Places using invariants in 452 ms returned []
[2024-05-30 17:49:05] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-30 17:49:05] [INFO ] Invariant cache hit.
[2024-05-30 17:49:05] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 17:49:35] [INFO ] Implicit Places using invariants and state equation in 30212 ms returned []
Implicit Place search using SMT with State Equation took 30665 ms to find 0 implicit places.
[2024-05-30 17:49:36] [INFO ] Redundant transitions in 782 ms returned []
Running 7807 sub problems to find dead transitions.
[2024-05-30 17:49:36] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-30 17:49:36] [INFO ] Invariant cache hit.
[2024-05-30 17:49:36] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7807 unsolved
SMT process timed out in 58725ms, After SMT, problems are : Problem set: 0 solved, 7807 unsolved
Search for dead transitions found 0 dead transitions in 58789ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90445 ms. Remains : 305/305 places, 7809/7809 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p1)), (G (OR p1 p0))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p0)))), (F (NOT p1)), (F (NOT (AND p1 p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 194 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 25 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 250 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false, false]
Stuttering acceptance computed with spot in 267 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false, false]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 296 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-30 17:50:36] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-30 17:50:36] [INFO ] Computed 1 invariants in 23 ms
[2024-05-30 17:50:36] [INFO ] Implicit Places using invariants in 457 ms returned []
[2024-05-30 17:50:36] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:50:36] [INFO ] Invariant cache hit.
[2024-05-30 17:50:37] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 17:50:54] [INFO ] Implicit Places using invariants and state equation in 17472 ms returned []
Implicit Place search using SMT with State Equation took 17931 ms to find 0 implicit places.
[2024-05-30 17:50:54] [INFO ] Redundant transitions in 637 ms returned []
Running 7934 sub problems to find dead transitions.
[2024-05-30 17:50:54] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:50:54] [INFO ] Invariant cache hit.
[2024-05-30 17:50:54] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30089 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30092 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints]
After SMT, in 89644ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 89708ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 108597 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 122 ms. Reduced automaton from 7 states, 25 edges and 2 AP (stutter insensitive) to 9 states, 32 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 346 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false, false, (AND p0 (NOT p1)), false]
RANDOM walk for 40004 steps (10 resets) in 183 ms. (217 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (15 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (14 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (13 resets) in 61 ms. (645 steps per ms) remains 3/3 properties
[2024-05-30 17:52:25] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:52:25] [INFO ] Invariant cache hit.
[2024-05-30 17:52:25] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 303/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3037 variables, 147/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 0 solved, 3 unsolved in 833 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 303/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2713 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 3573ms problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 211 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 212 ms. Remains : 305/305 places, 7809/7936 transitions.
RANDOM walk for 40012 steps (8 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 161444 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 2
Probabilistic random walk after 161444 steps, saw 80785 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
[2024-05-30 17:52:32] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2024-05-30 17:52:32] [INFO ] Computed 2 invariants in 18 ms
[2024-05-30 17:52:32] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 284/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/305 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2605/2910 variables, 305/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2910 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2910 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2910 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2910/2910 variables, and 454 constraints, problems are : Problem set: 0 solved, 2 unsolved in 636 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 284/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 17:52:33] [INFO ] Deduced a trap composed of 44 places in 355 ms of which 2 ms to minimize.
[2024-05-30 17:52:33] [INFO ] Deduced a trap composed of 74 places in 343 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 19/305 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2605/2910 variables, 305/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2910 variables, 147/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2910 variables, 2/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 17:52:36] [INFO ] Deduced a trap composed of 103 places in 376 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2910 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2910 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2910 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2910/2910 variables, and 459 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3624 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 4306ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 178 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 176 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2024-05-30 17:52:36] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-30 17:52:36] [INFO ] Invariant cache hit.
[2024-05-30 17:52:37] [INFO ] Implicit Places using invariants in 459 ms returned []
[2024-05-30 17:52:37] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-30 17:52:37] [INFO ] Invariant cache hit.
[2024-05-30 17:52:37] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 17:53:07] [INFO ] Performed 302/305 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-30 17:53:08] [INFO ] Implicit Places using invariants and state equation in 31230 ms returned []
Implicit Place search using SMT with State Equation took 31691 ms to find 0 implicit places.
[2024-05-30 17:53:09] [INFO ] Redundant transitions in 841 ms returned []
Running 7807 sub problems to find dead transitions.
[2024-05-30 17:53:09] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-30 17:53:09] [INFO ] Invariant cache hit.
[2024-05-30 17:53:09] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7807 unsolved
SMT process timed out in 58713ms, After SMT, problems are : Problem set: 0 solved, 7807 unsolved
Search for dead transitions found 0 dead transitions in 58777ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91505 ms. Remains : 305/305 places, 7809/7809 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 267 ms. Reduced automaton from 9 states, 32 edges and 2 AP (stutter insensitive) to 9 states, 32 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 331 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false, false, (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 323 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false, false, (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 428 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false, false, (AND p0 (NOT p1)), false]
Product exploration explored 100000 steps with 0 reset in 430 ms.
Product exploration explored 100000 steps with 5 reset in 402 ms.
Built C files in :
/tmp/ltsmin15304839023990444245
[2024-05-30 17:54:10] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2024-05-30 17:54:10] [INFO ] Built C files in 101ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15304839023990444245
Running compilation step : cd /tmp/ltsmin15304839023990444245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15304839023990444245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15304839023990444245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 192 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-30 17:54:13] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-30 17:54:13] [INFO ] Computed 1 invariants in 19 ms
[2024-05-30 17:54:14] [INFO ] Implicit Places using invariants in 447 ms returned []
[2024-05-30 17:54:14] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:54:14] [INFO ] Invariant cache hit.
[2024-05-30 17:54:15] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 17:54:32] [INFO ] Implicit Places using invariants and state equation in 17961 ms returned []
Implicit Place search using SMT with State Equation took 18409 ms to find 0 implicit places.
[2024-05-30 17:54:32] [INFO ] Redundant transitions in 734 ms returned []
Running 7934 sub problems to find dead transitions.
[2024-05-30 17:54:32] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:54:32] [INFO ] Invariant cache hit.
[2024-05-30 17:54:33] [INFO ] State equation strengthened by 147 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30089 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30100 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints]
After SMT, in 90113ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 90178ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 109531 ms. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin18122171123479401266
[2024-05-30 17:56:03] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2024-05-30 17:56:03] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18122171123479401266
Running compilation step : cd /tmp/ltsmin18122171123479401266;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18122171123479401266;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18122171123479401266;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-30 17:56:06] [INFO ] Flatten gal took : 195 ms
[2024-05-30 17:56:06] [INFO ] Flatten gal took : 192 ms
[2024-05-30 17:56:06] [INFO ] Time to serialize gal into /tmp/LTL8384617239594325128.gal : 54 ms
[2024-05-30 17:56:06] [INFO ] Time to serialize properties into /tmp/LTL8230136547809975168.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8384617239594325128.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9043013749423570516.hoa' '-atoms' '/tmp/LTL8230136547809975168.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL8230136547809975168.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9043013749423570516.hoa
Detected timeout of ITS tools.
[2024-05-30 17:56:22] [INFO ] Flatten gal took : 178 ms
[2024-05-30 17:56:22] [INFO ] Flatten gal took : 184 ms
[2024-05-30 17:56:22] [INFO ] Time to serialize gal into /tmp/LTL16608704286951543519.gal : 25 ms
[2024-05-30 17:56:22] [INFO ] Time to serialize properties into /tmp/LTL16954274616755162623.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16608704286951543519.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16954274616755162623.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(("(p138<=0)")&&(X(X(G("(p56<=0)")))))))
Formula 0 simplified : G(!"(p138<=0)" | XXF!"(p56<=0)")
Detected timeout of ITS tools.
[2024-05-30 17:56:37] [INFO ] Flatten gal took : 178 ms
[2024-05-30 17:56:37] [INFO ] Applying decomposition
[2024-05-30 17:56:37] [INFO ] Flatten gal took : 179 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12862539121034985379.txt' '-o' '/tmp/graph12862539121034985379.bin' '-w' '/tmp/graph12862539121034985379.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12862539121034985379.bin' '-l' '-1' '-v' '-w' '/tmp/graph12862539121034985379.weights' '-q' '0' '-e' '0.001'
[2024-05-30 17:56:38] [INFO ] Decomposing Gal with order
[2024-05-30 17:56:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 17:56:39] [INFO ] Removed a total of 18365 redundant transitions.
[2024-05-30 17:56:39] [INFO ] Flatten gal took : 630 ms
[2024-05-30 17:56:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 1092 labels/synchronizations in 350 ms.
[2024-05-30 17:56:39] [INFO ] Time to serialize gal into /tmp/LTL15751246364456016434.gal : 33 ms
[2024-05-30 17:56:39] [INFO ] Time to serialize properties into /tmp/LTL8301142746033000642.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15751246364456016434.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8301142746033000642.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(("(i3.u56.p138<=0)")&&(X(X(G("(i7.i0.u18.p56<=0)")))))))
Formula 0 simplified : G(!"(i3.u56.p138<=0)" | XXF!"(i7.i0.u18.p56<=0)")
Detected timeout of ITS tools.
Treatment of property Szymanski-PT-b06-LTLCardinality-14 finished in 588940 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&&X(X(G(p1))))))'
Found a Lengthening insensitive property : Szymanski-PT-b06-LTLCardinality-14
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 44 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-30 17:56:55] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:56:55] [INFO ] Invariant cache hit.
[2024-05-30 17:56:55] [INFO ] Implicit Places using invariants in 462 ms returned []
[2024-05-30 17:56:55] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:56:55] [INFO ] Invariant cache hit.
[2024-05-30 17:56:56] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 17:57:13] [INFO ] Implicit Places using invariants and state equation in 18061 ms returned []
Implicit Place search using SMT with State Equation took 18526 ms to find 0 implicit places.
Running 7934 sub problems to find dead transitions.
[2024-05-30 17:57:13] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:57:13] [INFO ] Invariant cache hit.
[2024-05-30 17:57:13] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30087 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30091 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints]
After SMT, in 89521ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 89584ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 108163 ms. Remains : 305/305 places, 7936/7936 transitions.
Running random walk in product with property : Szymanski-PT-b06-LTLCardinality-14
Product exploration explored 100000 steps with 3 reset in 415 ms.
Product exploration explored 100000 steps with 1 reset in 449 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 157 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter sensitive) to 4 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40003 steps (12 resets) in 116 ms. (341 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (10 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (9 resets) in 107 ms. (370 steps per ms) remains 1/3 properties
[2024-05-30 17:58:44] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:58:44] [INFO ] Invariant cache hit.
[2024-05-30 17:58:44] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 303/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3037 variables, 147/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 0 solved, 1 unsolved in 642 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 303/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 3037/3037 variables, and 306 constraints, problems are : Problem set: 1 solved, 0 unsolved in 601 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1267ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p1)), (G (OR p1 p0))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p0)))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p1) p0))), (F (NOT (AND p1 p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 264 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 25 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 263 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false, false]
Stuttering acceptance computed with spot in 278 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false, false]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 178 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-30 17:58:46] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:58:46] [INFO ] Invariant cache hit.
[2024-05-30 17:58:47] [INFO ] Implicit Places using invariants in 433 ms returned []
[2024-05-30 17:58:47] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:58:47] [INFO ] Invariant cache hit.
[2024-05-30 17:58:48] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 17:59:05] [INFO ] Implicit Places using invariants and state equation in 18031 ms returned []
Implicit Place search using SMT with State Equation took 18468 ms to find 0 implicit places.
[2024-05-30 17:59:06] [INFO ] Redundant transitions in 645 ms returned []
Running 7934 sub problems to find dead transitions.
[2024-05-30 17:59:06] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:59:06] [INFO ] Invariant cache hit.
[2024-05-30 17:59:06] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30098 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30086 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints]
After SMT, in 90102ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 90166ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 109484 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 159 ms. Reduced automaton from 7 states, 25 edges and 2 AP (stutter insensitive) to 9 states, 32 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 352 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false, false, (AND p0 (NOT p1)), false]
RANDOM walk for 40007 steps (10 resets) in 195 ms. (204 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (11 resets) in 92 ms. (430 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (9 resets) in 96 ms. (412 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (14 resets) in 97 ms. (408 steps per ms) remains 3/3 properties
[2024-05-30 18:00:36] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 18:00:36] [INFO ] Invariant cache hit.
[2024-05-30 18:00:36] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 303/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3037 variables, 147/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 0 solved, 3 unsolved in 878 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 303/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2574 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 3476ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 188 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 305/305 places, 7809/7936 transitions.
RANDOM walk for 40009 steps (8 resets) in 223 ms. (178 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 175613 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 2
Probabilistic random walk after 175613 steps, saw 82839 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
[2024-05-30 18:00:43] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2024-05-30 18:00:43] [INFO ] Computed 2 invariants in 23 ms
[2024-05-30 18:00:43] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 284/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/305 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2605/2910 variables, 305/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2910 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2910 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2910 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2910/2910 variables, and 454 constraints, problems are : Problem set: 0 solved, 2 unsolved in 656 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 284/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 18:00:44] [INFO ] Deduced a trap composed of 44 places in 358 ms of which 2 ms to minimize.
[2024-05-30 18:00:45] [INFO ] Deduced a trap composed of 74 places in 332 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 19/305 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2605/2910 variables, 305/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2910 variables, 147/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2910 variables, 2/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 18:00:47] [INFO ] Deduced a trap composed of 103 places in 381 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2910 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2910 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2910 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2910/2910 variables, and 459 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3592 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 4291ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 169 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 169 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2024-05-30 18:00:48] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-30 18:00:48] [INFO ] Invariant cache hit.
[2024-05-30 18:00:48] [INFO ] Implicit Places using invariants in 439 ms returned []
[2024-05-30 18:00:48] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-30 18:00:48] [INFO ] Invariant cache hit.
[2024-05-30 18:00:49] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 18:01:18] [INFO ] Implicit Places using invariants and state equation in 30117 ms returned []
Implicit Place search using SMT with State Equation took 30557 ms to find 0 implicit places.
[2024-05-30 18:01:19] [INFO ] Redundant transitions in 631 ms returned []
Running 7807 sub problems to find dead transitions.
[2024-05-30 18:01:19] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-30 18:01:19] [INFO ] Invariant cache hit.
[2024-05-30 18:01:19] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7807 unsolved
SMT process timed out in 58346ms, After SMT, problems are : Problem set: 0 solved, 7807 unsolved
Search for dead transitions found 0 dead transitions in 58407ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89786 ms. Remains : 305/305 places, 7809/7809 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 256 ms. Reduced automaton from 9 states, 32 edges and 2 AP (stutter insensitive) to 9 states, 32 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 340 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false, false, (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 330 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false, false, (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 330 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false, false, (AND p0 (NOT p1)), false]
Product exploration explored 100000 steps with 7 reset in 373 ms.
Product exploration explored 100000 steps with 0 reset in 373 ms.
Built C files in :
/tmp/ltsmin11269548500893597632
[2024-05-30 18:02:20] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2024-05-30 18:02:20] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11269548500893597632
Running compilation step : cd /tmp/ltsmin11269548500893597632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11269548500893597632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11269548500893597632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 175 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-30 18:02:23] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-30 18:02:23] [INFO ] Computed 1 invariants in 24 ms
[2024-05-30 18:02:23] [INFO ] Implicit Places using invariants in 458 ms returned []
[2024-05-30 18:02:23] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 18:02:23] [INFO ] Invariant cache hit.
[2024-05-30 18:02:24] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 18:02:41] [INFO ] Implicit Places using invariants and state equation in 17602 ms returned []
Implicit Place search using SMT with State Equation took 18064 ms to find 0 implicit places.
[2024-05-30 18:02:42] [INFO ] Redundant transitions in 640 ms returned []
Running 7934 sub problems to find dead transitions.
[2024-05-30 18:02:42] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 18:02:42] [INFO ] Invariant cache hit.
[2024-05-30 18:02:42] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30088 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30090 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints]
After SMT, in 89525ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 89586ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 108484 ms. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin11991126280809897777
[2024-05-30 18:04:11] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2024-05-30 18:04:11] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11991126280809897777
Running compilation step : cd /tmp/ltsmin11991126280809897777;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11991126280809897777;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11991126280809897777;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-30 18:04:15] [INFO ] Flatten gal took : 186 ms
[2024-05-30 18:04:15] [INFO ] Flatten gal took : 178 ms
[2024-05-30 18:04:15] [INFO ] Time to serialize gal into /tmp/LTL8893438260946631305.gal : 29 ms
[2024-05-30 18:04:15] [INFO ] Time to serialize properties into /tmp/LTL6427656329985297364.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8893438260946631305.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3279130291765032512.hoa' '-atoms' '/tmp/LTL6427656329985297364.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6427656329985297364.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3279130291765032512.hoa
Detected timeout of ITS tools.
[2024-05-30 18:04:30] [INFO ] Flatten gal took : 171 ms
[2024-05-30 18:04:30] [INFO ] Flatten gal took : 179 ms
[2024-05-30 18:04:30] [INFO ] Time to serialize gal into /tmp/LTL8776572879329731056.gal : 25 ms
[2024-05-30 18:04:30] [INFO ] Time to serialize properties into /tmp/LTL1559346587632197750.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8776572879329731056.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1559346587632197750.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(("(p138<=0)")&&(X(X(G("(p56<=0)")))))))
Formula 0 simplified : G(!"(p138<=0)" | XXF!"(p56<=0)")
Detected timeout of ITS tools.
[2024-05-30 18:04:45] [INFO ] Flatten gal took : 185 ms
[2024-05-30 18:04:45] [INFO ] Applying decomposition
[2024-05-30 18:04:46] [INFO ] Flatten gal took : 181 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11402398591264562772.txt' '-o' '/tmp/graph11402398591264562772.bin' '-w' '/tmp/graph11402398591264562772.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11402398591264562772.bin' '-l' '-1' '-v' '-w' '/tmp/graph11402398591264562772.weights' '-q' '0' '-e' '0.001'
[2024-05-30 18:04:46] [INFO ] Decomposing Gal with order
[2024-05-30 18:04:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 18:04:46] [INFO ] Removed a total of 18142 redundant transitions.
[2024-05-30 18:04:46] [INFO ] Flatten gal took : 328 ms
[2024-05-30 18:04:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 1180 labels/synchronizations in 181 ms.
[2024-05-30 18:04:47] [INFO ] Time to serialize gal into /tmp/LTL14252302976579909354.gal : 27 ms
[2024-05-30 18:04:47] [INFO ] Time to serialize properties into /tmp/LTL9297592977776095077.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14252302976579909354.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9297592977776095077.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(("(i5.i1.u49.p138<=0)")&&(X(X(G("(i5.i0.u18.p56<=0)")))))))
Formula 0 simplified : G(!"(i5.i1.u49.p138<=0)" | XXF!"(i5.i0.u18.p56<=0)")
Detected timeout of ITS tools.
Treatment of property Szymanski-PT-b06-LTLCardinality-14 finished in 487514 ms.
[2024-05-30 18:05:02] [INFO ] Flatten gal took : 172 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12127755586467632386
[2024-05-30 18:05:02] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2024-05-30 18:05:02] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12127755586467632386
Running compilation step : cd /tmp/ltsmin12127755586467632386;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-30 18:05:02] [INFO ] Applying decomposition
[2024-05-30 18:05:02] [INFO ] Flatten gal took : 178 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15103298321012577144.txt' '-o' '/tmp/graph15103298321012577144.bin' '-w' '/tmp/graph15103298321012577144.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15103298321012577144.bin' '-l' '-1' '-v' '-w' '/tmp/graph15103298321012577144.weights' '-q' '0' '-e' '0.001'
[2024-05-30 18:05:03] [INFO ] Decomposing Gal with order
[2024-05-30 18:05:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 18:05:03] [INFO ] Removed a total of 17839 redundant transitions.
[2024-05-30 18:05:03] [INFO ] Flatten gal took : 325 ms
[2024-05-30 18:05:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 1173 labels/synchronizations in 185 ms.
[2024-05-30 18:05:03] [INFO ] Time to serialize gal into /tmp/LTLCardinality8250946023868113328.gal : 31 ms
[2024-05-30 18:05:03] [INFO ] Time to serialize properties into /tmp/LTLCardinality11958808465255957445.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8250946023868113328.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11958808465255957445.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(("(i5.u48.p138<=0)")&&(X(X(G("(i8.u19.p56<=0)")))))))
Formula 0 simplified : G(!"(i5.u48.p138<=0)" | XXF!"(i8.u19.p56<=0)")
Compilation finished in 38759 ms.
Running link step : cd /tmp/ltsmin12127755586467632386;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 203 ms.
Running LTSmin : cd /tmp/ltsmin12127755586467632386;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp0==true)&&X(X([]((LTLAPp1==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-30 18:34:22] [INFO ] Flatten gal took : 455 ms
[2024-05-30 18:34:22] [INFO ] Time to serialize gal into /tmp/LTLCardinality4348135120816184878.gal : 79 ms
[2024-05-30 18:34:22] [INFO ] Time to serialize properties into /tmp/LTLCardinality12066917234810608804.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4348135120816184878.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12066917234810608804.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((F(("(p138<=0)")&&(X(X(G("(p56<=0)")))))))
Formula 0 simplified : G(!"(p138<=0)" | XXF!"(p56<=0)")
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Szymanski-PT-b06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is Szymanski-PT-b06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690533300875"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-b06.tgz
mv Szymanski-PT-b06 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;