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.r500-smll-171649587400091.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 HirschbergSinclair-PT-25, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r500-smll-171649587400091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 13 03:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 13 03:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 03:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 03:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 321K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717241644153

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-25
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:34:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 11:34:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:34:06] [INFO ] Load time of PNML (sax parser for PT used): 220 ms
[2024-06-01 11:34:06] [INFO ] Transformed 600 places.
[2024-06-01 11:34:06] [INFO ] Transformed 545 transitions.
[2024-06-01 11:34:06] [INFO ] Parsed PT model containing 600 places and 545 transitions and 1664 arcs in 448 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 545/545 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 575 transition count 545
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 43 place count 557 transition count 527
Iterating global reduction 1 with 18 rules applied. Total rules applied 61 place count 557 transition count 527
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 77 place count 541 transition count 511
Iterating global reduction 1 with 16 rules applied. Total rules applied 93 place count 541 transition count 511
Applied a total of 93 rules in 475 ms. Remains 541 /600 variables (removed 59) and now considering 511/545 (removed 34) transitions.
// Phase 1: matrix 511 rows 541 cols
[2024-06-01 11:34:07] [INFO ] Computed 30 invariants in 57 ms
[2024-06-01 11:34:08] [INFO ] Implicit Places using invariants in 1072 ms returned []
[2024-06-01 11:34:08] [INFO ] Invariant cache hit.
[2024-06-01 11:34:11] [INFO ] Implicit Places using invariants and state equation in 2986 ms returned []
Implicit Place search using SMT with State Equation took 4124 ms to find 0 implicit places.
Running 486 sub problems to find dead transitions.
[2024-06-01 11:34:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/516 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 2 (OVERLAPS) 25/541 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/541 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 486 unsolved
SMT process timed out in 30530ms, After SMT, problems are : Problem set: 0 solved, 486 unsolved
Search for dead transitions found 0 dead transitions in 30583ms
Starting structural reductions in LTL mode, iteration 1 : 541/600 places, 511/545 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35236 ms. Remains : 541/600 places, 511/545 transitions.
Support contains 53 out of 541 places after structural reductions.
[2024-06-01 11:34:43] [INFO ] Flatten gal took : 142 ms
[2024-06-01 11:34:43] [INFO ] Flatten gal took : 70 ms
[2024-06-01 11:34:43] [INFO ] Input system was already deterministic with 511 transitions.
Support contains 52 out of 541 places (down from 53) after GAL structural reductions.
RANDOM walk for 40000 steps (72 resets) in 3270 ms. (12 steps per ms) remains 13/31 properties
BEST_FIRST walk for 40004 steps (8 resets) in 300 ms. (132 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 171 ms. (232 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 164 ms. (242 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 13/13 properties
[2024-06-01 11:34:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 444/465 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 25/490 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp30 is UNSAT
At refinement iteration 5 (OVERLAPS) 511/1001 variables, 490/520 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1001 variables, 0/520 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 51/1052 variables, 51/571 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1052 variables, 0/571 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1052 variables, 0/571 constraints. Problems are: Problem set: 11 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1052/1052 variables, and 571 constraints, problems are : Problem set: 11 solved, 2 unsolved in 1456 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 541/541 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 446/454 variables, 26/26 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 0/26 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/488 variables, 4/30 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 0/30 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 511/999 variables, 488/518 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/999 variables, 0/518 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 53/1052 variables, 53/571 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1052 variables, 2/573 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1052 variables, 0/573 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1052 variables, 0/573 constraints. Problems are: Problem set: 11 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1052/1052 variables, and 573 constraints, problems are : Problem set: 11 solved, 2 unsolved in 1321 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 541/541 constraints, PredecessorRefiner: 2/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 2827ms problems are : Problem set: 11 solved, 2 unsolved
Parikh walk visited 0 properties in 1151 ms.
Support contains 8 out of 541 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 541/541 places, 511/511 transitions.
Graph (complete) has 1022 edges and 541 vertex of which 516 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 219 transitions
Trivial Post-agglo rules discarded 219 transitions
Performed 219 trivial Post agglomeration. Transition count delta: 219
Iterating post reduction 0 with 244 rules applied. Total rules applied 245 place count 516 transition count 267
Reduce places removed 219 places and 0 transitions.
Graph (complete) has 506 edges and 297 vertex of which 211 are kept as prefixes of interest. Removing 86 places using SCC suffix rule.1 ms
Discarding 86 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 222 rules applied. Total rules applied 467 place count 211 transition count 265
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 555 place count 209 transition count 179
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 555 place count 209 transition count 178
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 557 place count 208 transition count 178
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 558 place count 207 transition count 177
Iterating global reduction 3 with 1 rules applied. Total rules applied 559 place count 207 transition count 177
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 560 place count 207 transition count 176
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 335 edges and 206 vertex of which 204 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 562 place count 204 transition count 176
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 564 place count 204 transition count 174
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 566 place count 203 transition count 173
Graph (complete) has 327 edges and 203 vertex of which 201 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 1 rules applied. Total rules applied 567 place count 201 transition count 173
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 569 place count 201 transition count 171
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 8 with 21 rules applied. Total rules applied 590 place count 180 transition count 150
Reduce places removed 18 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 8 with 82 rules applied. Total rules applied 672 place count 162 transition count 86
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 9 with 64 rules applied. Total rules applied 736 place count 98 transition count 86
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 32 Pre rules applied. Total rules applied 736 place count 98 transition count 54
Deduced a syphon composed of 32 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 10 with 65 rules applied. Total rules applied 801 place count 65 transition count 54
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 10 with 2 rules applied. Total rules applied 803 place count 63 transition count 54
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 2 Pre rules applied. Total rules applied 803 place count 63 transition count 52
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 807 place count 61 transition count 52
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 11 with 2 rules applied. Total rules applied 809 place count 60 transition count 51
Applied a total of 809 rules in 97 ms. Remains 60 /541 variables (removed 481) and now considering 51/511 (removed 460) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 60/541 places, 51/511 transitions.
RANDOM walk for 40000 steps (768 resets) in 503 ms. (79 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (233 resets) in 57 ms. (689 steps per ms) remains 1/2 properties
BEST_FIRST walk for 1549 steps (5 resets) in 10 ms. (140 steps per ms) remains 0/1 properties
Successfully simplified 11 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-25-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-25-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-25-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 541 stabilizing places and 511 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 541 transition count 511
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA HirschbergSinclair-PT-25-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 511/511 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 532 transition count 502
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 532 transition count 502
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 525 transition count 495
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 525 transition count 495
Applied a total of 32 rules in 134 ms. Remains 525 /541 variables (removed 16) and now considering 495/511 (removed 16) transitions.
// Phase 1: matrix 495 rows 525 cols
[2024-06-01 11:34:50] [INFO ] Computed 30 invariants in 10 ms
[2024-06-01 11:34:50] [INFO ] Implicit Places using invariants in 612 ms returned []
[2024-06-01 11:34:50] [INFO ] Invariant cache hit.
[2024-06-01 11:34:52] [INFO ] Implicit Places using invariants and state equation in 2263 ms returned []
Implicit Place search using SMT with State Equation took 2879 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2024-06-01 11:34:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 25/525 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
SMT process timed out in 30208ms, After SMT, problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 30222ms
Starting structural reductions in LTL mode, iteration 1 : 525/541 places, 495/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33239 ms. Remains : 525/541 places, 495/511 transitions.
Stuttering acceptance computed with spot in 408 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-01 finished in 33730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 511/511 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 532 transition count 502
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 532 transition count 502
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 525 transition count 495
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 525 transition count 495
Applied a total of 32 rules in 79 ms. Remains 525 /541 variables (removed 16) and now considering 495/511 (removed 16) transitions.
[2024-06-01 11:35:23] [INFO ] Invariant cache hit.
[2024-06-01 11:35:24] [INFO ] Implicit Places using invariants in 556 ms returned []
[2024-06-01 11:35:24] [INFO ] Invariant cache hit.
[2024-06-01 11:35:27] [INFO ] Implicit Places using invariants and state equation in 2819 ms returned []
Implicit Place search using SMT with State Equation took 3381 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2024-06-01 11:35:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 25/525 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
SMT process timed out in 30271ms, After SMT, problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 30280ms
Starting structural reductions in LTL mode, iteration 1 : 525/541 places, 495/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33744 ms. Remains : 525/541 places, 495/511 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-02 finished in 33916 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 2 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 511/511 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 532 transition count 502
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 532 transition count 502
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 525 transition count 495
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 525 transition count 495
Applied a total of 32 rules in 66 ms. Remains 525 /541 variables (removed 16) and now considering 495/511 (removed 16) transitions.
[2024-06-01 11:35:57] [INFO ] Invariant cache hit.
[2024-06-01 11:35:58] [INFO ] Implicit Places using invariants in 646 ms returned []
[2024-06-01 11:35:58] [INFO ] Invariant cache hit.
[2024-06-01 11:36:01] [INFO ] Implicit Places using invariants and state equation in 2810 ms returned []
Implicit Place search using SMT with State Equation took 3471 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2024-06-01 11:36:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 25/525 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
SMT process timed out in 30222ms, After SMT, problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 30233ms
Starting structural reductions in LTL mode, iteration 1 : 525/541 places, 495/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33772 ms. Remains : 525/541 places, 495/511 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 951 ms.
Product exploration explored 100000 steps with 50000 reset in 693 ms.
Computed a total of 525 stabilizing places and 495 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 525 transition count 495
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 21 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-25-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-03 finished in 35778 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 U p2)))'
Support contains 6 out of 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 511/511 transitions.
Reduce places removed 22 places and 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 221 rules applied. Total rules applied 221 place count 519 transition count 268
Reduce places removed 221 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 222 rules applied. Total rules applied 443 place count 298 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 444 place count 297 transition count 267
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 452 place count 289 transition count 259
Iterating global reduction 3 with 8 rules applied. Total rules applied 460 place count 289 transition count 259
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 461 place count 289 transition count 258
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 462 place count 288 transition count 258
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 464 place count 287 transition count 257
Applied a total of 464 rules in 61 ms. Remains 287 /541 variables (removed 254) and now considering 257/511 (removed 254) transitions.
// Phase 1: matrix 257 rows 287 cols
[2024-06-01 11:36:33] [INFO ] Computed 30 invariants in 2 ms
[2024-06-01 11:36:33] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-06-01 11:36:33] [INFO ] Invariant cache hit.
[2024-06-01 11:36:33] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 11:36:34] [INFO ] Implicit Places using invariants and state equation in 909 ms returned []
Implicit Place search using SMT with State Equation took 1221 ms to find 0 implicit places.
[2024-06-01 11:36:34] [INFO ] Redundant transitions in 26 ms returned []
Running 217 sub problems to find dead transitions.
[2024-06-01 11:36:34] [INFO ] Invariant cache hit.
[2024-06-01 11:36:34] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 5/252 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 222/474 variables, 252/282 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 23/305 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/474 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 474/544 variables, and 305 constraints, problems are : Problem set: 0 solved, 217 unsolved in 16540 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 252/287 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 5/252 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 222/474 variables, 252/282 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 23/305 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 217/522 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 0/474 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 474/544 variables, and 522 constraints, problems are : Problem set: 0 solved, 217 unsolved in 20012 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 252/287 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
After SMT, in 36623ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 36629ms
Starting structural reductions in SI_LTL mode, iteration 1 : 287/541 places, 257/511 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37949 ms. Remains : 287/541 places, 257/511 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p2), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-07
Product exploration explored 100000 steps with 3578 reset in 745 ms.
Product exploration explored 100000 steps with 3670 reset in 558 ms.
Computed a total of 287 stabilizing places and 257 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 287 transition count 257
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) p1 p0), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 10 factoid took 1155 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p2)]
RANDOM walk for 81 steps (0 resets) in 6 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) p1 p0), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 10 factoid took 1229 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p2)]
[2024-06-01 11:37:15] [INFO ] Invariant cache hit.
[2024-06-01 11:37:15] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 100 ms returned sat
[2024-06-01 11:37:19] [INFO ] [Real]Absence check using state equation in 3539 ms returned sat
[2024-06-01 11:37:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:37:19] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 105 ms returned sat
[2024-06-01 11:37:21] [INFO ] [Nat]Absence check using state equation in 1592 ms returned sat
[2024-06-01 11:37:21] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 11:37:21] [INFO ] [Nat]Added 23 Read/Feed constraints in 22 ms returned sat
[2024-06-01 11:37:21] [INFO ] Computed and/alt/rep : 217/245/217 causal constraints (skipped 0 transitions) in 25 ms.
[2024-06-01 11:37:22] [INFO ] Added : 94 causal constraints over 19 iterations in 983 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 287 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 287/287 places, 257/257 transitions.
Applied a total of 0 rules in 27 ms. Remains 287 /287 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-06-01 11:37:22] [INFO ] Invariant cache hit.
[2024-06-01 11:37:23] [INFO ] Implicit Places using invariants in 500 ms returned []
[2024-06-01 11:37:23] [INFO ] Invariant cache hit.
[2024-06-01 11:37:23] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 11:37:24] [INFO ] Implicit Places using invariants and state equation in 1311 ms returned []
Implicit Place search using SMT with State Equation took 1815 ms to find 0 implicit places.
[2024-06-01 11:37:24] [INFO ] Redundant transitions in 6 ms returned []
Running 217 sub problems to find dead transitions.
[2024-06-01 11:37:24] [INFO ] Invariant cache hit.
[2024-06-01 11:37:24] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 5/252 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 222/474 variables, 252/282 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 23/305 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/474 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 474/544 variables, and 305 constraints, problems are : Problem set: 0 solved, 217 unsolved in 20409 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 252/287 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 5/252 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 222/474 variables, 252/282 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 23/305 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 217/522 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 0/474 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 474/544 variables, and 522 constraints, problems are : Problem set: 0 solved, 217 unsolved in 18018 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 252/287 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
After SMT, in 38487ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 38494ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40350 ms. Remains : 287/287 places, 257/257 transitions.
Computed a total of 287 stabilizing places and 257 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 287 transition count 257
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 289 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p2)]
RANDOM walk for 97 steps (0 resets) in 5 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 2 factoid took 208 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p2)]
[2024-06-01 11:38:03] [INFO ] Invariant cache hit.
[2024-06-01 11:38:04] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 71 ms returned sat
[2024-06-01 11:38:07] [INFO ] [Real]Absence check using state equation in 3090 ms returned sat
[2024-06-01 11:38:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:38:07] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 68 ms returned sat
[2024-06-01 11:38:08] [INFO ] [Nat]Absence check using state equation in 1193 ms returned sat
[2024-06-01 11:38:08] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 11:38:08] [INFO ] [Nat]Added 23 Read/Feed constraints in 23 ms returned sat
[2024-06-01 11:38:08] [INFO ] Computed and/alt/rep : 217/245/217 causal constraints (skipped 0 transitions) in 22 ms.
[2024-06-01 11:38:09] [INFO ] Added : 94 causal constraints over 19 iterations in 700 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 43 ms :[(NOT p2)]
Product exploration explored 100000 steps with 3629 reset in 655 ms.
Product exploration explored 100000 steps with 3523 reset in 485 ms.
Support contains 2 out of 287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 287/287 places, 257/257 transitions.
Reduce places removed 2 places and 2 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 0 with 2 rules applied. Total rules applied 2 place count 285 transition count 253
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 283 transition count 253
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 282 transition count 252
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 282 transition count 252
Applied a total of 6 rules in 25 ms. Remains 282 /287 variables (removed 5) and now considering 252/257 (removed 5) transitions.
// Phase 1: matrix 252 rows 282 cols
[2024-06-01 11:38:10] [INFO ] Computed 30 invariants in 2 ms
[2024-06-01 11:38:11] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-06-01 11:38:11] [INFO ] Invariant cache hit.
[2024-06-01 11:38:11] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 11:38:12] [INFO ] Implicit Places using invariants and state equation in 1248 ms returned []
Implicit Place search using SMT with State Equation took 1644 ms to find 0 implicit places.
[2024-06-01 11:38:12] [INFO ] Redundant transitions in 4 ms returned []
Running 206 sub problems to find dead transitions.
[2024-06-01 11:38:12] [INFO ] Invariant cache hit.
[2024-06-01 11:38:12] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 3/239 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 209/448 variables, 239/269 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (OVERLAPS) 0/448 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 448/534 variables, and 277 constraints, problems are : Problem set: 0 solved, 206 unsolved in 14219 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 239/282 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 3/239 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 209/448 variables, 239/269 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 206/483 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (OVERLAPS) 0/448 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 448/534 variables, and 483 constraints, problems are : Problem set: 0 solved, 206 unsolved in 15044 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 239/282 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
After SMT, in 29298ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 29302ms
Starting structural reductions in SI_LTL mode, iteration 1 : 282/287 places, 252/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30985 ms. Remains : 282/287 places, 252/257 transitions.
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-07 finished in 128501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((p1&&(G(!p0)||(!p0&&F(p2))))))))'
Support contains 6 out of 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 511/511 transitions.
Reduce places removed 23 places and 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 518 transition count 278
Reduce places removed 210 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 212 rules applied. Total rules applied 422 place count 308 transition count 276
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 424 place count 306 transition count 276
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 430 place count 300 transition count 270
Iterating global reduction 3 with 6 rules applied. Total rules applied 436 place count 300 transition count 270
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 3 with 2 rules applied. Total rules applied 438 place count 300 transition count 268
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 440 place count 298 transition count 268
Applied a total of 440 rules in 61 ms. Remains 298 /541 variables (removed 243) and now considering 268/511 (removed 243) transitions.
// Phase 1: matrix 268 rows 298 cols
[2024-06-01 11:38:41] [INFO ] Computed 30 invariants in 4 ms
[2024-06-01 11:38:42] [INFO ] Implicit Places using invariants in 475 ms returned []
[2024-06-01 11:38:42] [INFO ] Invariant cache hit.
[2024-06-01 11:38:42] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 11:38:43] [INFO ] Implicit Places using invariants and state equation in 1406 ms returned []
Implicit Place search using SMT with State Equation took 1886 ms to find 0 implicit places.
[2024-06-01 11:38:43] [INFO ] Redundant transitions in 3 ms returned []
Running 225 sub problems to find dead transitions.
[2024-06-01 11:38:43] [INFO ] Invariant cache hit.
[2024-06-01 11:38:43] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 4/259 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 231/490 variables, 259/289 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 9/298 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (OVERLAPS) 2/492 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (OVERLAPS) 0/492 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/566 variables, and 300 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 261/298 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 4/259 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 231/490 variables, 259/289 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 9/298 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 225/523 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 2/492 variables, 2/525 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/566 variables, and 525 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 261/298 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 0/0 constraints]
After SMT, in 60099ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 60105ms
Starting structural reductions in SI_LTL mode, iteration 1 : 298/541 places, 268/511 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62064 ms. Remains : 298/541 places, 268/511 transitions.
Stuttering acceptance computed with spot in 336 ms :[true, (OR (NOT p1) p0), (AND p0 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-08
Stuttering criterion allowed to conclude after 291 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-08 finished in 62445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U X(X(G(!p1))))&&F(p0)))'
Support contains 5 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 511/511 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 533 transition count 503
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 533 transition count 503
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 526 transition count 496
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 526 transition count 496
Applied a total of 30 rules in 61 ms. Remains 526 /541 variables (removed 15) and now considering 496/511 (removed 15) transitions.
// Phase 1: matrix 496 rows 526 cols
[2024-06-01 11:39:44] [INFO ] Computed 30 invariants in 7 ms
[2024-06-01 11:39:45] [INFO ] Implicit Places using invariants in 752 ms returned []
[2024-06-01 11:39:45] [INFO ] Invariant cache hit.
[2024-06-01 11:39:47] [INFO ] Implicit Places using invariants and state equation in 2794 ms returned []
Implicit Place search using SMT with State Equation took 3555 ms to find 0 implicit places.
Running 471 sub problems to find dead transitions.
[2024-06-01 11:39:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 25/526 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
SMT process timed out in 30216ms, After SMT, problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 30225ms
Starting structural reductions in LTL mode, iteration 1 : 526/541 places, 496/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33844 ms. Remains : 526/541 places, 496/511 transitions.
Stuttering acceptance computed with spot in 413 ms :[(OR (NOT p0) p1), p1, (NOT p0), p1, true, (AND (NOT p0) p1), p1, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 181 steps with 5 reset in 2 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-09 finished in 34301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 511/511 transitions.
Reduce places removed 25 places and 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 223 transitions
Trivial Post-agglo rules discarded 223 transitions
Performed 223 trivial Post agglomeration. Transition count delta: 223
Iterating post reduction 0 with 223 rules applied. Total rules applied 223 place count 516 transition count 263
Reduce places removed 223 places and 0 transitions.
Iterating post reduction 1 with 223 rules applied. Total rules applied 446 place count 293 transition count 263
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 454 place count 285 transition count 255
Iterating global reduction 2 with 8 rules applied. Total rules applied 462 place count 285 transition count 255
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 2 with 2 rules applied. Total rules applied 464 place count 285 transition count 253
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 466 place count 283 transition count 253
Applied a total of 466 rules in 47 ms. Remains 283 /541 variables (removed 258) and now considering 253/511 (removed 258) transitions.
// Phase 1: matrix 253 rows 283 cols
[2024-06-01 11:40:18] [INFO ] Computed 30 invariants in 3 ms
[2024-06-01 11:40:19] [INFO ] Implicit Places using invariants in 613 ms returned []
[2024-06-01 11:40:19] [INFO ] Invariant cache hit.
[2024-06-01 11:40:20] [INFO ] Implicit Places using invariants and state equation in 1222 ms returned []
Implicit Place search using SMT with State Equation took 1837 ms to find 0 implicit places.
[2024-06-01 11:40:20] [INFO ] Redundant transitions in 1 ms returned []
Running 204 sub problems to find dead transitions.
[2024-06-01 11:40:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 2/236 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 207/443 variables, 236/266 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 1/444 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 0/444 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/536 variables, and 267 constraints, problems are : Problem set: 0 solved, 204 unsolved in 19909 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 237/283 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 2/236 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 207/443 variables, 236/266 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 204/470 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (OVERLAPS) 1/444 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (OVERLAPS) 0/444 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 444/536 variables, and 471 constraints, problems are : Problem set: 0 solved, 204 unsolved in 26083 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 237/283 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
After SMT, in 46028ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 46032ms
Starting structural reductions in SI_LTL mode, iteration 1 : 283/541 places, 253/511 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47927 ms. Remains : 283/541 places, 253/511 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-11
Product exploration explored 100000 steps with 361 reset in 260 ms.
Product exploration explored 100000 steps with 361 reset in 349 ms.
Computed a total of 283 stabilizing places and 253 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 283 transition count 253
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 16 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-25-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-11 finished in 48780 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(G(p1))))&&F(p2)))'
Support contains 6 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 511/511 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 533 transition count 503
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 533 transition count 503
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 528 transition count 498
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 528 transition count 498
Applied a total of 26 rules in 36 ms. Remains 528 /541 variables (removed 13) and now considering 498/511 (removed 13) transitions.
// Phase 1: matrix 498 rows 528 cols
[2024-06-01 11:41:07] [INFO ] Computed 30 invariants in 7 ms
[2024-06-01 11:41:07] [INFO ] Implicit Places using invariants in 543 ms returned []
[2024-06-01 11:41:07] [INFO ] Invariant cache hit.
[2024-06-01 11:41:10] [INFO ] Implicit Places using invariants and state equation in 2200 ms returned []
Implicit Place search using SMT with State Equation took 2746 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-06-01 11:41:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 25/528 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
SMT process timed out in 30209ms, After SMT, problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 30218ms
Starting structural reductions in LTL mode, iteration 1 : 528/541 places, 498/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33003 ms. Remains : 528/541 places, 498/511 transitions.
Stuttering acceptance computed with spot in 250 ms :[true, (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-12 finished in 33284 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||F(p1))))'
Support contains 4 out of 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 511/511 transitions.
Reduce places removed 25 places and 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 219 transitions
Trivial Post-agglo rules discarded 219 transitions
Performed 219 trivial Post agglomeration. Transition count delta: 219
Iterating post reduction 0 with 219 rules applied. Total rules applied 219 place count 516 transition count 267
Reduce places removed 219 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 221 rules applied. Total rules applied 440 place count 297 transition count 265
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 442 place count 295 transition count 265
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 450 place count 287 transition count 257
Iterating global reduction 3 with 8 rules applied. Total rules applied 458 place count 287 transition count 257
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 3 with 2 rules applied. Total rules applied 460 place count 287 transition count 255
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 462 place count 285 transition count 255
Applied a total of 462 rules in 65 ms. Remains 285 /541 variables (removed 256) and now considering 255/511 (removed 256) transitions.
// Phase 1: matrix 255 rows 285 cols
[2024-06-01 11:41:40] [INFO ] Computed 30 invariants in 3 ms
[2024-06-01 11:41:41] [INFO ] Implicit Places using invariants in 530 ms returned []
[2024-06-01 11:41:41] [INFO ] Invariant cache hit.
[2024-06-01 11:41:42] [INFO ] Implicit Places using invariants and state equation in 1245 ms returned []
Implicit Place search using SMT with State Equation took 1784 ms to find 0 implicit places.
[2024-06-01 11:41:42] [INFO ] Redundant transitions in 2 ms returned []
Running 206 sub problems to find dead transitions.
[2024-06-01 11:41:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 2/238 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 210/448 variables, 238/268 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 2/450 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (OVERLAPS) 0/450 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/540 variables, and 270 constraints, problems are : Problem set: 0 solved, 206 unsolved in 19884 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 240/285 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 2/238 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 210/448 variables, 238/268 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 206/474 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (OVERLAPS) 2/450 variables, 2/476 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (OVERLAPS) 0/450 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 450/540 variables, and 476 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 240/285 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
After SMT, in 49929ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 49933ms
Starting structural reductions in SI_LTL mode, iteration 1 : 285/541 places, 255/511 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51793 ms. Remains : 285/541 places, 255/511 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-13
Product exploration explored 100000 steps with 358 reset in 354 ms.
Product exploration explored 100000 steps with 358 reset in 302 ms.
Computed a total of 285 stabilizing places and 255 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 285 transition count 255
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (136 resets) in 236 ms. (168 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (12 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
[2024-06-01 11:42:33] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 199/203 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/237 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 208/445 variables, 237/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/446 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/446 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/540 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 248 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 238/285 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 199/203 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/237 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 445/540 variables, and 267 constraints, problems are : Problem set: 1 solved, 0 unsolved in 208 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 237/285 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 464ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 16 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-25-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-13 finished in 53529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 511/511 transitions.
Reduce places removed 25 places and 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 222 transitions
Trivial Post-agglo rules discarded 222 transitions
Performed 222 trivial Post agglomeration. Transition count delta: 222
Iterating post reduction 0 with 222 rules applied. Total rules applied 222 place count 516 transition count 264
Reduce places removed 222 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 223 rules applied. Total rules applied 445 place count 294 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 446 place count 293 transition count 263
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 455 place count 284 transition count 254
Iterating global reduction 3 with 9 rules applied. Total rules applied 464 place count 284 transition count 254
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 3 with 2 rules applied. Total rules applied 466 place count 284 transition count 252
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 468 place count 282 transition count 252
Applied a total of 468 rules in 35 ms. Remains 282 /541 variables (removed 259) and now considering 252/511 (removed 259) transitions.
// Phase 1: matrix 252 rows 282 cols
[2024-06-01 11:42:34] [INFO ] Computed 30 invariants in 2 ms
[2024-06-01 11:42:34] [INFO ] Implicit Places using invariants in 433 ms returned []
[2024-06-01 11:42:34] [INFO ] Invariant cache hit.
[2024-06-01 11:42:35] [INFO ] Implicit Places using invariants and state equation in 1038 ms returned []
Implicit Place search using SMT with State Equation took 1474 ms to find 0 implicit places.
[2024-06-01 11:42:35] [INFO ] Redundant transitions in 0 ms returned []
Running 203 sub problems to find dead transitions.
[2024-06-01 11:42:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 2/235 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 206/441 variables, 235/265 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (OVERLAPS) 3/444 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/444 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/534 variables, and 267 constraints, problems are : Problem set: 0 solved, 203 unsolved in 20123 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 237/282 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 2/235 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 206/441 variables, 235/265 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 195/460 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 3/444 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 8/470 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 10 (OVERLAPS) 0/444 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 444/534 variables, and 470 constraints, problems are : Problem set: 0 solved, 203 unsolved in 26081 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 237/282 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
After SMT, in 46231ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 46233ms
Starting structural reductions in SI_LTL mode, iteration 1 : 282/541 places, 252/511 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47751 ms. Remains : 282/541 places, 252/511 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-14
Stuttering criterion allowed to conclude after 277 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-14 finished in 47816 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 U p2)))'
[2024-06-01 11:43:22] [INFO ] Flatten gal took : 97 ms
[2024-06-01 11:43:22] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 11:43:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 541 places, 511 transitions and 1531 arcs took 15 ms.
Total runtime 555901 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : HirschbergSinclair-PT-25-LTLCardinality-07

BK_STOP 1717242652790

--------------------
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
mcc2024
ltl formula name HirschbergSinclair-PT-25-LTLCardinality-07
ltl formula formula --ltl=/tmp/1033/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 541 places, 511 transitions and 1531 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.240 real 0.000 user 0.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1033/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1033/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1033/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1033/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 543 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 542, there are 518 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~326 levels ~10000 states ~41828 transitions
pnml2lts-mc( 1/ 4): ~322 levels ~20000 states ~93460 transitions
pnml2lts-mc( 2/ 4): ~326 levels ~40000 states ~131824 transitions
pnml2lts-mc( 1/ 4): ~325 levels ~80000 states ~330068 transitions
pnml2lts-mc( 2/ 4): ~326 levels ~160000 states ~585532 transitions
pnml2lts-mc( 1/ 4): ~325 levels ~320000 states ~1438684 transitions
pnml2lts-mc( 2/ 4): ~326 levels ~640000 states ~2713180 transitions
pnml2lts-mc( 2/ 4): ~326 levels ~1280000 states ~5578988 transitions
pnml2lts-mc( 2/ 4): ~326 levels ~2560000 states ~12235468 transitions
pnml2lts-mc( 2/ 4): ~326 levels ~5120000 states ~25471856 transitions
pnml2lts-mc( 2/ 4): ~326 levels ~10240000 states ~54128612 transitions
pnml2lts-mc( 2/ 4): ~326 levels ~20480000 states ~113995344 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 27561098
pnml2lts-mc( 0/ 4): unique states count: 27561906
pnml2lts-mc( 0/ 4): unique transitions count: 174759059
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 147183820
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 27564034
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1301
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 27564034 states 174768905 transitions, fanout: 6.340
pnml2lts-mc( 0/ 4): Total exploration time 449.000 sec (448.970 sec minimum, 448.982 sec on average)
pnml2lts-mc( 0/ 4): States per second: 61390, Transitions per second: 389240
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 274.4MB, 10.4 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 82.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 523 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 274.4MB (~256.0MB paged-in)

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="HirschbergSinclair-PT-25"
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 HirschbergSinclair-PT-25, 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 r500-smll-171649587400091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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