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.r476-tall-171620506100564.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 CloudDeployment-PT-3b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620506100564
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 11 15:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 189K Apr 11 15:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 11 15:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 15:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:33 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 308K 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 CloudDeployment-PT-3b-LTLFireability-00
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-01
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-02
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-03
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-04
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-05
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-06
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-07
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-08
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-09
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-10
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-11
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-12
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-13
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-14
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717208088100

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-3b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 02:14:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 02:14:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 02:14:49] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-06-01 02:14:49] [INFO ] Transformed 859 places.
[2024-06-01 02:14:49] [INFO ] Transformed 1152 transitions.
[2024-06-01 02:14:49] [INFO ] Found NUPN structural information;
[2024-06-01 02:14:49] [INFO ] Parsed PT model containing 859 places and 1152 transitions and 4030 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CloudDeployment-PT-3b-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-3b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-3b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 859 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 859/859 places, 1152/1152 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 856 transition count 1152
Discarding 195 places :
Symmetric choice reduction at 1 with 195 rule applications. Total rules 198 place count 661 transition count 957
Iterating global reduction 1 with 195 rules applied. Total rules applied 393 place count 661 transition count 957
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 459 place count 595 transition count 891
Iterating global reduction 1 with 66 rules applied. Total rules applied 525 place count 595 transition count 891
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 529 place count 595 transition count 887
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 535 place count 589 transition count 881
Iterating global reduction 2 with 6 rules applied. Total rules applied 541 place count 589 transition count 881
Applied a total of 541 rules in 282 ms. Remains 589 /859 variables (removed 270) and now considering 881/1152 (removed 271) transitions.
// Phase 1: matrix 881 rows 589 cols
[2024-06-01 02:14:49] [INFO ] Computed 10 invariants in 24 ms
[2024-06-01 02:14:50] [INFO ] Implicit Places using invariants in 514 ms returned []
[2024-06-01 02:14:50] [INFO ] Invariant cache hit.
[2024-06-01 02:14:51] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 1166 ms to find 0 implicit places.
Running 880 sub problems to find dead transitions.
[2024-06-01 02:14:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/588 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/588 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 2 (OVERLAPS) 881/1469 variables, 588/598 constraints. Problems are: Problem set: 0 solved, 880 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1469/1470 variables, and 598 constraints, problems are : Problem set: 0 solved, 880 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 10/10 constraints, State Equation: 588/589 constraints, PredecessorRefiner: 880/880 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 880 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/588 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/588 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 2 (OVERLAPS) 881/1469 variables, 588/598 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1469 variables, 880/1478 constraints. Problems are: Problem set: 0 solved, 880 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1469/1470 variables, and 1478 constraints, problems are : Problem set: 0 solved, 880 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 10/10 constraints, State Equation: 588/589 constraints, PredecessorRefiner: 880/880 constraints, Known Traps: 0/0 constraints]
After SMT, in 61256ms problems are : Problem set: 0 solved, 880 unsolved
Search for dead transitions found 0 dead transitions in 61284ms
Starting structural reductions in LTL mode, iteration 1 : 589/859 places, 881/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62757 ms. Remains : 589/859 places, 881/1152 transitions.
Support contains 53 out of 589 places after structural reductions.
[2024-06-01 02:15:52] [INFO ] Flatten gal took : 107 ms
[2024-06-01 02:15:52] [INFO ] Flatten gal took : 62 ms
[2024-06-01 02:15:53] [INFO ] Input system was already deterministic with 881 transitions.
Support contains 51 out of 589 places (down from 53) after GAL structural reductions.
RANDOM walk for 40000 steps (406 resets) in 1551 ms. (25 steps per ms) remains 16/30 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (9 resets) in 56 ms. (70 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
[2024-06-01 02:15:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 118/153 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 402/555 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 6 (OVERLAPS) 320/875 variables, 135/298 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/875 variables, 0/298 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 269/1144 variables, 124/422 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1144 variables, 0/422 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 213/1357 variables, 103/525 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1357 variables, 0/525 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 89/1446 variables, 58/583 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1446 variables, 0/583 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 21/1467 variables, 13/596 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1467 variables, 0/596 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 16 (OVERLAPS) 3/1470 variables, 3/599 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1470 variables, 0/599 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 18 (OVERLAPS) 0/1470 variables, 0/599 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1470/1470 variables, and 599 constraints, problems are : Problem set: 1 solved, 15 unsolved in 2550 ms.
Refiners :[Generalized P Invariants (flows): 10/10 constraints, State Equation: 589/589 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 125/149 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 1/150 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 399/549 variables, 150/160 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 2/162 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 0/162 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 317/866 variables, 135/297 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/866 variables, 13/310 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/866 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 268/1134 variables, 122/432 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1134 variables, 0/432 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 219/1353 variables, 105/537 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1353 variables, 0/537 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 91/1444 variables, 60/597 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1444 variables, 0/597 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 21/1465 variables, 13/610 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1465 variables, 0/610 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 19 (OVERLAPS) 5/1470 variables, 4/614 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1470 variables, 0/614 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 21 (OVERLAPS) 0/1470 variables, 0/614 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1470/1470 variables, and 614 constraints, problems are : Problem set: 1 solved, 15 unsolved in 4485 ms.
Refiners :[Generalized P Invariants (flows): 10/10 constraints, State Equation: 589/589 constraints, PredecessorRefiner: 15/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 7077ms problems are : Problem set: 1 solved, 15 unsolved
Parikh walk visited 14 properties in 5019 ms.
Support contains 5 out of 589 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 589/589 places, 881/881 transitions.
Graph (trivial) has 598 edges and 589 vertex of which 207 / 589 are part of one of the 22 SCC in 4 ms
Free SCC test removed 185 places
Drop transitions (Empty/Sink Transition effects.) removed 299 transitions
Reduce isomorphic transitions removed 299 transitions.
Graph (complete) has 1215 edges and 404 vertex of which 385 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.3 ms
Discarding 19 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 163 transitions
Trivial Post-agglo rules discarded 163 transitions
Performed 163 trivial Post agglomeration. Transition count delta: 163
Iterating post reduction 0 with 173 rules applied. Total rules applied 175 place count 385 transition count 409
Reduce places removed 163 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 166 rules applied. Total rules applied 341 place count 222 transition count 406
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 343 place count 220 transition count 406
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 343 place count 220 transition count 374
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 407 place count 188 transition count 374
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 416 place count 179 transition count 365
Iterating global reduction 3 with 9 rules applied. Total rules applied 425 place count 179 transition count 365
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 426 place count 179 transition count 364
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 426 place count 179 transition count 358
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 438 place count 173 transition count 358
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 4 with 104 rules applied. Total rules applied 542 place count 121 transition count 306
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 543 place count 121 transition count 305
Performed 22 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 587 place count 99 transition count 392
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 606 place count 99 transition count 373
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 6 with 46 rules applied. Total rules applied 652 place count 99 transition count 327
Free-agglomeration rule applied 25 times with reduction of 2 identical transitions.
Iterating global reduction 6 with 25 rules applied. Total rules applied 677 place count 99 transition count 300
Reduce places removed 25 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 6 with 61 rules applied. Total rules applied 738 place count 74 transition count 264
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 743 place count 69 transition count 243
Iterating global reduction 7 with 5 rules applied. Total rules applied 748 place count 69 transition count 243
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 750 place count 69 transition count 241
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 8 with 19 rules applied. Total rules applied 769 place count 69 transition count 222
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 771 place count 69 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 774 place count 69 transition count 219
Applied a total of 774 rules in 148 ms. Remains 69 /589 variables (removed 520) and now considering 219/881 (removed 662) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 69/589 places, 219/881 transitions.
RANDOM walk for 39635 steps (969 resets) in 1437 ms. (27 steps per ms) remains 0/1 properties
FORMULA CloudDeployment-PT-3b-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA CloudDeployment-PT-3b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 91 stabilizing places and 267 stable transitions
Graph (complete) has 1513 edges and 589 vertex of which 570 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.21 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 589 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 589/589 places, 881/881 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 588 transition count 881
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 566 transition count 802
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 566 transition count 802
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 566 transition count 801
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 51 place count 561 transition count 796
Iterating global reduction 2 with 5 rules applied. Total rules applied 56 place count 561 transition count 796
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 561 transition count 795
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 560 transition count 794
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 560 transition count 794
Applied a total of 59 rules in 63 ms. Remains 560 /589 variables (removed 29) and now considering 794/881 (removed 87) transitions.
// Phase 1: matrix 794 rows 560 cols
[2024-06-01 02:16:06] [INFO ] Computed 9 invariants in 10 ms
[2024-06-01 02:16:07] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-01 02:16:07] [INFO ] Invariant cache hit.
[2024-06-01 02:16:07] [INFO ] Implicit Places using invariants and state equation in 476 ms returned [9, 17, 185, 193, 358, 366]
[2024-06-01 02:16:07] [INFO ] Actually due to overlaps returned [9]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 610 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 559/589 places, 794/881 transitions.
Applied a total of 0 rules in 12 ms. Remains 559 /559 variables (removed 0) and now considering 794/794 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 685 ms. Remains : 559/589 places, 794/881 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-01
Stuttering criterion allowed to conclude after 162 steps with 0 reset in 6 ms.
FORMULA CloudDeployment-PT-3b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLFireability-01 finished in 1005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(!p0)||(!p0&&G(p1)&&(F(p2)||G(p3))))))'
Support contains 9 out of 589 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 589/589 places, 881/881 transitions.
Graph (trivial) has 594 edges and 589 vertex of which 207 / 589 are part of one of the 23 SCC in 1 ms
Free SCC test removed 184 places
Ensure Unique test removed 209 transitions
Reduce isomorphic transitions removed 209 transitions.
Graph (complete) has 1272 edges and 405 vertex of which 386 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.2 ms
Discarding 19 places :
Also discarding 66 output transitions
Drop transitions (Output transitions of discarded places.) removed 66 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 0 with 157 rules applied. Total rules applied 159 place count 386 transition count 449
Reduce places removed 157 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 160 rules applied. Total rules applied 319 place count 229 transition count 446
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 321 place count 227 transition count 446
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 321 place count 227 transition count 418
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 377 place count 199 transition count 418
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 383 place count 193 transition count 412
Iterating global reduction 3 with 6 rules applied. Total rules applied 389 place count 193 transition count 412
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 390 place count 193 transition count 411
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 390 place count 193 transition count 407
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 398 place count 189 transition count 407
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 518 place count 129 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 519 place count 129 transition count 346
Performed 19 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 557 place count 110 transition count 416
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 577 place count 110 transition count 396
Drop transitions (Redundant composition of simpler transitions.) removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 6 with 35 rules applied. Total rules applied 612 place count 110 transition count 361
Applied a total of 612 rules in 63 ms. Remains 110 /589 variables (removed 479) and now considering 361/881 (removed 520) transitions.
[2024-06-01 02:16:07] [INFO ] Flow matrix only has 288 transitions (discarded 73 similar events)
// Phase 1: matrix 288 rows 110 cols
[2024-06-01 02:16:07] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 02:16:07] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-01 02:16:07] [INFO ] Flow matrix only has 288 transitions (discarded 73 similar events)
[2024-06-01 02:16:07] [INFO ] Invariant cache hit.
[2024-06-01 02:16:08] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-01 02:16:08] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-06-01 02:16:08] [INFO ] Redundant transitions in 211 ms returned []
Running 360 sub problems to find dead transitions.
[2024-06-01 02:16:08] [INFO ] Flow matrix only has 288 transitions (discarded 73 similar events)
[2024-06-01 02:16:08] [INFO ] Invariant cache hit.
[2024-06-01 02:16:08] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 287/396 variables, 109/112 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 68/180 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (OVERLAPS) 1/397 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (OVERLAPS) 1/398 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 9 (OVERLAPS) 0/398 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 182 constraints, problems are : Problem set: 0 solved, 360 unsolved in 17230 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 110/110 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 287/396 variables, 109/112 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 68/180 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 360/540 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (OVERLAPS) 1/397 variables, 1/541 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 8 (OVERLAPS) 1/398 variables, 1/542 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 10 (OVERLAPS) 0/398 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 542 constraints, problems are : Problem set: 0 solved, 360 unsolved in 27850 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 110/110 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints]
After SMT, in 45552ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 45555ms
Starting structural reductions in SI_LTL mode, iteration 1 : 110/589 places, 361/881 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46045 ms. Remains : 110/589 places, 361/881 transitions.
Stuttering acceptance computed with spot in 336 ms :[true, (AND p0 (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 143 steps with 6 reset in 3 ms.
FORMULA CloudDeployment-PT-3b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLFireability-04 finished in 46406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0))||(X(G(p1))&&(p2 U p3)))))'
Support contains 5 out of 589 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 589/589 places, 881/881 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 588 transition count 881
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 567 transition count 803
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 567 transition count 803
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 567 transition count 802
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 49 place count 562 transition count 797
Iterating global reduction 2 with 5 rules applied. Total rules applied 54 place count 562 transition count 797
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 562 transition count 796
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 561 transition count 795
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 561 transition count 795
Applied a total of 57 rules in 84 ms. Remains 561 /589 variables (removed 28) and now considering 795/881 (removed 86) transitions.
// Phase 1: matrix 795 rows 561 cols
[2024-06-01 02:16:54] [INFO ] Computed 9 invariants in 3 ms
[2024-06-01 02:16:54] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-06-01 02:16:54] [INFO ] Invariant cache hit.
[2024-06-01 02:16:54] [INFO ] Implicit Places using invariants and state equation in 424 ms returned [9, 17, 183, 193, 359, 367]
[2024-06-01 02:16:54] [INFO ] Actually due to overlaps returned [9]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 691 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 560/589 places, 795/881 transitions.
Applied a total of 0 rules in 12 ms. Remains 560 /560 variables (removed 0) and now considering 795/795 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 787 ms. Remains : 560/589 places, 795/881 transitions.
Stuttering acceptance computed with spot in 267 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3))), true, (NOT p1), (NOT p3)]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-3b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLFireability-05 finished in 1075 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||G(!p0))) U X(G(p1))))'
Support contains 3 out of 589 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 589/589 places, 881/881 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 588 transition count 881
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 568 transition count 804
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 568 transition count 804
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 568 transition count 803
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 563 transition count 798
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 563 transition count 798
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 562 transition count 797
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 562 transition count 797
Applied a total of 54 rules in 40 ms. Remains 562 /589 variables (removed 27) and now considering 797/881 (removed 84) transitions.
// Phase 1: matrix 797 rows 562 cols
[2024-06-01 02:16:55] [INFO ] Computed 9 invariants in 8 ms
[2024-06-01 02:16:55] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-06-01 02:16:55] [INFO ] Invariant cache hit.
[2024-06-01 02:16:55] [INFO ] Implicit Places using invariants and state equation in 397 ms returned [9, 17, 183, 191, 357, 367]
[2024-06-01 02:16:55] [INFO ] Actually due to overlaps returned [9]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 518 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 561/589 places, 797/881 transitions.
Applied a total of 0 rules in 14 ms. Remains 561 /561 variables (removed 0) and now considering 797/797 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 573 ms. Remains : 561/589 places, 797/881 transitions.
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p1) p0), false, (NOT p1), true, (AND p0 p1), (NOT p1), false]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-07
Product exploration explored 100000 steps with 25067 reset in 253 ms.
Product exploration explored 100000 steps with 24977 reset in 214 ms.
Computed a total of 80 stabilizing places and 200 stable transitions
Graph (complete) has 1459 edges and 561 vertex of which 551 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.7 ms
Computed a total of 80 stabilizing places and 200 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 130 ms. Reduced automaton from 7 states, 16 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) p0), (NOT p1), true, (AND p0 p1), (NOT p1), false]
RANDOM walk for 40000 steps (402 resets) in 407 ms. (98 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (71 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (75 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (71 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
// Phase 1: matrix 797 rows 561 cols
[2024-06-01 02:16:57] [INFO ] Computed 8 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 35/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 79/117 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 295/412 variables, 117/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 300/712 variables, 124/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/712 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 266/978 variables, 121/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/978 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 250/1228 variables, 111/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1228 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 102/1330 variables, 71/552 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1330 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 21/1351 variables, 12/564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1351 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 7/1358 variables, 5/569 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1358 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1358 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1358/1358 variables, and 569 constraints, problems are : Problem set: 0 solved, 3 unsolved in 675 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 561/561 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 35/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 79/117 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 295/412 variables, 117/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 300/712 variables, 124/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/712 variables, 3/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/712 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 266/978 variables, 121/373 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/978 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 250/1228 variables, 111/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1228 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 102/1330 variables, 71/555 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1330 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 21/1351 variables, 12/567 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1351 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 7/1358 variables, 5/572 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1358 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1358 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1358/1358 variables, and 572 constraints, problems are : Problem set: 0 solved, 3 unsolved in 654 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 561/561 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1342ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 188 steps, including 1 resets, run visited all 3 properties in 6 ms. (steps per millisecond=31 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 11 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 12 factoid took 171 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-3b-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-3b-LTLFireability-07 finished in 3482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(G(p1)))))'
Support contains 2 out of 589 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 589/589 places, 881/881 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 588 transition count 881
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 566 transition count 802
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 566 transition count 802
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 566 transition count 801
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 52 place count 560 transition count 795
Iterating global reduction 2 with 6 rules applied. Total rules applied 58 place count 560 transition count 795
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 560 transition count 794
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 60 place count 559 transition count 793
Iterating global reduction 3 with 1 rules applied. Total rules applied 61 place count 559 transition count 793
Applied a total of 61 rules in 42 ms. Remains 559 /589 variables (removed 30) and now considering 793/881 (removed 88) transitions.
// Phase 1: matrix 793 rows 559 cols
[2024-06-01 02:16:58] [INFO ] Computed 9 invariants in 7 ms
[2024-06-01 02:16:58] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-01 02:16:58] [INFO ] Invariant cache hit.
[2024-06-01 02:16:59] [INFO ] Implicit Places using invariants and state equation in 441 ms returned [9, 17, 183, 191, 356, 364]
[2024-06-01 02:16:59] [INFO ] Actually due to overlaps returned [9]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 573 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 558/589 places, 793/881 transitions.
Applied a total of 0 rules in 12 ms. Remains 558 /558 variables (removed 0) and now considering 793/793 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 627 ms. Remains : 558/589 places, 793/881 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-08
Entered a terminal (fully accepting) state of product in 72 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-3b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLFireability-08 finished in 808 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&(p1||G(p2))))))'
Support contains 3 out of 589 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 589/589 places, 881/881 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 588 transition count 881
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 567 transition count 803
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 567 transition count 803
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 567 transition count 802
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 49 place count 562 transition count 797
Iterating global reduction 2 with 5 rules applied. Total rules applied 54 place count 562 transition count 797
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 562 transition count 796
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 561 transition count 795
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 561 transition count 795
Applied a total of 57 rules in 38 ms. Remains 561 /589 variables (removed 28) and now considering 795/881 (removed 86) transitions.
// Phase 1: matrix 795 rows 561 cols
[2024-06-01 02:16:59] [INFO ] Computed 9 invariants in 7 ms
[2024-06-01 02:16:59] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-01 02:16:59] [INFO ] Invariant cache hit.
[2024-06-01 02:17:00] [INFO ] Implicit Places using invariants and state equation in 465 ms returned [9, 17, 183, 191, 356, 364]
[2024-06-01 02:17:00] [INFO ] Actually due to overlaps returned [9]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 595 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 560/589 places, 795/881 transitions.
Applied a total of 0 rules in 12 ms. Remains 560 /560 variables (removed 0) and now considering 795/795 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 646 ms. Remains : 560/589 places, 795/881 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-3b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLFireability-09 finished in 893 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||G((p1||(p2 U p0))))))'
Support contains 3 out of 589 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 589/589 places, 881/881 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 588 transition count 881
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 566 transition count 802
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 566 transition count 802
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 51 place count 560 transition count 796
Iterating global reduction 1 with 6 rules applied. Total rules applied 57 place count 560 transition count 796
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 560 transition count 795
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 559 transition count 794
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 559 transition count 794
Applied a total of 60 rules in 52 ms. Remains 559 /589 variables (removed 30) and now considering 794/881 (removed 87) transitions.
// Phase 1: matrix 794 rows 559 cols
[2024-06-01 02:17:00] [INFO ] Computed 9 invariants in 8 ms
[2024-06-01 02:17:00] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-01 02:17:00] [INFO ] Invariant cache hit.
[2024-06-01 02:17:01] [INFO ] Implicit Places using invariants and state equation in 477 ms returned [9, 17, 183, 191, 356, 365]
[2024-06-01 02:17:01] [INFO ] Actually due to overlaps returned [9]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 604 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 558/589 places, 794/881 transitions.
Applied a total of 0 rules in 8 ms. Remains 558 /558 variables (removed 0) and now considering 794/794 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 666 ms. Remains : 558/589 places, 794/881 transitions.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0) (NOT p2)), true]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-10
Product exploration explored 100000 steps with 33280 reset in 195 ms.
Product exploration explored 100000 steps with 33317 reset in 194 ms.
Computed a total of 80 stabilizing places and 200 stable transitions
Graph (complete) has 1454 edges and 558 vertex of which 548 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Computed a total of 80 stabilizing places and 200 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 105 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), true]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (402 resets) in 146 ms. (272 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (74 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (72 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (75 resets) in 40 ms. (975 steps per ms) remains 3/3 properties
// Phase 1: matrix 794 rows 558 cols
[2024-06-01 02:17:02] [INFO ] Computed 8 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 17/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 96/116 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 300/416 variables, 116/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 313/729 variables, 130/254 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/729 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 276/1005 variables, 124/378 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1005 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 233/1238 variables, 110/488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1238 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 91/1329 variables, 64/552 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1329 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 14/1343 variables, 8/560 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1343 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf7 is UNSAT
At refinement iteration 17 (OVERLAPS) 9/1352 variables, 6/566 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1352 variables, 0/566 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1352 variables, 0/566 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1352/1352 variables, and 566 constraints, problems are : Problem set: 1 solved, 2 unsolved in 502 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 558/558 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 17/19 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 96/115 variables, 7/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 294/409 variables, 115/123 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/123 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 299/708 variables, 124/247 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/708 variables, 2/249 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/708 variables, 0/249 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 269/977 variables, 121/370 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/977 variables, 0/370 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 247/1224 variables, 112/482 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1224 variables, 0/482 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 98/1322 variables, 68/550 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1322 variables, 0/550 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 21/1343 variables, 12/562 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1343 variables, 0/562 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 9/1352 variables, 6/568 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1352 variables, 0/568 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1352 variables, 0/568 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1352/1352 variables, and 568 constraints, problems are : Problem set: 1 solved, 2 unsolved in 502 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 558/558 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1016ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 106 steps, including 1 resets, run visited all 2 properties in 7 ms. (steps per millisecond=15 )
Parikh walk visited 2 properties in 6 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (G (OR p0 (NOT p2) p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p0 p2 p1))), (F (NOT p1)), (F p0), (F p2), (F (NOT (OR p0 p2 p1))), (F (NOT (AND (NOT p0) (NOT p2))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p2 p1)))
Knowledge based reduction with 12 factoid took 201 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-3b-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-3b-LTLFireability-10 finished in 2853 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))&&(!p0 U !p1)))'
Support contains 3 out of 589 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 589/589 places, 881/881 transitions.
Graph (trivial) has 603 edges and 589 vertex of which 211 / 589 are part of one of the 23 SCC in 2 ms
Free SCC test removed 188 places
Ensure Unique test removed 214 transitions
Reduce isomorphic transitions removed 214 transitions.
Graph (complete) has 1267 edges and 401 vertex of which 382 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.5 ms
Discarding 19 places :
Also discarding 66 output transitions
Drop transitions (Output transitions of discarded places.) removed 66 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 162 place count 381 transition count 440
Reduce places removed 160 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 161 rules applied. Total rules applied 323 place count 221 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 324 place count 220 transition count 439
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 324 place count 220 transition count 411
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 380 place count 192 transition count 411
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 385 place count 187 transition count 406
Iterating global reduction 3 with 5 rules applied. Total rules applied 390 place count 187 transition count 406
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 391 place count 187 transition count 405
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 391 place count 187 transition count 402
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 397 place count 184 transition count 402
Performed 61 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 519 place count 123 transition count 340
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 520 place count 123 transition count 339
Performed 18 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 556 place count 105 transition count 408
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 574 place count 105 transition count 390
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 6 with 36 rules applied. Total rules applied 610 place count 105 transition count 354
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 611 place count 104 transition count 353
Applied a total of 611 rules in 66 ms. Remains 104 /589 variables (removed 485) and now considering 353/881 (removed 528) transitions.
[2024-06-01 02:17:03] [INFO ] Flow matrix only has 277 transitions (discarded 76 similar events)
// Phase 1: matrix 277 rows 104 cols
[2024-06-01 02:17:03] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 02:17:03] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-01 02:17:03] [INFO ] Flow matrix only has 277 transitions (discarded 76 similar events)
[2024-06-01 02:17:03] [INFO ] Invariant cache hit.
[2024-06-01 02:17:03] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-01 02:17:03] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2024-06-01 02:17:03] [INFO ] Redundant transitions in 224 ms returned []
Running 332 sub problems to find dead transitions.
[2024-06-01 02:17:03] [INFO ] Flow matrix only has 277 transitions (discarded 76 similar events)
[2024-06-01 02:17:03] [INFO ] Invariant cache hit.
[2024-06-01 02:17:03] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 276/376 variables, 100/103 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 12/115 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 4/380 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (OVERLAPS) 0/380 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/381 variables, and 119 constraints, problems are : Problem set: 0 solved, 332 unsolved in 9315 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 104/104 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 276/376 variables, 100/103 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 12/115 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 16/131 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (OVERLAPS) 4/380 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 316/451 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 332 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/381 variables, and 451 constraints, problems are : Problem set: 0 solved, 332 unsolved in 15068 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 104/104 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 24791ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 24796ms
Starting structural reductions in SI_LTL mode, iteration 1 : 104/589 places, 353/881 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25274 ms. Remains : 104/589 places, 353/881 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) p1), true, (NOT p0), p1]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-3b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLFireability-11 finished in 25439 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 5 out of 589 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 589/589 places, 881/881 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 588 transition count 881
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 24 place count 565 transition count 801
Iterating global reduction 1 with 23 rules applied. Total rules applied 47 place count 565 transition count 801
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 565 transition count 800
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 54 place count 559 transition count 794
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 559 transition count 794
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 559 transition count 793
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 62 place count 558 transition count 792
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 558 transition count 792
Applied a total of 63 rules in 53 ms. Remains 558 /589 variables (removed 31) and now considering 792/881 (removed 89) transitions.
// Phase 1: matrix 792 rows 558 cols
[2024-06-01 02:17:28] [INFO ] Computed 9 invariants in 10 ms
[2024-06-01 02:17:28] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-01 02:17:28] [INFO ] Invariant cache hit.
[2024-06-01 02:17:29] [INFO ] Implicit Places using invariants and state equation in 371 ms returned [9, 17, 183, 191, 356, 364]
[2024-06-01 02:17:29] [INFO ] Actually due to overlaps returned [9]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 494 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 557/589 places, 792/881 transitions.
Applied a total of 0 rules in 10 ms. Remains 557 /557 variables (removed 0) and now considering 792/792 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 558 ms. Remains : 557/589 places, 792/881 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-3b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLFireability-12 finished in 667 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 6 out of 589 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 589/589 places, 881/881 transitions.
Graph (trivial) has 596 edges and 589 vertex of which 207 / 589 are part of one of the 22 SCC in 1 ms
Free SCC test removed 185 places
Ensure Unique test removed 211 transitions
Reduce isomorphic transitions removed 211 transitions.
Graph (complete) has 1270 edges and 404 vertex of which 386 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.3 ms
Discarding 18 places :
Also discarding 65 output transitions
Drop transitions (Output transitions of discarded places.) removed 65 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 162 place count 386 transition count 445
Reduce places removed 160 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 162 rules applied. Total rules applied 324 place count 226 transition count 443
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 326 place count 224 transition count 443
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 326 place count 224 transition count 415
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 382 place count 196 transition count 415
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 387 place count 191 transition count 410
Iterating global reduction 3 with 5 rules applied. Total rules applied 392 place count 191 transition count 410
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 393 place count 191 transition count 409
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 393 place count 191 transition count 406
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 399 place count 188 transition count 406
Performed 62 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 523 place count 126 transition count 343
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 524 place count 126 transition count 342
Performed 18 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 560 place count 108 transition count 411
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 578 place count 108 transition count 393
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 6 with 36 rules applied. Total rules applied 614 place count 108 transition count 357
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 617 place count 108 transition count 357
Applied a total of 617 rules in 49 ms. Remains 108 /589 variables (removed 481) and now considering 357/881 (removed 524) transitions.
[2024-06-01 02:17:29] [INFO ] Flow matrix only has 285 transitions (discarded 72 similar events)
// Phase 1: matrix 285 rows 108 cols
[2024-06-01 02:17:29] [INFO ] Computed 3 invariants in 5 ms
[2024-06-01 02:17:29] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-01 02:17:29] [INFO ] Flow matrix only has 285 transitions (discarded 72 similar events)
[2024-06-01 02:17:29] [INFO ] Invariant cache hit.
[2024-06-01 02:17:29] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 02:17:29] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-06-01 02:17:29] [INFO ] Redundant transitions in 235 ms returned []
Running 356 sub problems to find dead transitions.
[2024-06-01 02:17:29] [INFO ] Flow matrix only has 285 transitions (discarded 72 similar events)
[2024-06-01 02:17:29] [INFO ] Invariant cache hit.
[2024-06-01 02:17:29] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (OVERLAPS) 284/391 variables, 107/110 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 66/176 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (OVERLAPS) 1/392 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 7 (OVERLAPS) 1/393 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 9 (OVERLAPS) 0/393 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 356 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 178 constraints, problems are : Problem set: 0 solved, 356 unsolved in 17474 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (OVERLAPS) 284/391 variables, 107/110 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 66/176 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 356/532 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (OVERLAPS) 1/392 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 8 (OVERLAPS) 1/393 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 10 (OVERLAPS) 0/393 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 356 unsolved
No progress, stopping.
After SMT solving in domain Int declared 393/393 variables, and 534 constraints, problems are : Problem set: 0 solved, 356 unsolved in 26799 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 0/0 constraints]
After SMT, in 44721ms problems are : Problem set: 0 solved, 356 unsolved
Search for dead transitions found 0 dead transitions in 44725ms
Starting structural reductions in SI_LTL mode, iteration 1 : 108/589 places, 357/881 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45233 ms. Remains : 108/589 places, 357/881 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-3b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLFireability-13 finished in 45365 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(F((G(F(!p0))||(!p1&&F(!p0)))))||(F(G(p2))&&F((G(F(!p0))||(!p1&&F(!p0))))))))'
Support contains 4 out of 589 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 589/589 places, 881/881 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 588 transition count 881
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 566 transition count 802
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 566 transition count 802
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 566 transition count 801
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 52 place count 560 transition count 795
Iterating global reduction 2 with 6 rules applied. Total rules applied 58 place count 560 transition count 795
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 560 transition count 794
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 60 place count 559 transition count 793
Iterating global reduction 3 with 1 rules applied. Total rules applied 61 place count 559 transition count 793
Applied a total of 61 rules in 36 ms. Remains 559 /589 variables (removed 30) and now considering 793/881 (removed 88) transitions.
// Phase 1: matrix 793 rows 559 cols
[2024-06-01 02:18:14] [INFO ] Computed 9 invariants in 16 ms
[2024-06-01 02:18:15] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-06-01 02:18:15] [INFO ] Invariant cache hit.
[2024-06-01 02:18:15] [INFO ] Implicit Places using invariants and state equation in 414 ms returned [9, 17, 183, 191, 356, 364]
[2024-06-01 02:18:15] [INFO ] Actually due to overlaps returned [9]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 638 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 558/589 places, 793/881 transitions.
Applied a total of 0 rules in 13 ms. Remains 558 /558 variables (removed 0) and now considering 793/793 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 688 ms. Remains : 558/589 places, 793/881 transitions.
Stuttering acceptance computed with spot in 300 ms :[p0, p0, (AND p0 (NOT p2)), p0, p0, (AND p0 (NOT p2))]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-14
Product exploration explored 100000 steps with 1048 reset in 175 ms.
Product exploration explored 100000 steps with 1052 reset in 210 ms.
Computed a total of 81 stabilizing places and 201 stable transitions
Graph (complete) has 1455 edges and 558 vertex of which 548 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Computed a total of 81 stabilizing places and 201 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 122 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
RANDOM walk for 40000 steps (406 resets) in 92 ms. (430 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (73 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
// Phase 1: matrix 793 rows 558 cols
[2024-06-01 02:18:16] [INFO ] Computed 8 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/115 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 294/409 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 299/708 variables, 126/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/708 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 265/973 variables, 117/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/973 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 251/1224 variables, 114/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1224 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 99/1323 variables, 69/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1323 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 19/1342 variables, 11/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1342 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/1351 variables, 6/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1351 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1351 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1351/1351 variables, and 566 constraints, problems are : Problem set: 0 solved, 1 unsolved in 413 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 558/558 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/115 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 294/409 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 299/708 variables, 126/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/708 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/708 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 265/973 variables, 117/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/973 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 251/1224 variables, 114/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1224 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 99/1323 variables, 69/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1323 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 19/1342 variables, 11/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1342 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 9/1351 variables, 6/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1351 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1351 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1351/1351 variables, and 567 constraints, problems are : Problem set: 0 solved, 1 unsolved in 379 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 558/558 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 804ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 81 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=40 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT p2)), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) (NOT p2))))]
Knowledge based reduction with 7 factoid took 241 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 69 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 3 out of 558 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 : 558/558 places, 793/793 transitions.
Graph (trivial) has 578 edges and 558 vertex of which 209 / 558 are part of one of the 23 SCC in 3 ms
Free SCC test removed 186 places
Ensure Unique test removed 213 transitions
Reduce isomorphic transitions removed 213 transitions.
Graph (complete) has 1203 edges and 372 vertex of which 362 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 150 place count 361 transition count 429
Reduce places removed 148 places and 0 transitions.
Iterating post reduction 1 with 148 rules applied. Total rules applied 298 place count 213 transition count 429
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 298 place count 213 transition count 397
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 362 place count 181 transition count 397
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 474 place count 125 transition count 341
Performed 18 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 510 place count 107 transition count 410
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 528 place count 107 transition count 392
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 3 with 45 rules applied. Total rules applied 573 place count 107 transition count 347
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 574 place count 106 transition count 346
Applied a total of 574 rules in 42 ms. Remains 106 /558 variables (removed 452) and now considering 346/793 (removed 447) transitions.
[2024-06-01 02:18:17] [INFO ] Flow matrix only has 273 transitions (discarded 73 similar events)
// Phase 1: matrix 273 rows 106 cols
[2024-06-01 02:18:17] [INFO ] Computed 3 invariants in 3 ms
[2024-06-01 02:18:17] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 02:18:17] [INFO ] Flow matrix only has 273 transitions (discarded 73 similar events)
[2024-06-01 02:18:17] [INFO ] Invariant cache hit.
[2024-06-01 02:18:17] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-01 02:18:17] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-06-01 02:18:18] [INFO ] Redundant transitions in 218 ms returned []
Running 321 sub problems to find dead transitions.
[2024-06-01 02:18:18] [INFO ] Flow matrix only has 273 transitions (discarded 73 similar events)
[2024-06-01 02:18:18] [INFO ] Invariant cache hit.
[2024-06-01 02:18:18] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 272/375 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 3/378 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/378 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/379 variables, and 121 constraints, problems are : Problem set: 0 solved, 321 unsolved in 8825 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 272/375 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 19/137 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (OVERLAPS) 3/378 variables, 3/140 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 302/442 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 9 (OVERLAPS) 0/378 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/379 variables, and 442 constraints, problems are : Problem set: 0 solved, 321 unsolved in 13982 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 23172ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 23175ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/558 places, 346/793 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23616 ms. Remains : 106/558 places, 346/793 transitions.
Computed a total of 30 stabilizing places and 201 stable transitions
Computed a total of 30 stabilizing places and 201 stable transitions
Knowledge obtained : [(AND (NOT p0) p2), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 7 factoid took 197 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0)]
RANDOM walk for 40000 steps (2489 resets) in 365 ms. (109 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (263 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
[2024-06-01 02:18:41] [INFO ] Flow matrix only has 273 transitions (discarded 73 similar events)
[2024-06-01 02:18:41] [INFO ] Invariant cache hit.
[2024-06-01 02:18:41] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 149/165 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/176 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 176/352 variables, 71/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/378 variables, 15/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 9/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/378 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/379 variables, and 121 constraints, problems are : Problem set: 0 solved, 1 unsolved in 114 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 12/12 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 149/165 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/176 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 176/352 variables, 71/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 26/378 variables, 15/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 9/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/378 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/378 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/379 variables, and 122 constraints, problems are : Problem set: 0 solved, 1 unsolved in 141 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 261ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 19 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p2), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (F p0), (F (NOT p2)), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p0))))]
Knowledge based reduction with 7 factoid took 343 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0)]
Product exploration explored 100000 steps with 5809 reset in 300 ms.
Product exploration explored 100000 steps with 5775 reset in 269 ms.
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 346/346 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 105 transition count 345
Applied a total of 2 rules in 8 ms. Remains 105 /106 variables (removed 1) and now considering 345/346 (removed 1) transitions.
[2024-06-01 02:18:43] [INFO ] Flow matrix only has 272 transitions (discarded 73 similar events)
// Phase 1: matrix 272 rows 105 cols
[2024-06-01 02:18:43] [INFO ] Computed 3 invariants in 3 ms
[2024-06-01 02:18:43] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-01 02:18:43] [INFO ] Flow matrix only has 272 transitions (discarded 73 similar events)
[2024-06-01 02:18:43] [INFO ] Invariant cache hit.
[2024-06-01 02:18:43] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-01 02:18:43] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-06-01 02:18:43] [INFO ] Redundant transitions in 180 ms returned []
Running 320 sub problems to find dead transitions.
[2024-06-01 02:18:43] [INFO ] Flow matrix only has 272 transitions (discarded 73 similar events)
[2024-06-01 02:18:43] [INFO ] Invariant cache hit.
[2024-06-01 02:18:43] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 271/373 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (OVERLAPS) 3/376 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (OVERLAPS) 0/376 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/377 variables, and 120 constraints, problems are : Problem set: 0 solved, 320 unsolved in 8450 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 271/373 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 18/135 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (OVERLAPS) 3/376 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 302/440 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 9 (OVERLAPS) 0/376 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/377 variables, and 440 constraints, problems are : Problem set: 0 solved, 320 unsolved in 14153 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints]
After SMT, in 22986ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 22994ms
Starting structural reductions in SI_LTL mode, iteration 1 : 105/106 places, 345/346 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23373 ms. Remains : 105/106 places, 345/346 transitions.
Treatment of property CloudDeployment-PT-3b-LTLFireability-14 finished in 51911 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(F((G(F(!p0))||(!p1&&F(!p0)))))||(F(G(p2))&&F((G(F(!p0))||(!p1&&F(!p0))))))))'
Found a Shortening insensitive property : CloudDeployment-PT-3b-LTLFireability-14
Stuttering acceptance computed with spot in 346 ms :[p0, p0, (AND p0 (NOT p2)), p0, p0, (AND p0 (NOT p2))]
Support contains 4 out of 589 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 589/589 places, 881/881 transitions.
Graph (trivial) has 601 edges and 589 vertex of which 217 / 589 are part of one of the 23 SCC in 1 ms
Free SCC test removed 194 places
Ensure Unique test removed 221 transitions
Reduce isomorphic transitions removed 221 transitions.
Graph (complete) has 1253 edges and 395 vertex of which 376 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.2 ms
Discarding 19 places :
Also discarding 66 output transitions
Drop transitions (Output transitions of discarded places.) removed 66 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 155 transitions
Trivial Post-agglo rules discarded 155 transitions
Performed 155 trivial Post agglomeration. Transition count delta: 155
Iterating post reduction 0 with 155 rules applied. Total rules applied 157 place count 375 transition count 438
Reduce places removed 155 places and 0 transitions.
Iterating post reduction 1 with 155 rules applied. Total rules applied 312 place count 220 transition count 438
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 312 place count 220 transition count 409
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 370 place count 191 transition count 409
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 374 place count 187 transition count 405
Iterating global reduction 2 with 4 rules applied. Total rules applied 378 place count 187 transition count 405
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 379 place count 187 transition count 404
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 379 place count 187 transition count 401
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 385 place count 184 transition count 401
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 503 place count 125 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 504 place count 125 transition count 341
Performed 18 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 540 place count 107 transition count 410
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 558 place count 107 transition count 392
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 561 place count 107 transition count 389
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 562 place count 106 transition count 388
Applied a total of 562 rules in 42 ms. Remains 106 /589 variables (removed 483) and now considering 388/881 (removed 493) transitions.
[2024-06-01 02:19:07] [INFO ] Flow matrix only has 315 transitions (discarded 73 similar events)
// Phase 1: matrix 315 rows 106 cols
[2024-06-01 02:19:07] [INFO ] Computed 3 invariants in 3 ms
[2024-06-01 02:19:07] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 02:19:07] [INFO ] Flow matrix only has 315 transitions (discarded 73 similar events)
[2024-06-01 02:19:07] [INFO ] Invariant cache hit.
[2024-06-01 02:19:07] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 02:19:07] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2024-06-01 02:19:07] [INFO ] Flow matrix only has 315 transitions (discarded 73 similar events)
[2024-06-01 02:19:07] [INFO ] Invariant cache hit.
[2024-06-01 02:19:07] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 314/417 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 14/120 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 3/420 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (OVERLAPS) 0/420 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 363 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/421 variables, and 123 constraints, problems are : Problem set: 0 solved, 363 unsolved in 10145 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 314/417 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 14/120 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 19/139 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (OVERLAPS) 3/420 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 344/486 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 9 (OVERLAPS) 0/420 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 363 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/421 variables, and 486 constraints, problems are : Problem set: 0 solved, 363 unsolved in 16900 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 0/0 constraints]
After SMT, in 27504ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 27509ms
Starting structural reductions in LI_LTL mode, iteration 1 : 106/589 places, 388/881 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 27798 ms. Remains : 106/589 places, 388/881 transitions.
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-14
Product exploration explored 100000 steps with 6015 reset in 221 ms.
Product exploration explored 100000 steps with 5958 reset in 224 ms.
Computed a total of 30 stabilizing places and 240 stable transitions
Computed a total of 30 stabilizing places and 240 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 167 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0)]
RANDOM walk for 40000 steps (2536 resets) in 127 ms. (312 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (264 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
[2024-06-01 02:19:35] [INFO ] Flow matrix only has 315 transitions (discarded 73 similar events)
[2024-06-01 02:19:35] [INFO ] Invariant cache hit.
[2024-06-01 02:19:35] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/17 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 176/193 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/204 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 199/403 variables, 74/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 13/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/420 variables, 12/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/420 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/420 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/421 variables, and 123 constraints, problems are : Problem set: 0 solved, 1 unsolved in 116 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 14/14 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/17 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 176/193 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/204 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 199/403 variables, 74/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 13/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/403 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 17/420 variables, 12/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/420 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/420 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/421 variables, and 124 constraints, problems are : Problem set: 0 solved, 1 unsolved in 124 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 248ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F p0), (F (NOT p2)), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p0))))]
Knowledge based reduction with 6 factoid took 252 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0)]
Support contains 3 out of 106 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 : 106/106 places, 388/388 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 106 transition count 346
Applied a total of 42 rules in 14 ms. Remains 106 /106 variables (removed 0) and now considering 346/388 (removed 42) transitions.
[2024-06-01 02:19:36] [INFO ] Flow matrix only has 273 transitions (discarded 73 similar events)
// Phase 1: matrix 273 rows 106 cols
[2024-06-01 02:19:36] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 02:19:36] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 02:19:36] [INFO ] Flow matrix only has 273 transitions (discarded 73 similar events)
[2024-06-01 02:19:36] [INFO ] Invariant cache hit.
[2024-06-01 02:19:36] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-01 02:19:36] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-06-01 02:19:36] [INFO ] Redundant transitions in 181 ms returned []
Running 321 sub problems to find dead transitions.
[2024-06-01 02:19:36] [INFO ] Flow matrix only has 273 transitions (discarded 73 similar events)
[2024-06-01 02:19:36] [INFO ] Invariant cache hit.
[2024-06-01 02:19:36] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 272/375 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 3/378 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/378 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/379 variables, and 121 constraints, problems are : Problem set: 0 solved, 321 unsolved in 8797 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 272/375 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 19/137 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (OVERLAPS) 3/378 variables, 3/140 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 302/442 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 9 (OVERLAPS) 0/378 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/379 variables, and 442 constraints, problems are : Problem set: 0 solved, 321 unsolved in 13694 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 22836ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 22839ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/106 places, 346/388 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23224 ms. Remains : 106/106 places, 346/388 transitions.
Computed a total of 30 stabilizing places and 201 stable transitions
Computed a total of 30 stabilizing places and 201 stable transitions
Knowledge obtained : [(AND p2 (NOT p0)), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 7 factoid took 202 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0)]
RANDOM walk for 40000 steps (2505 resets) in 153 ms. (259 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (263 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
[2024-06-01 02:20:00] [INFO ] Flow matrix only has 273 transitions (discarded 73 similar events)
[2024-06-01 02:20:00] [INFO ] Invariant cache hit.
[2024-06-01 02:20:00] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 149/165 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/176 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 176/352 variables, 71/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/378 variables, 15/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 9/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/378 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/379 variables, and 121 constraints, problems are : Problem set: 0 solved, 1 unsolved in 116 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 12/12 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 149/165 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/176 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 176/352 variables, 71/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 26/378 variables, 15/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 9/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/378 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/378 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/379 variables, and 122 constraints, problems are : Problem set: 0 solved, 1 unsolved in 120 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 252ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 69 steps, including 9 resets, run visited all 1 properties in 2 ms. (steps per millisecond=34 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p2 (NOT p0)), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (F p0), (F (NOT p2)), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p0))))]
Knowledge based reduction with 7 factoid took 332 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0)]
Product exploration explored 100000 steps with 5791 reset in 217 ms.
Product exploration explored 100000 steps with 5888 reset in 223 ms.
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 346/346 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 105 transition count 345
Applied a total of 2 rules in 17 ms. Remains 105 /106 variables (removed 1) and now considering 345/346 (removed 1) transitions.
[2024-06-01 02:20:01] [INFO ] Flow matrix only has 272 transitions (discarded 73 similar events)
// Phase 1: matrix 272 rows 105 cols
[2024-06-01 02:20:01] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 02:20:01] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 02:20:01] [INFO ] Flow matrix only has 272 transitions (discarded 73 similar events)
[2024-06-01 02:20:01] [INFO ] Invariant cache hit.
[2024-06-01 02:20:01] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-01 02:20:01] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-06-01 02:20:01] [INFO ] Redundant transitions in 216 ms returned []
Running 320 sub problems to find dead transitions.
[2024-06-01 02:20:01] [INFO ] Flow matrix only has 272 transitions (discarded 73 similar events)
[2024-06-01 02:20:01] [INFO ] Invariant cache hit.
[2024-06-01 02:20:01] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 271/373 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (OVERLAPS) 3/376 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (OVERLAPS) 0/376 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/377 variables, and 120 constraints, problems are : Problem set: 0 solved, 320 unsolved in 8346 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 271/373 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 18/135 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (OVERLAPS) 3/376 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 302/440 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 9 (OVERLAPS) 0/376 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/377 variables, and 440 constraints, problems are : Problem set: 0 solved, 320 unsolved in 13785 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints]
After SMT, in 22504ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 22508ms
Starting structural reductions in SI_LTL mode, iteration 1 : 105/106 places, 345/346 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22944 ms. Remains : 105/106 places, 345/346 transitions.
Treatment of property CloudDeployment-PT-3b-LTLFireability-14 finished in 77683 ms.
[2024-06-01 02:20:24] [INFO ] Flatten gal took : 53 ms
[2024-06-01 02:20:24] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 02:20:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 589 places, 881 transitions and 3476 arcs took 8 ms.
Total runtime 335264 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA CloudDeployment-PT-3b-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717208431267

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name CloudDeployment-PT-3b-LTLFireability-14
ltl formula formula --ltl=/tmp/1420/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 589 places, 881 transitions and 3476 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.090 real 0.020 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1420/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1420/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1420/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1420/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 590 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 590, there are 898 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( 1/ 4): ~252 levels ~10000 states ~22468 transitions
pnml2lts-mc( 1/ 4): ~252 levels ~20000 states ~48816 transitions
pnml2lts-mc( 1/ 4): ~352 levels ~40000 states ~107068 transitions
pnml2lts-mc( 1/ 4): ~362 levels ~80000 states ~244728 transitions
pnml2lts-mc( 1/ 4): ~362 levels ~160000 states ~566972 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~2106!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 44933
pnml2lts-mc( 0/ 4): unique states count: 287729
pnml2lts-mc( 0/ 4): unique transitions count: 999613
pnml2lts-mc( 0/ 4): - self-loop count: 1981
pnml2lts-mc( 0/ 4): - claim dead count: 352291
pnml2lts-mc( 0/ 4): - claim found count: 338868
pnml2lts-mc( 0/ 4): - claim success count: 287739
pnml2lts-mc( 0/ 4): - cum. max stack depth: 11815
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 287739 states 999638 transitions, fanout: 3.474
pnml2lts-mc( 0/ 4): Total exploration time 6.090 sec (6.090 sec minimum, 6.090 sec on average)
pnml2lts-mc( 0/ 4): States per second: 47248, Transitions per second: 164144
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 3.5MB, 12.2 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 893 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.5MB (~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="CloudDeployment-PT-3b"
export BK_EXAMINATION="LTLFireability"
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 CloudDeployment-PT-3b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r476-tall-171620506100564"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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