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.r544-smll-171701111200283.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 ltsminxred
Input is Vasy2003-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r544-smll-171701111200283
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 08:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 12 08:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 07:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 12 07:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 207K 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 Vasy2003-PT-none-LTLCardinality-00
FORMULA_NAME Vasy2003-PT-none-LTLCardinality-01
FORMULA_NAME Vasy2003-PT-none-LTLCardinality-02
FORMULA_NAME Vasy2003-PT-none-LTLCardinality-03
FORMULA_NAME Vasy2003-PT-none-LTLCardinality-04
FORMULA_NAME Vasy2003-PT-none-LTLCardinality-05
FORMULA_NAME Vasy2003-PT-none-LTLCardinality-06
FORMULA_NAME Vasy2003-PT-none-LTLCardinality-07
FORMULA_NAME Vasy2003-PT-none-LTLCardinality-08
FORMULA_NAME Vasy2003-PT-none-LTLCardinality-09
FORMULA_NAME Vasy2003-PT-none-LTLCardinality-10
FORMULA_NAME Vasy2003-PT-none-LTLCardinality-11
FORMULA_NAME Vasy2003-PT-none-LTLCardinality-12
FORMULA_NAME Vasy2003-PT-none-LTLCardinality-13
FORMULA_NAME Vasy2003-PT-none-LTLCardinality-14
FORMULA_NAME Vasy2003-PT-none-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717281656440

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Vasy2003-PT-none
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 22:40:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 22:40:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 22:40:58] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2024-06-01 22:40:58] [INFO ] Transformed 485 places.
[2024-06-01 22:40:58] [INFO ] Transformed 776 transitions.
[2024-06-01 22:40:58] [INFO ] Found NUPN structural information;
[2024-06-01 22:40:58] [INFO ] Parsed PT model containing 485 places and 776 transitions and 2809 arcs in 359 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 116 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
FORMULA Vasy2003-PT-none-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Vasy2003-PT-none-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Vasy2003-PT-none-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Vasy2003-PT-none-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Vasy2003-PT-none-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 752/752 transitions.
Discarding 130 places :
Symmetric choice reduction at 0 with 130 rule applications. Total rules 130 place count 355 transition count 622
Iterating global reduction 0 with 130 rules applied. Total rules applied 260 place count 355 transition count 622
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 291 place count 355 transition count 591
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 354 place count 292 transition count 512
Iterating global reduction 1 with 63 rules applied. Total rules applied 417 place count 292 transition count 512
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 460 place count 292 transition count 469
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 497 place count 255 transition count 414
Iterating global reduction 2 with 37 rules applied. Total rules applied 534 place count 255 transition count 414
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 561 place count 255 transition count 387
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 573 place count 243 transition count 367
Iterating global reduction 3 with 12 rules applied. Total rules applied 585 place count 243 transition count 367
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 591 place count 243 transition count 361
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 592 place count 243 transition count 360
Applied a total of 592 rules in 164 ms. Remains 243 /485 variables (removed 242) and now considering 360/752 (removed 392) transitions.
[2024-06-01 22:40:59] [INFO ] Flow matrix only has 326 transitions (discarded 34 similar events)
// Phase 1: matrix 326 rows 243 cols
[2024-06-01 22:40:59] [INFO ] Computed 66 invariants in 35 ms
[2024-06-01 22:40:59] [INFO ] Implicit Places using invariants in 740 ms returned [93, 96, 99, 102, 103, 104, 105, 106, 107, 217]
Discarding 10 places :
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Implicit Place search using SMT only with invariants took 819 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 233/485 places, 356/752 transitions.
Applied a total of 0 rules in 7 ms. Remains 233 /233 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1025 ms. Remains : 233/485 places, 356/752 transitions.
Support contains 45 out of 233 places after structural reductions.
[2024-06-01 22:41:00] [INFO ] Flatten gal took : 90 ms
[2024-06-01 22:41:00] [INFO ] Flatten gal took : 48 ms
[2024-06-01 22:41:00] [INFO ] Input system was already deterministic with 356 transitions.
Support contains 40 out of 233 places (down from 45) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1806 ms. (22 steps per ms) remains 4/21 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 169 ms. (235 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 4/4 properties
[2024-06-01 22:41:01] [INFO ] Flow matrix only has 326 transitions (discarded 30 similar events)
// Phase 1: matrix 326 rows 233 cols
[2024-06-01 22:41:01] [INFO ] Computed 56 invariants in 14 ms
[2024-06-01 22:41:01] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 102/110 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 121/231 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/233 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 325/558 variables, 233/289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 41/330 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/559 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/559 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/559 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 331 constraints, problems are : Problem set: 0 solved, 4 unsolved in 734 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 233/233 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 102/110 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 121/231 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/233 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 325/558 variables, 233/289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 41/330 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 4/334 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/558 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/559 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/559 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/559 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 559/559 variables, and 335 constraints, problems are : Problem set: 0 solved, 4 unsolved in 685 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 233/233 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1475ms problems are : Problem set: 0 solved, 4 unsolved
Finished Parikh walk after 133 steps, including 1 resets, run visited all 4 properties in 5 ms. (steps per millisecond=26 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 26 ms.
Computed a total of 1 stabilizing places and 1 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((G(p0)&&F(p1))))'
Support contains 4 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 356/356 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 205 transition count 322
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 205 transition count 322
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 75 place count 205 transition count 303
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 90 place count 190 transition count 284
Iterating global reduction 1 with 15 rules applied. Total rules applied 105 place count 190 transition count 284
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 115 place count 190 transition count 274
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 122 place count 183 transition count 262
Iterating global reduction 2 with 7 rules applied. Total rules applied 129 place count 183 transition count 262
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 138 place count 183 transition count 253
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 141 place count 180 transition count 235
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 180 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 145 place count 180 transition count 234
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 147 place count 178 transition count 231
Iterating global reduction 4 with 2 rules applied. Total rules applied 149 place count 178 transition count 231
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 151 place count 178 transition count 229
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 152 place count 177 transition count 227
Iterating global reduction 5 with 1 rules applied. Total rules applied 153 place count 177 transition count 227
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 154 place count 176 transition count 224
Iterating global reduction 5 with 1 rules applied. Total rules applied 155 place count 176 transition count 224
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 156 place count 175 transition count 221
Iterating global reduction 5 with 1 rules applied. Total rules applied 157 place count 175 transition count 221
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 158 place count 174 transition count 219
Iterating global reduction 5 with 1 rules applied. Total rules applied 159 place count 174 transition count 219
Applied a total of 159 rules in 35 ms. Remains 174 /233 variables (removed 59) and now considering 219/356 (removed 137) transitions.
[2024-06-01 22:41:03] [INFO ] Flow matrix only has 196 transitions (discarded 23 similar events)
// Phase 1: matrix 196 rows 174 cols
[2024-06-01 22:41:03] [INFO ] Computed 56 invariants in 2 ms
[2024-06-01 22:41:03] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-06-01 22:41:03] [INFO ] Flow matrix only has 196 transitions (discarded 23 similar events)
[2024-06-01 22:41:03] [INFO ] Invariant cache hit.
[2024-06-01 22:41:03] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-01 22:41:03] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-06-01 22:41:03] [INFO ] Flow matrix only has 196 transitions (discarded 23 similar events)
[2024-06-01 22:41:03] [INFO ] Invariant cache hit.
[2024-06-01 22:41:03] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/174 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 22:41:07] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 10 ms to minimize.
[2024-06-01 22:41:07] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 195/369 variables, 174/232 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 34/266 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 1/370 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 11 (OVERLAPS) 0/370 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 267 constraints, problems are : Problem set: 0 solved, 218 unsolved in 12649 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 174/174 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/174 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 195/369 variables, 174/232 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 34/266 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 218/484 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 22:41:21] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 11 (OVERLAPS) 1/370 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 13 (OVERLAPS) 0/370 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 486 constraints, problems are : Problem set: 0 solved, 218 unsolved in 19255 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 174/174 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 3/3 constraints]
After SMT, in 32053ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 32061ms
Starting structural reductions in LTL mode, iteration 1 : 174/233 places, 219/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32596 ms. Remains : 174/233 places, 219/356 transitions.
Stuttering acceptance computed with spot in 349 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Vasy2003-PT-none-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Vasy2003-PT-none-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Vasy2003-PT-none-LTLCardinality-01 finished in 33033 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(G(p0))))'
Support contains 2 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 356/356 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 204 transition count 319
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 204 transition count 319
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 78 place count 204 transition count 299
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 93 place count 189 transition count 280
Iterating global reduction 1 with 15 rules applied. Total rules applied 108 place count 189 transition count 280
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 118 place count 189 transition count 270
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 125 place count 182 transition count 258
Iterating global reduction 2 with 7 rules applied. Total rules applied 132 place count 182 transition count 258
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 141 place count 182 transition count 249
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 142 place count 181 transition count 243
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 place count 181 transition count 243
Applied a total of 143 rules in 15 ms. Remains 181 /233 variables (removed 52) and now considering 243/356 (removed 113) transitions.
[2024-06-01 22:41:36] [INFO ] Flow matrix only has 222 transitions (discarded 21 similar events)
// Phase 1: matrix 222 rows 181 cols
[2024-06-01 22:41:36] [INFO ] Computed 56 invariants in 11 ms
[2024-06-01 22:41:36] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-06-01 22:41:36] [INFO ] Flow matrix only has 222 transitions (discarded 21 similar events)
[2024-06-01 22:41:36] [INFO ] Invariant cache hit.
[2024-06-01 22:41:36] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 22:41:36] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-06-01 22:41:36] [INFO ] Flow matrix only has 222 transitions (discarded 21 similar events)
[2024-06-01 22:41:36] [INFO ] Invariant cache hit.
[2024-06-01 22:41:36] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/181 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 22:41:39] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 2 ms to minimize.
[2024-06-01 22:41:40] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-06-01 22:41:40] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 221/402 variables, 181/240 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 32/272 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 1/403 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 11 (OVERLAPS) 0/403 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 273 constraints, problems are : Problem set: 0 solved, 242 unsolved in 14076 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 181/181 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/181 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 221/402 variables, 181/240 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 32/272 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 242/514 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (OVERLAPS) 1/403 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/403 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (OVERLAPS) 0/403 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 515 constraints, problems are : Problem set: 0 solved, 242 unsolved in 18656 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 181/181 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 3/3 constraints]
After SMT, in 32842ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 32847ms
Starting structural reductions in LTL mode, iteration 1 : 181/233 places, 243/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33401 ms. Remains : 181/233 places, 243/356 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Vasy2003-PT-none-LTLCardinality-02
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Vasy2003-PT-none-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Vasy2003-PT-none-LTLCardinality-02 finished in 33545 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U X(G(!p0))))'
Support contains 3 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 356/356 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 202 transition count 317
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 202 transition count 317
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 82 place count 202 transition count 297
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 98 place count 186 transition count 276
Iterating global reduction 1 with 16 rules applied. Total rules applied 114 place count 186 transition count 276
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 125 place count 186 transition count 265
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 132 place count 179 transition count 253
Iterating global reduction 2 with 7 rules applied. Total rules applied 139 place count 179 transition count 253
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 148 place count 179 transition count 244
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 149 place count 178 transition count 238
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 178 transition count 238
Applied a total of 150 rules in 15 ms. Remains 178 /233 variables (removed 55) and now considering 238/356 (removed 118) transitions.
[2024-06-01 22:42:09] [INFO ] Flow matrix only has 217 transitions (discarded 21 similar events)
// Phase 1: matrix 217 rows 178 cols
[2024-06-01 22:42:09] [INFO ] Computed 56 invariants in 3 ms
[2024-06-01 22:42:09] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-06-01 22:42:09] [INFO ] Flow matrix only has 217 transitions (discarded 21 similar events)
[2024-06-01 22:42:09] [INFO ] Invariant cache hit.
[2024-06-01 22:42:10] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 22:42:10] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
Running 237 sub problems to find dead transitions.
[2024-06-01 22:42:10] [INFO ] Flow matrix only has 217 transitions (discarded 21 similar events)
[2024-06-01 22:42:10] [INFO ] Invariant cache hit.
[2024-06-01 22:42:10] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-06-01 22:42:12] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 2 ms to minimize.
[2024-06-01 22:42:12] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (OVERLAPS) 216/394 variables, 178/236 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 32/268 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 8 (OVERLAPS) 1/395 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 10 (OVERLAPS) 0/395 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 269 constraints, problems are : Problem set: 0 solved, 237 unsolved in 12234 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 178/178 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (OVERLAPS) 216/394 variables, 178/236 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 32/268 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 237/505 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-06-01 22:42:28] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-06-01 22:42:28] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 2/507 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-06-01 22:42:30] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 11 (OVERLAPS) 1/395 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/395 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 13 (OVERLAPS) 0/395 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 509 constraints, problems are : Problem set: 0 solved, 237 unsolved in 24436 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 178/178 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 5/5 constraints]
After SMT, in 36770ms problems are : Problem set: 0 solved, 237 unsolved
Search for dead transitions found 0 dead transitions in 36773ms
Starting structural reductions in LTL mode, iteration 1 : 178/233 places, 238/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37318 ms. Remains : 178/233 places, 238/356 transitions.
Stuttering acceptance computed with spot in 170 ms :[p0, (AND p0 (NOT p1)), p0, true, (NOT p1)]
Running random walk in product with property : Vasy2003-PT-none-LTLCardinality-03
Stuttering criterion allowed to conclude after 479 steps with 0 reset in 13 ms.
FORMULA Vasy2003-PT-none-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Vasy2003-PT-none-LTLCardinality-03 finished in 37524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0&&G((p0 U p1)))) U p0)))'
Support contains 3 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 356/356 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 205 transition count 322
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 205 transition count 322
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 74 place count 205 transition count 304
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 90 place count 189 transition count 283
Iterating global reduction 1 with 16 rules applied. Total rules applied 106 place count 189 transition count 283
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 119 place count 189 transition count 270
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 125 place count 183 transition count 260
Iterating global reduction 2 with 6 rules applied. Total rules applied 131 place count 183 transition count 260
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 139 place count 183 transition count 252
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 141 place count 181 transition count 240
Iterating global reduction 3 with 2 rules applied. Total rules applied 143 place count 181 transition count 240
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 144 place count 180 transition count 238
Iterating global reduction 3 with 1 rules applied. Total rules applied 145 place count 180 transition count 238
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 146 place count 179 transition count 236
Iterating global reduction 3 with 1 rules applied. Total rules applied 147 place count 179 transition count 236
Applied a total of 147 rules in 19 ms. Remains 179 /233 variables (removed 54) and now considering 236/356 (removed 120) transitions.
[2024-06-01 22:42:47] [INFO ] Flow matrix only has 214 transitions (discarded 22 similar events)
// Phase 1: matrix 214 rows 179 cols
[2024-06-01 22:42:47] [INFO ] Computed 56 invariants in 2 ms
[2024-06-01 22:42:47] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-06-01 22:42:47] [INFO ] Flow matrix only has 214 transitions (discarded 22 similar events)
[2024-06-01 22:42:47] [INFO ] Invariant cache hit.
[2024-06-01 22:42:47] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-06-01 22:42:47] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
Running 235 sub problems to find dead transitions.
[2024-06-01 22:42:47] [INFO ] Flow matrix only has 214 transitions (discarded 22 similar events)
[2024-06-01 22:42:47] [INFO ] Invariant cache hit.
[2024-06-01 22:42:47] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (OVERLAPS) 1/179 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-06-01 22:42:51] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 2 ms to minimize.
[2024-06-01 22:42:51] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 2 ms to minimize.
[2024-06-01 22:42:51] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (OVERLAPS) 213/392 variables, 179/238 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 33/271 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-06-01 22:42:55] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 10 (OVERLAPS) 1/393 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/393 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 12 (OVERLAPS) 0/393 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 235 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 273 constraints, problems are : Problem set: 0 solved, 235 unsolved in 18963 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 179/179 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 235 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (OVERLAPS) 1/179 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (OVERLAPS) 213/392 variables, 179/239 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 33/272 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 235/507 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 10 (OVERLAPS) 1/393 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-06-01 22:43:17] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/393 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/393 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 13 (OVERLAPS) 0/393 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 235 unsolved
No progress, stopping.
After SMT solving in domain Int declared 393/393 variables, and 509 constraints, problems are : Problem set: 0 solved, 235 unsolved in 21157 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 179/179 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 5/5 constraints]
After SMT, in 40194ms problems are : Problem set: 0 solved, 235 unsolved
Search for dead transitions found 0 dead transitions in 40197ms
Starting structural reductions in LTL mode, iteration 1 : 179/233 places, 236/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40767 ms. Remains : 179/233 places, 236/356 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Vasy2003-PT-none-LTLCardinality-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Vasy2003-PT-none-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Vasy2003-PT-none-LTLCardinality-04 finished in 40997 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 356/356 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 206 transition count 322
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 206 transition count 322
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 72 place count 206 transition count 304
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 86 place count 192 transition count 285
Iterating global reduction 1 with 14 rules applied. Total rules applied 100 place count 192 transition count 285
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 111 place count 192 transition count 274
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 116 place count 187 transition count 265
Iterating global reduction 2 with 5 rules applied. Total rules applied 121 place count 187 transition count 265
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 127 place count 187 transition count 259
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 129 place count 185 transition count 247
Iterating global reduction 3 with 2 rules applied. Total rules applied 131 place count 185 transition count 247
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 132 place count 184 transition count 245
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 184 transition count 245
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 134 place count 183 transition count 243
Iterating global reduction 3 with 1 rules applied. Total rules applied 135 place count 183 transition count 243
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 136 place count 182 transition count 240
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 182 transition count 240
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 138 place count 181 transition count 237
Iterating global reduction 3 with 1 rules applied. Total rules applied 139 place count 181 transition count 237
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 140 place count 180 transition count 235
Iterating global reduction 3 with 1 rules applied. Total rules applied 141 place count 180 transition count 235
Applied a total of 141 rules in 24 ms. Remains 180 /233 variables (removed 53) and now considering 235/356 (removed 121) transitions.
[2024-06-01 22:43:28] [INFO ] Flow matrix only has 215 transitions (discarded 20 similar events)
// Phase 1: matrix 215 rows 180 cols
[2024-06-01 22:43:28] [INFO ] Computed 56 invariants in 6 ms
[2024-06-01 22:43:28] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-06-01 22:43:28] [INFO ] Flow matrix only has 215 transitions (discarded 20 similar events)
[2024-06-01 22:43:28] [INFO ] Invariant cache hit.
[2024-06-01 22:43:28] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-01 22:43:28] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2024-06-01 22:43:28] [INFO ] Flow matrix only has 215 transitions (discarded 20 similar events)
[2024-06-01 22:43:28] [INFO ] Invariant cache hit.
[2024-06-01 22:43:28] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 1/180 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 22:43:32] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 5 ms to minimize.
[2024-06-01 22:43:32] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 214/394 variables, 180/238 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 31/269 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (OVERLAPS) 1/395 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 11 (OVERLAPS) 0/395 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 270 constraints, problems are : Problem set: 0 solved, 234 unsolved in 13238 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 180/180 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 1/180 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 214/394 variables, 180/238 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 31/269 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 234/503 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 22:43:48] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 22:43:51] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 12 (OVERLAPS) 1/395 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/395 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 14 (OVERLAPS) 0/395 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 506 constraints, problems are : Problem set: 0 solved, 234 unsolved in 27176 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 180/180 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 4/4 constraints]
After SMT, in 40497ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 40501ms
Starting structural reductions in LTL mode, iteration 1 : 180/233 places, 235/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41050 ms. Remains : 180/233 places, 235/356 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Vasy2003-PT-none-LTLCardinality-09
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Vasy2003-PT-none-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Vasy2003-PT-none-LTLCardinality-09 finished in 41144 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 4 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 356/356 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 205 transition count 320
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 205 transition count 320
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 72 place count 205 transition count 304
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 88 place count 189 transition count 284
Iterating global reduction 1 with 16 rules applied. Total rules applied 104 place count 189 transition count 284
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 116 place count 189 transition count 272
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 123 place count 182 transition count 260
Iterating global reduction 2 with 7 rules applied. Total rules applied 130 place count 182 transition count 260
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 139 place count 182 transition count 251
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 141 place count 180 transition count 239
Iterating global reduction 3 with 2 rules applied. Total rules applied 143 place count 180 transition count 239
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 144 place count 179 transition count 237
Iterating global reduction 3 with 1 rules applied. Total rules applied 145 place count 179 transition count 237
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 146 place count 178 transition count 235
Iterating global reduction 3 with 1 rules applied. Total rules applied 147 place count 178 transition count 235
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 148 place count 177 transition count 232
Iterating global reduction 3 with 1 rules applied. Total rules applied 149 place count 177 transition count 232
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 150 place count 176 transition count 229
Iterating global reduction 3 with 1 rules applied. Total rules applied 151 place count 176 transition count 229
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 152 place count 175 transition count 227
Iterating global reduction 3 with 1 rules applied. Total rules applied 153 place count 175 transition count 227
Applied a total of 153 rules in 22 ms. Remains 175 /233 variables (removed 58) and now considering 227/356 (removed 129) transitions.
[2024-06-01 22:44:09] [INFO ] Flow matrix only has 206 transitions (discarded 21 similar events)
// Phase 1: matrix 206 rows 175 cols
[2024-06-01 22:44:09] [INFO ] Computed 56 invariants in 2 ms
[2024-06-01 22:44:09] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-06-01 22:44:09] [INFO ] Flow matrix only has 206 transitions (discarded 21 similar events)
[2024-06-01 22:44:09] [INFO ] Invariant cache hit.
[2024-06-01 22:44:09] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 22:44:09] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2024-06-01 22:44:09] [INFO ] Flow matrix only has 206 transitions (discarded 21 similar events)
[2024-06-01 22:44:09] [INFO ] Invariant cache hit.
[2024-06-01 22:44:09] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 1/175 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 22:44:13] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-01 22:44:13] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 2 ms to minimize.
[2024-06-01 22:44:13] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (OVERLAPS) 205/380 variables, 175/234 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 32/266 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (OVERLAPS) 1/381 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (OVERLAPS) 0/381 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/381 variables, and 267 constraints, problems are : Problem set: 0 solved, 226 unsolved in 13787 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 175/175 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 1/175 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 22:44:25] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (OVERLAPS) 205/380 variables, 175/235 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 32/267 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 226/493 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (OVERLAPS) 1/381 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 13 (OVERLAPS) 0/381 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Int declared 381/381 variables, and 494 constraints, problems are : Problem set: 0 solved, 226 unsolved in 16520 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 175/175 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 4/4 constraints]
After SMT, in 30370ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 30374ms
Starting structural reductions in LTL mode, iteration 1 : 175/233 places, 227/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30913 ms. Remains : 175/233 places, 227/356 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Vasy2003-PT-none-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 965 ms.
Product exploration explored 100000 steps with 50000 reset in 860 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 21 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Vasy2003-PT-none-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Vasy2003-PT-none-LTLCardinality-10 finished in 32911 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(G(p1) U p2))))'
Support contains 6 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 356/356 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 205 transition count 322
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 205 transition count 322
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 75 place count 205 transition count 303
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 91 place count 189 transition count 282
Iterating global reduction 1 with 16 rules applied. Total rules applied 107 place count 189 transition count 282
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 120 place count 189 transition count 269
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 126 place count 183 transition count 259
Iterating global reduction 2 with 6 rules applied. Total rules applied 132 place count 183 transition count 259
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 140 place count 183 transition count 251
Applied a total of 140 rules in 9 ms. Remains 183 /233 variables (removed 50) and now considering 251/356 (removed 105) transitions.
[2024-06-01 22:44:42] [INFO ] Flow matrix only has 230 transitions (discarded 21 similar events)
// Phase 1: matrix 230 rows 183 cols
[2024-06-01 22:44:42] [INFO ] Computed 56 invariants in 3 ms
[2024-06-01 22:44:42] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-06-01 22:44:42] [INFO ] Flow matrix only has 230 transitions (discarded 21 similar events)
[2024-06-01 22:44:42] [INFO ] Invariant cache hit.
[2024-06-01 22:44:42] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 22:44:42] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
Running 250 sub problems to find dead transitions.
[2024-06-01 22:44:42] [INFO ] Flow matrix only has 230 transitions (discarded 21 similar events)
[2024-06-01 22:44:42] [INFO ] Invariant cache hit.
[2024-06-01 22:44:42] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-06-01 22:44:46] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-06-01 22:44:46] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-06-01 22:44:47] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 229/412 variables, 183/242 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 32/274 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 10 (OVERLAPS) 1/413 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 12 (OVERLAPS) 0/413 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 275 constraints, problems are : Problem set: 0 solved, 250 unsolved in 19596 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 183/183 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (OVERLAPS) 229/412 variables, 183/242 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 32/274 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 250/524 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 10 (OVERLAPS) 1/413 variables, 1/525 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 12 (OVERLAPS) 0/413 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 525 constraints, problems are : Problem set: 0 solved, 250 unsolved in 19858 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 183/183 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 3/3 constraints]
After SMT, in 39543ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 39547ms
Starting structural reductions in LTL mode, iteration 1 : 183/233 places, 251/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40039 ms. Remains : 183/233 places, 251/356 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (OR (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p0) (NOT p2))]
Running random walk in product with property : Vasy2003-PT-none-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 778 ms.
Product exploration explored 100000 steps with 50000 reset in 828 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (OR (NOT p0) (AND (NOT p2) (NOT p1))))), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 17 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Vasy2003-PT-none-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Vasy2003-PT-none-LTLCardinality-11 finished in 41874 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&&X(X(p1))))||G(F(p2))))'
Support contains 5 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 356/356 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 206 transition count 322
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 206 transition count 322
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 71 place count 206 transition count 305
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 86 place count 191 transition count 286
Iterating global reduction 1 with 15 rules applied. Total rules applied 101 place count 191 transition count 286
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 111 place count 191 transition count 276
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 118 place count 184 transition count 264
Iterating global reduction 2 with 7 rules applied. Total rules applied 125 place count 184 transition count 264
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 134 place count 184 transition count 255
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 135 place count 183 transition count 249
Iterating global reduction 3 with 1 rules applied. Total rules applied 136 place count 183 transition count 249
Applied a total of 136 rules in 10 ms. Remains 183 /233 variables (removed 50) and now considering 249/356 (removed 107) transitions.
[2024-06-01 22:45:24] [INFO ] Flow matrix only has 226 transitions (discarded 23 similar events)
// Phase 1: matrix 226 rows 183 cols
[2024-06-01 22:45:24] [INFO ] Computed 56 invariants in 2 ms
[2024-06-01 22:45:24] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-06-01 22:45:24] [INFO ] Flow matrix only has 226 transitions (discarded 23 similar events)
[2024-06-01 22:45:24] [INFO ] Invariant cache hit.
[2024-06-01 22:45:24] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-01 22:45:24] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2024-06-01 22:45:24] [INFO ] Flow matrix only has 226 transitions (discarded 23 similar events)
[2024-06-01 22:45:24] [INFO ] Invariant cache hit.
[2024-06-01 22:45:24] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-01 22:45:28] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 2 ms to minimize.
[2024-06-01 22:45:28] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-01 22:45:29] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (OVERLAPS) 225/408 variables, 183/242 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 34/276 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 10 (OVERLAPS) 1/409 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/409 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 12 (OVERLAPS) 0/409 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 277 constraints, problems are : Problem set: 0 solved, 248 unsolved in 18314 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 183/183 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-01 22:45:44] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 2 ms to minimize.
[2024-06-01 22:45:45] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (OVERLAPS) 225/408 variables, 183/244 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 34/278 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 248/526 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 11 (OVERLAPS) 1/409 variables, 1/527 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 13 (OVERLAPS) 0/409 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 409/409 variables, and 527 constraints, problems are : Problem set: 0 solved, 248 unsolved in 22403 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 183/183 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 5/5 constraints]
After SMT, in 40791ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 40794ms
Starting structural reductions in LTL mode, iteration 1 : 183/233 places, 249/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41343 ms. Remains : 183/233 places, 249/356 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Vasy2003-PT-none-LTLCardinality-12
Stuttering criterion allowed to conclude after 18314 steps with 0 reset in 81 ms.
FORMULA Vasy2003-PT-none-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Vasy2003-PT-none-LTLCardinality-12 finished in 41657 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(G(p1)))))'
Support contains 4 out of 233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 233/233 places, 356/356 transitions.
Graph (trivial) has 53 edges and 233 vertex of which 4 / 233 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 230 transition count 345
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 222 transition count 345
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 17 place count 222 transition count 334
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 46 place count 204 transition count 334
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 45 edges and 204 vertex of which 4 / 204 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 50 place count 202 transition count 331
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 202 transition count 329
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 52 place count 202 transition count 328
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 55 place count 200 transition count 328
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 55 place count 200 transition count 327
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 58 place count 198 transition count 327
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 85 place count 171 transition count 292
Iterating global reduction 4 with 27 rules applied. Total rules applied 112 place count 171 transition count 292
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 130 place count 171 transition count 274
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 145 place count 156 transition count 254
Iterating global reduction 5 with 15 rules applied. Total rules applied 160 place count 156 transition count 254
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 171 place count 156 transition count 243
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 177 place count 150 transition count 232
Iterating global reduction 6 with 6 rules applied. Total rules applied 183 place count 150 transition count 232
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 190 place count 150 transition count 225
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 191 place count 149 transition count 219
Iterating global reduction 7 with 1 rules applied. Total rules applied 192 place count 149 transition count 219
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 224 place count 131 transition count 205
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 7 rules applied. Total rules applied 231 place count 131 transition count 198
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 233 place count 129 transition count 198
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 11 Pre rules applied. Total rules applied 233 place count 129 transition count 187
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 9 with 30 rules applied. Total rules applied 263 place count 110 transition count 187
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 8 Pre rules applied. Total rules applied 263 place count 110 transition count 179
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 287 place count 94 transition count 179
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 293 place count 94 transition count 173
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 296 place count 91 transition count 169
Iterating global reduction 10 with 3 rules applied. Total rules applied 299 place count 91 transition count 169
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 302 place count 91 transition count 166
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 306 place count 89 transition count 164
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 314 place count 89 transition count 156
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 315 place count 88 transition count 154
Iterating global reduction 12 with 1 rules applied. Total rules applied 316 place count 88 transition count 154
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 320 place count 88 transition count 150
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 13 with 20 rules applied. Total rules applied 340 place count 88 transition count 130
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 340 place count 88 transition count 129
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 3 rules applied. Total rules applied 343 place count 86 transition count 129
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 343 place count 86 transition count 128
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 345 place count 85 transition count 128
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 5 rules applied. Total rules applied 350 place count 82 transition count 126
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 13 with 3 rules applied. Total rules applied 353 place count 82 transition count 123
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 14 with 10 rules applied. Total rules applied 363 place count 77 transition count 118
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 15 with 12 rules applied. Total rules applied 375 place count 69 transition count 114
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 15 with 12 rules applied. Total rules applied 387 place count 61 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 390 place count 61 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 392 place count 61 transition count 105
Applied a total of 392 rules in 107 ms. Remains 61 /233 variables (removed 172) and now considering 105/356 (removed 251) transitions.
[2024-06-01 22:46:05] [INFO ] Flow matrix only has 97 transitions (discarded 8 similar events)
// Phase 1: matrix 97 rows 61 cols
[2024-06-01 22:46:05] [INFO ] Computed 15 invariants in 4 ms
[2024-06-01 22:46:05] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-01 22:46:05] [INFO ] Flow matrix only has 97 transitions (discarded 8 similar events)
[2024-06-01 22:46:05] [INFO ] Invariant cache hit.
[2024-06-01 22:46:06] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-06-01 22:46:06] [INFO ] Redundant transitions in 19 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 22:46:06] [INFO ] Flow matrix only has 97 transitions (discarded 8 similar events)
[2024-06-01 22:46:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 3/60 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 1/61 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 22:46:07] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 96/157 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 0/157 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/158 variables, and 77 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2318 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 3/60 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 1/61 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 96/157 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 89/166 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/157 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/158 variables, and 166 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2038 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 1/1 constraints]
After SMT, in 4383ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 4385ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/233 places, 105/356 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4698 ms. Remains : 61/233 places, 105/356 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Vasy2003-PT-none-LTLCardinality-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Vasy2003-PT-none-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Vasy2003-PT-none-LTLCardinality-13 finished in 4839 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 356/356 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 203 transition count 318
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 203 transition count 318
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 80 place count 203 transition count 298
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 96 place count 187 transition count 277
Iterating global reduction 1 with 16 rules applied. Total rules applied 112 place count 187 transition count 277
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 125 place count 187 transition count 264
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 132 place count 180 transition count 252
Iterating global reduction 2 with 7 rules applied. Total rules applied 139 place count 180 transition count 252
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 146 place count 180 transition count 245
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 149 place count 177 transition count 227
Iterating global reduction 3 with 3 rules applied. Total rules applied 152 place count 177 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 153 place count 177 transition count 226
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 155 place count 175 transition count 223
Iterating global reduction 4 with 2 rules applied. Total rules applied 157 place count 175 transition count 223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 159 place count 175 transition count 221
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 160 place count 174 transition count 219
Iterating global reduction 5 with 1 rules applied. Total rules applied 161 place count 174 transition count 219
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 162 place count 173 transition count 216
Iterating global reduction 5 with 1 rules applied. Total rules applied 163 place count 173 transition count 216
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 164 place count 172 transition count 213
Iterating global reduction 5 with 1 rules applied. Total rules applied 165 place count 172 transition count 213
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 166 place count 171 transition count 211
Iterating global reduction 5 with 1 rules applied. Total rules applied 167 place count 171 transition count 211
Applied a total of 167 rules in 17 ms. Remains 171 /233 variables (removed 62) and now considering 211/356 (removed 145) transitions.
[2024-06-01 22:46:10] [INFO ] Flow matrix only has 192 transitions (discarded 19 similar events)
// Phase 1: matrix 192 rows 171 cols
[2024-06-01 22:46:10] [INFO ] Computed 56 invariants in 1 ms
[2024-06-01 22:46:10] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-06-01 22:46:10] [INFO ] Flow matrix only has 192 transitions (discarded 19 similar events)
[2024-06-01 22:46:10] [INFO ] Invariant cache hit.
[2024-06-01 22:46:10] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 22:46:11] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2024-06-01 22:46:11] [INFO ] Flow matrix only has 192 transitions (discarded 19 similar events)
[2024-06-01 22:46:11] [INFO ] Invariant cache hit.
[2024-06-01 22:46:11] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 22:46:13] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 2 ms to minimize.
[2024-06-01 22:46:14] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-01 22:46:14] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 191/362 variables, 171/230 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 30/260 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (OVERLAPS) 1/363 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 11 (OVERLAPS) 0/363 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 261 constraints, problems are : Problem set: 0 solved, 210 unsolved in 11641 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 171/171 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 22:46:24] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 191/362 variables, 171/231 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 30/261 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 210/471 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/362 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 11 (OVERLAPS) 1/363 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/363 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 13 (OVERLAPS) 0/363 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 472 constraints, problems are : Problem set: 0 solved, 210 unsolved in 15293 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 171/171 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 4/4 constraints]
After SMT, in 26988ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 26990ms
Starting structural reductions in LTL mode, iteration 1 : 171/233 places, 211/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27479 ms. Remains : 171/233 places, 211/356 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Vasy2003-PT-none-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 784 ms.
Product exploration explored 100000 steps with 50000 reset in 804 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Vasy2003-PT-none-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Vasy2003-PT-none-LTLCardinality-14 finished in 29216 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) U p1))'
Support contains 3 out of 233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 233/233 places, 356/356 transitions.
Graph (trivial) has 54 edges and 233 vertex of which 4 / 233 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 231 transition count 347
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 224 transition count 347
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 15 place count 224 transition count 336
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 37 place count 213 transition count 336
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 69 place count 181 transition count 296
Iterating global reduction 2 with 32 rules applied. Total rules applied 101 place count 181 transition count 296
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 122 place count 181 transition count 275
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 137 place count 166 transition count 255
Iterating global reduction 3 with 15 rules applied. Total rules applied 152 place count 166 transition count 255
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 163 place count 166 transition count 244
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 169 place count 160 transition count 234
Iterating global reduction 4 with 6 rules applied. Total rules applied 175 place count 160 transition count 234
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 183 place count 160 transition count 226
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 185 place count 158 transition count 214
Iterating global reduction 5 with 2 rules applied. Total rules applied 187 place count 158 transition count 214
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 188 place count 157 transition count 212
Iterating global reduction 5 with 1 rules applied. Total rules applied 189 place count 157 transition count 212
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 190 place count 156 transition count 210
Iterating global reduction 5 with 1 rules applied. Total rules applied 191 place count 156 transition count 210
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 192 place count 155 transition count 207
Iterating global reduction 5 with 1 rules applied. Total rules applied 193 place count 155 transition count 207
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 194 place count 154 transition count 204
Iterating global reduction 5 with 1 rules applied. Total rules applied 195 place count 154 transition count 204
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 196 place count 153 transition count 202
Iterating global reduction 5 with 1 rules applied. Total rules applied 197 place count 153 transition count 202
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 227 place count 138 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 228 place count 138 transition count 186
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 230 place count 136 transition count 183
Iterating global reduction 6 with 2 rules applied. Total rules applied 232 place count 136 transition count 183
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 235 place count 136 transition count 180
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 243 place count 136 transition count 172
Applied a total of 243 rules in 77 ms. Remains 136 /233 variables (removed 97) and now considering 172/356 (removed 184) transitions.
[2024-06-01 22:46:39] [INFO ] Flow matrix only has 152 transitions (discarded 20 similar events)
// Phase 1: matrix 152 rows 136 cols
[2024-06-01 22:46:39] [INFO ] Computed 53 invariants in 1 ms
[2024-06-01 22:46:40] [INFO ] Implicit Places using invariants in 153 ms returned [50, 75, 76, 78, 79, 80, 118, 123]
[2024-06-01 22:46:40] [INFO ] Actually due to overlaps returned [80, 76, 78, 79, 123, 50, 118]
Discarding 7 places :
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Implicit Place search using SMT only with invariants took 157 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/233 places, 169/356 transitions.
Graph (trivial) has 46 edges and 129 vertex of which 4 / 129 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 13 Pre rules applied. Total rules applied 1 place count 127 transition count 154
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 27 place count 114 transition count 154
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 28 place count 113 transition count 153
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 113 transition count 153
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 35 place count 110 transition count 150
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 41 place count 110 transition count 144
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 109 transition count 142
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 109 transition count 142
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 46 place count 109 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 109 transition count 135
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 50 place count 109 transition count 134
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 108 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 107 transition count 133
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 107 transition count 130
Applied a total of 57 rules in 27 ms. Remains 107 /129 variables (removed 22) and now considering 130/169 (removed 39) transitions.
[2024-06-01 22:46:40] [INFO ] Flow matrix only has 117 transitions (discarded 13 similar events)
// Phase 1: matrix 117 rows 107 cols
[2024-06-01 22:46:40] [INFO ] Computed 46 invariants in 1 ms
[2024-06-01 22:46:40] [INFO ] Implicit Places using invariants in 103 ms returned [25, 41, 48, 49, 50, 51, 60, 61, 62, 63]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 105 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 97/233 places, 130/356 transitions.
Graph (trivial) has 34 edges and 97 vertex of which 6 / 97 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 1 place count 94 transition count 118
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 85 transition count 118
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 25 place count 79 transition count 112
Iterating global reduction 0 with 6 rules applied. Total rules applied 31 place count 79 transition count 112
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 33 place count 79 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 35 place count 77 transition count 110
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 75 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 75 transition count 108
Applied a total of 39 rules in 12 ms. Remains 75 /97 variables (removed 22) and now considering 108/130 (removed 22) transitions.
[2024-06-01 22:46:40] [INFO ] Flow matrix only has 93 transitions (discarded 15 similar events)
// Phase 1: matrix 93 rows 75 cols
[2024-06-01 22:46:40] [INFO ] Computed 26 invariants in 0 ms
[2024-06-01 22:46:40] [INFO ] Implicit Places using invariants in 68 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 74/233 places, 108/356 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 454 ms. Remains : 74/233 places, 108/356 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : Vasy2003-PT-none-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 302 ms.
Product exploration explored 100000 steps with 50000 reset in 301 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Computed a total of 3 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 18 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Vasy2003-PT-none-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Vasy2003-PT-none-LTLCardinality-15 finished in 1178 ms.
All properties solved by simple procedures.
Total runtime 342864 ms.
ITS solved all properties within timeout

BK_STOP 1717282001133

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

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

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="Vasy2003-PT-none"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Vasy2003-PT-none, 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 r544-smll-171701111200283"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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