Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r073-smll-167814399500420.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CloudDeployment-PT-5b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r073-smll-167814399500420
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 6.3K Feb 25 14:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 14:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 14:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 14:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 25 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.5M Mar 5 18:22 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-5b-LTLFireability-00
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-01
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-02
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-03
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-04
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-05
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-06
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-07
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-08
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-09
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-10
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-11
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-12
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-13
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-14
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678478853211

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
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-5b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-10 20:07:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 20:07:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 20:07:36] [INFO ] Load time of PNML (sax parser for PT used): 383 ms
[2023-03-10 20:07:36] [INFO ] Transformed 1525 places.
[2023-03-10 20:07:36] [INFO ] Transformed 3132 transitions.
[2023-03-10 20:07:36] [INFO ] Found NUPN structural information;
[2023-03-10 20:07:36] [INFO ] Parsed PT model containing 1525 places and 3132 transitions and 24760 arcs in 746 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CloudDeployment-PT-5b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 61 out of 1525 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1525/1525 places, 3132/3132 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1520 transition count 3132
Discarding 396 places :
Symmetric choice reduction at 1 with 396 rule applications. Total rules 401 place count 1124 transition count 2736
Iterating global reduction 1 with 396 rules applied. Total rules applied 797 place count 1124 transition count 2736
Discarding 151 places :
Symmetric choice reduction at 1 with 151 rule applications. Total rules 948 place count 973 transition count 2585
Iterating global reduction 1 with 151 rules applied. Total rules applied 1099 place count 973 transition count 2585
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 1118 place count 973 transition count 2566
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1134 place count 957 transition count 2550
Iterating global reduction 2 with 16 rules applied. Total rules applied 1150 place count 957 transition count 2550
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1151 place count 956 transition count 2549
Iterating global reduction 2 with 1 rules applied. Total rules applied 1152 place count 956 transition count 2549
Applied a total of 1152 rules in 503 ms. Remains 956 /1525 variables (removed 569) and now considering 2549/3132 (removed 583) transitions.
// Phase 1: matrix 2549 rows 956 cols
[2023-03-10 20:07:37] [INFO ] Computed 16 place invariants in 74 ms
[2023-03-10 20:07:38] [INFO ] Implicit Places using invariants in 740 ms returned []
[2023-03-10 20:07:38] [INFO ] Invariant cache hit.
[2023-03-10 20:07:40] [INFO ] Implicit Places using invariants and state equation in 1760 ms returned []
Implicit Place search using SMT with State Equation took 2564 ms to find 0 implicit places.
[2023-03-10 20:07:40] [INFO ] Invariant cache hit.
[2023-03-10 20:07:42] [INFO ] Dead Transitions using invariants and state equation in 2080 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 956/1525 places, 2549/3132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5156 ms. Remains : 956/1525 places, 2549/3132 transitions.
Support contains 61 out of 956 places after structural reductions.
[2023-03-10 20:07:43] [INFO ] Flatten gal took : 598 ms
[2023-03-10 20:07:43] [INFO ] Flatten gal took : 358 ms
[2023-03-10 20:07:44] [INFO ] Input system was already deterministic with 2549 transitions.
Support contains 60 out of 956 places (down from 61) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 64 resets, run finished after 797 ms. (steps per millisecond=12 ) properties (out of 35) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Running SMT prover for 28 properties.
[2023-03-10 20:07:45] [INFO ] Invariant cache hit.
[2023-03-10 20:07:46] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 7 ms returned sat
[2023-03-10 20:07:47] [INFO ] After 995ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2023-03-10 20:07:47] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 9 ms returned sat
[2023-03-10 20:07:51] [INFO ] After 3396ms SMT Verify possible using state equation in natural domain returned unsat :12 sat :16
[2023-03-10 20:07:54] [INFO ] After 6144ms SMT Verify possible using trap constraints in natural domain returned unsat :12 sat :16
Attempting to minimize the solution found.
Minimization took 1625 ms.
[2023-03-10 20:07:56] [INFO ] After 9005ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :16
Fused 28 Parikh solutions to 16 different solutions.
Parikh walk visited 12 properties in 296 ms.
Support contains 28 out of 956 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 956/956 places, 2549/2549 transitions.
Graph (trivial) has 958 edges and 956 vertex of which 338 / 956 are part of one of the 39 SCC in 8 ms
Free SCC test removed 299 places
Drop transitions removed 380 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 381 transitions.
Graph (complete) has 2423 edges and 657 vertex of which 656 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 262 transitions
Trivial Post-agglo rules discarded 262 transitions
Performed 262 trivial Post agglomeration. Transition count delta: 262
Iterating post reduction 0 with 267 rules applied. Total rules applied 269 place count 656 transition count 1901
Reduce places removed 262 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 265 rules applied. Total rules applied 534 place count 394 transition count 1898
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 536 place count 392 transition count 1898
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 59 Pre rules applied. Total rules applied 536 place count 392 transition count 1839
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 654 place count 333 transition count 1839
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 658 place count 329 transition count 1835
Iterating global reduction 3 with 4 rules applied. Total rules applied 662 place count 329 transition count 1835
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 663 place count 329 transition count 1834
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 663 place count 329 transition count 1833
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 665 place count 328 transition count 1833
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 2 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 839 place count 241 transition count 1746
Performed 37 Post agglomeration using F-continuation condition with reduction of 54 identical transitions.
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 913 place count 204 transition count 1966
Drop transitions removed 12 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 4 with 34 rules applied. Total rules applied 947 place count 204 transition count 1932
Drop transitions removed 132 transitions
Redundant transition composition rules discarded 132 transitions
Iterating global reduction 5 with 132 rules applied. Total rules applied 1079 place count 204 transition count 1800
Free-agglomeration rule applied 44 times with reduction of 12 identical transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 1123 place count 204 transition count 1744
Reduce places removed 44 places and 0 transitions.
Drop transitions removed 60 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 5 with 152 rules applied. Total rules applied 1275 place count 160 transition count 1636
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1280 place count 155 transition count 1602
Iterating global reduction 6 with 5 rules applied. Total rules applied 1285 place count 155 transition count 1602
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1287 place count 155 transition count 1600
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 7 with 61 rules applied. Total rules applied 1348 place count 155 transition count 1539
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 1350 place count 155 transition count 1539
Applied a total of 1350 rules in 544 ms. Remains 155 /956 variables (removed 801) and now considering 1539/2549 (removed 1010) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 546 ms. Remains : 155/956 places, 1539/2549 transitions.
Incomplete random walk after 10000 steps, including 219 resets, run finished after 487 ms. (steps per millisecond=20 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 285784 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 285784 steps, saw 47393 distinct states, run finished after 3003 ms. (steps per millisecond=95 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-10 20:08:00] [INFO ] Flow matrix only has 1329 transitions (discarded 210 similar events)
// Phase 1: matrix 1329 rows 155 cols
[2023-03-10 20:08:00] [INFO ] Computed 21 place invariants in 27 ms
[2023-03-10 20:08:00] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 20:08:00] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 7 ms returned sat
[2023-03-10 20:08:01] [INFO ] After 551ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 20:08:01] [INFO ] State equation strengthened by 146 read => feed constraints.
[2023-03-10 20:08:01] [INFO ] After 264ms SMT Verify possible using 146 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-10 20:08:01] [INFO ] After 580ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 153 ms.
[2023-03-10 20:08:02] [INFO ] After 1392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 15 ms.
Support contains 28 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 1539/1539 transitions.
Applied a total of 0 rules in 42 ms. Remains 155 /155 variables (removed 0) and now considering 1539/1539 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 155/155 places, 1539/1539 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 1539/1539 transitions.
Applied a total of 0 rules in 45 ms. Remains 155 /155 variables (removed 0) and now considering 1539/1539 (removed 0) transitions.
[2023-03-10 20:08:02] [INFO ] Flow matrix only has 1329 transitions (discarded 210 similar events)
[2023-03-10 20:08:02] [INFO ] Invariant cache hit.
[2023-03-10 20:08:02] [INFO ] Implicit Places using invariants in 567 ms returned []
[2023-03-10 20:08:02] [INFO ] Flow matrix only has 1329 transitions (discarded 210 similar events)
[2023-03-10 20:08:02] [INFO ] Invariant cache hit.
[2023-03-10 20:08:03] [INFO ] State equation strengthened by 146 read => feed constraints.
[2023-03-10 20:08:04] [INFO ] Implicit Places using invariants and state equation in 1391 ms returned []
Implicit Place search using SMT with State Equation took 1986 ms to find 0 implicit places.
[2023-03-10 20:08:04] [INFO ] Redundant transitions in 415 ms returned []
[2023-03-10 20:08:04] [INFO ] Flow matrix only has 1329 transitions (discarded 210 similar events)
[2023-03-10 20:08:04] [INFO ] Invariant cache hit.
[2023-03-10 20:08:06] [INFO ] Dead Transitions using invariants and state equation in 1360 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3819 ms. Remains : 155/155 places, 1539/1539 transitions.
Graph (trivial) has 107 edges and 155 vertex of which 32 / 155 are part of one of the 4 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions removed 44 transitions
Ensure Unique test removed 210 transitions
Reduce isomorphic transitions removed 254 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 127 transition count 1280
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 122 transition count 1279
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 121 transition count 1278
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 14 place count 121 transition count 1269
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 32 place count 112 transition count 1269
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 34 place count 110 transition count 1267
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 110 transition count 1267
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 38 place count 108 transition count 1265
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 108 transition count 1265
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 107 transition count 1259
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 107 transition count 1259
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 60 place count 107 transition count 1241
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 76 place count 99 transition count 1233
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 84 place count 99 transition count 1225
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 85 place count 98 transition count 1224
Iterating global reduction 5 with 1 rules applied. Total rules applied 86 place count 98 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 87 place count 97 transition count 1218
Iterating global reduction 5 with 1 rules applied. Total rules applied 88 place count 97 transition count 1218
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 106 place count 97 transition count 1200
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 114 place count 93 transition count 1224
Drop transitions removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 6 with 41 rules applied. Total rules applied 155 place count 93 transition count 1183
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 156 place count 93 transition count 1182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 157 place count 92 transition count 1182
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 157 place count 92 transition count 1179
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 163 place count 89 transition count 1179
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 164 place count 88 transition count 1175
Iterating global reduction 8 with 1 rules applied. Total rules applied 165 place count 88 transition count 1175
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 173 place count 88 transition count 1167
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 175 place count 88 transition count 1165
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 177 place count 86 transition count 1165
Applied a total of 177 rules in 180 ms. Remains 86 /155 variables (removed 69) and now considering 1165/1539 (removed 374) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1165 rows 86 cols
[2023-03-10 20:08:06] [INFO ] Computed 21 place invariants in 21 ms
[2023-03-10 20:08:06] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 20:08:06] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 6 ms returned sat
[2023-03-10 20:08:06] [INFO ] After 487ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 20:08:07] [INFO ] After 693ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 140 ms.
[2023-03-10 20:08:07] [INFO ] After 891ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Successfully simplified 12 atomic propositions for a total of 15 simplifications.
FORMULA CloudDeployment-PT-5b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 152 stabilizing places and 1504 stable transitions
Graph (complete) has 2925 edges and 956 vertex of which 928 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.29 ms
FORMULA CloudDeployment-PT-5b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(!p0)))'
Support contains 1 out of 956 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 956/956 places, 2549/2549 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 955 transition count 2549
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 934 transition count 1515
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 934 transition count 1515
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 934 transition count 1514
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 48 place count 930 transition count 1510
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 930 transition count 1510
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 929 transition count 1509
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 929 transition count 1509
Applied a total of 54 rules in 127 ms. Remains 929 /956 variables (removed 27) and now considering 1509/2549 (removed 1040) transitions.
// Phase 1: matrix 1509 rows 929 cols
[2023-03-10 20:08:07] [INFO ] Computed 15 place invariants in 8 ms
[2023-03-10 20:08:08] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-10 20:08:08] [INFO ] Invariant cache hit.
[2023-03-10 20:08:09] [INFO ] Implicit Places using invariants and state equation in 1471 ms returned [11, 19, 185, 193, 358, 366, 531, 539, 704, 712]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 1778 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 919/956 places, 1509/2549 transitions.
Applied a total of 0 rules in 23 ms. Remains 919 /919 variables (removed 0) and now considering 1509/1509 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1928 ms. Remains : 919/956 places, 1509/2549 transitions.
Stuttering acceptance computed with spot in 279 ms :[p0, true, p0, p0]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(NEQ s617 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 92 steps with 0 reset in 4 ms.
FORMULA CloudDeployment-PT-5b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5b-LTLFireability-01 finished in 2299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 956 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 956/956 places, 2549/2549 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 955 transition count 2549
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 935 transition count 1516
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 935 transition count 1516
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 935 transition count 1515
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 932 transition count 1512
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 932 transition count 1512
Applied a total of 48 rules in 97 ms. Remains 932 /956 variables (removed 24) and now considering 1512/2549 (removed 1037) transitions.
// Phase 1: matrix 1512 rows 932 cols
[2023-03-10 20:08:09] [INFO ] Computed 15 place invariants in 8 ms
[2023-03-10 20:08:10] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-10 20:08:10] [INFO ] Invariant cache hit.
[2023-03-10 20:08:11] [INFO ] Implicit Places using invariants and state equation in 1409 ms returned [11, 19, 185, 193, 358, 366, 531, 539, 704, 712]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 1714 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 922/956 places, 1512/2549 transitions.
Applied a total of 0 rules in 25 ms. Remains 922 /922 variables (removed 0) and now considering 1512/1512 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1836 ms. Remains : 922/956 places, 1512/2549 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s786 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 236 steps with 0 reset in 4 ms.
FORMULA CloudDeployment-PT-5b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5b-LTLFireability-03 finished in 1938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p1 U X(G(!p2)))&&p0)))'
Support contains 24 out of 956 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 956/956 places, 2549/2549 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 946 transition count 2539
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 946 transition count 2539
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 946 transition count 2538
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 942 transition count 2534
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 942 transition count 2534
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 941 transition count 2533
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 941 transition count 2533
Applied a total of 31 rules in 129 ms. Remains 941 /956 variables (removed 15) and now considering 2533/2549 (removed 16) transitions.
// Phase 1: matrix 2533 rows 941 cols
[2023-03-10 20:08:11] [INFO ] Computed 16 place invariants in 21 ms
[2023-03-10 20:08:12] [INFO ] Implicit Places using invariants in 714 ms returned []
[2023-03-10 20:08:12] [INFO ] Invariant cache hit.
[2023-03-10 20:08:15] [INFO ] Implicit Places using invariants and state equation in 2672 ms returned []
Implicit Place search using SMT with State Equation took 3393 ms to find 0 implicit places.
[2023-03-10 20:08:15] [INFO ] Invariant cache hit.
[2023-03-10 20:08:17] [INFO ] Dead Transitions using invariants and state equation in 2210 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 941/956 places, 2533/2549 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5737 ms. Remains : 941/956 places, 2533/2549 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) p2), p2, p2]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s869 0) (OR (EQ s13 0) (EQ s22 0) (EQ s42 0) (EQ s187 0) (EQ s198 0) (EQ s218 0) (EQ s362 0) (EQ s373 0) (EQ s393 0) (EQ s537 0) (EQ s548 0) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 632 reset in 658 ms.
Product exploration explored 100000 steps with 628 reset in 582 ms.
Computed a total of 145 stabilizing places and 1497 stable transitions
Graph (complete) has 2908 edges and 941 vertex of which 913 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.12 ms
Computed a total of 145 stabilizing places and 1497 stable transitions
Detected a total of 145/941 stabilizing places and 1497/2533 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X p0), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 1240 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter sensitive) to 3 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) p2), p2, p2]
Incomplete random walk after 10000 steps, including 61 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-10 20:08:21] [INFO ] Invariant cache hit.
[2023-03-10 20:08:21] [INFO ] After 299ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:8
[2023-03-10 20:08:22] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 9 ms returned sat
[2023-03-10 20:08:24] [INFO ] After 2088ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2023-03-10 20:08:25] [INFO ] After 3477ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 834 ms.
[2023-03-10 20:08:26] [INFO ] After 4738ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
Fused 10 Parikh solutions to 4 different solutions.
Parikh walk visited 5 properties in 93 ms.
Support contains 24 out of 941 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 2533/2533 transitions.
Graph (trivial) has 950 edges and 941 vertex of which 346 / 941 are part of one of the 39 SCC in 3 ms
Free SCC test removed 307 places
Drop transitions removed 391 transitions
Reduce isomorphic transitions removed 391 transitions.
Graph (complete) has 2392 edges and 634 vertex of which 633 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 247 transitions
Trivial Post-agglo rules discarded 247 transitions
Performed 247 trivial Post agglomeration. Transition count delta: 247
Iterating post reduction 0 with 252 rules applied. Total rules applied 254 place count 633 transition count 1890
Reduce places removed 247 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 250 rules applied. Total rules applied 504 place count 386 transition count 1887
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 506 place count 384 transition count 1887
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 506 place count 384 transition count 1825
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 630 place count 322 transition count 1825
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 802 place count 236 transition count 1739
Performed 35 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 872 place count 201 transition count 1949
Drop transitions removed 12 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 904 place count 201 transition count 1917
Drop transitions removed 130 transitions
Redundant transition composition rules discarded 130 transitions
Iterating global reduction 4 with 130 rules applied. Total rules applied 1034 place count 201 transition count 1787
Free-agglomeration rule applied 48 times with reduction of 12 identical transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1082 place count 201 transition count 1727
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 60 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 4 with 166 rules applied. Total rules applied 1248 place count 153 transition count 1609
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1255 place count 146 transition count 1562
Iterating global reduction 5 with 7 rules applied. Total rules applied 1262 place count 146 transition count 1562
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1264 place count 146 transition count 1560
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 6 with 61 rules applied. Total rules applied 1325 place count 146 transition count 1499
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1327 place count 146 transition count 1499
Applied a total of 1327 rules in 300 ms. Remains 146 /941 variables (removed 795) and now considering 1499/2533 (removed 1034) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 301 ms. Remains : 146/941 places, 1499/2533 transitions.
Incomplete random walk after 10000 steps, including 263 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 358940 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :{}
Probabilistic random walk after 358940 steps, saw 53172 distinct states, run finished after 3007 ms. (steps per millisecond=119 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-10 20:08:30] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
// Phase 1: matrix 1299 rows 146 cols
[2023-03-10 20:08:30] [INFO ] Computed 21 place invariants in 16 ms
[2023-03-10 20:08:30] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 20:08:30] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-10 20:08:31] [INFO ] After 535ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 20:08:31] [INFO ] State equation strengthened by 154 read => feed constraints.
[2023-03-10 20:08:31] [INFO ] After 202ms SMT Verify possible using 154 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-10 20:08:31] [INFO ] After 421ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 180 ms.
[2023-03-10 20:08:31] [INFO ] After 1221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 10 ms.
Support contains 24 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 1499/1499 transitions.
Applied a total of 0 rules in 35 ms. Remains 146 /146 variables (removed 0) and now considering 1499/1499 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 146/146 places, 1499/1499 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 1499/1499 transitions.
Applied a total of 0 rules in 33 ms. Remains 146 /146 variables (removed 0) and now considering 1499/1499 (removed 0) transitions.
[2023-03-10 20:08:31] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
[2023-03-10 20:08:31] [INFO ] Invariant cache hit.
[2023-03-10 20:08:32] [INFO ] Implicit Places using invariants in 532 ms returned []
[2023-03-10 20:08:32] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
[2023-03-10 20:08:32] [INFO ] Invariant cache hit.
[2023-03-10 20:08:32] [INFO ] State equation strengthened by 154 read => feed constraints.
[2023-03-10 20:08:34] [INFO ] Implicit Places using invariants and state equation in 1622 ms returned []
Implicit Place search using SMT with State Equation took 2157 ms to find 0 implicit places.
[2023-03-10 20:08:34] [INFO ] Redundant transitions in 254 ms returned []
[2023-03-10 20:08:34] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
[2023-03-10 20:08:34] [INFO ] Invariant cache hit.
[2023-03-10 20:08:35] [INFO ] Dead Transitions using invariants and state equation in 1174 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3629 ms. Remains : 146/146 places, 1499/1499 transitions.
Graph (trivial) has 108 edges and 146 vertex of which 32 / 146 are part of one of the 4 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions removed 44 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 244 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 118 transition count 1246
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 109 transition count 1244
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 24 place count 107 transition count 1243
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 24 place count 107 transition count 1235
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 40 place count 99 transition count 1235
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 43 place count 96 transition count 1232
Iterating global reduction 3 with 3 rules applied. Total rules applied 46 place count 96 transition count 1232
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 49 place count 93 transition count 1214
Iterating global reduction 3 with 3 rules applied. Total rules applied 52 place count 93 transition count 1214
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 94 place count 93 transition count 1172
Performed 7 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 108 place count 86 transition count 1163
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 114 place count 86 transition count 1157
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 120 place count 83 transition count 1172
Drop transitions removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 5 with 35 rules applied. Total rules applied 155 place count 83 transition count 1137
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 155 place count 83 transition count 1134
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 161 place count 80 transition count 1134
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 163 place count 80 transition count 1132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 165 place count 78 transition count 1132
Applied a total of 165 rules in 111 ms. Remains 78 /146 variables (removed 68) and now considering 1132/1499 (removed 367) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1132 rows 78 cols
[2023-03-10 20:08:35] [INFO ] Computed 21 place invariants in 9 ms
[2023-03-10 20:08:35] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 20:08:35] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 4 ms returned sat
[2023-03-10 20:08:36] [INFO ] After 390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 20:08:36] [INFO ] After 556ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-10 20:08:36] [INFO ] After 707ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X p0), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (F (NOT p0)), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND p1 p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p0 p1 p2))]
Knowledge based reduction with 28 factoid took 1634 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Support contains 24 out of 941 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 941/941 places, 2533/2533 transitions.
Applied a total of 0 rules in 27 ms. Remains 941 /941 variables (removed 0) and now considering 2533/2533 (removed 0) transitions.
// Phase 1: matrix 2533 rows 941 cols
[2023-03-10 20:08:38] [INFO ] Computed 16 place invariants in 18 ms
[2023-03-10 20:08:39] [INFO ] Implicit Places using invariants in 804 ms returned []
[2023-03-10 20:08:39] [INFO ] Invariant cache hit.
[2023-03-10 20:08:42] [INFO ] Implicit Places using invariants and state equation in 2702 ms returned []
Implicit Place search using SMT with State Equation took 3508 ms to find 0 implicit places.
[2023-03-10 20:08:42] [INFO ] Invariant cache hit.
[2023-03-10 20:08:44] [INFO ] Dead Transitions using invariants and state equation in 2433 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5973 ms. Remains : 941/941 places, 2533/2533 transitions.
Computed a total of 145 stabilizing places and 1497 stable transitions
Graph (complete) has 2908 edges and 941 vertex of which 913 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.20 ms
Computed a total of 145 stabilizing places and 1497 stable transitions
Detected a total of 145/941 stabilizing places and 1497/2533 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1))), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 862 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Incomplete random walk after 10000 steps, including 62 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-10 20:08:46] [INFO ] Invariant cache hit.
[2023-03-10 20:08:46] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-10 20:08:46] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 9 ms returned sat
[2023-03-10 20:08:48] [INFO ] After 2007ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-10 20:08:49] [INFO ] After 3088ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 716 ms.
[2023-03-10 20:08:50] [INFO ] After 4159ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 3 properties in 139 ms.
Support contains 24 out of 941 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 2533/2533 transitions.
Graph (trivial) has 950 edges and 941 vertex of which 346 / 941 are part of one of the 39 SCC in 1 ms
Free SCC test removed 307 places
Drop transitions removed 391 transitions
Reduce isomorphic transitions removed 391 transitions.
Graph (complete) has 2392 edges and 634 vertex of which 633 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 247 transitions
Trivial Post-agglo rules discarded 247 transitions
Performed 247 trivial Post agglomeration. Transition count delta: 247
Iterating post reduction 0 with 252 rules applied. Total rules applied 254 place count 633 transition count 1890
Reduce places removed 247 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 250 rules applied. Total rules applied 504 place count 386 transition count 1887
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 506 place count 384 transition count 1887
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 506 place count 384 transition count 1825
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 630 place count 322 transition count 1825
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 802 place count 236 transition count 1739
Performed 35 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 872 place count 201 transition count 1949
Drop transitions removed 12 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 904 place count 201 transition count 1917
Drop transitions removed 130 transitions
Redundant transition composition rules discarded 130 transitions
Iterating global reduction 4 with 130 rules applied. Total rules applied 1034 place count 201 transition count 1787
Free-agglomeration rule applied 48 times with reduction of 12 identical transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1082 place count 201 transition count 1727
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 60 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 4 with 166 rules applied. Total rules applied 1248 place count 153 transition count 1609
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1255 place count 146 transition count 1562
Iterating global reduction 5 with 7 rules applied. Total rules applied 1262 place count 146 transition count 1562
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1264 place count 146 transition count 1560
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 6 with 61 rules applied. Total rules applied 1325 place count 146 transition count 1499
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1327 place count 146 transition count 1499
Applied a total of 1327 rules in 232 ms. Remains 146 /941 variables (removed 795) and now considering 1499/2533 (removed 1034) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 146/941 places, 1499/2533 transitions.
Incomplete random walk after 10000 steps, including 259 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 357852 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :{}
Probabilistic random walk after 357852 steps, saw 53059 distinct states, run finished after 3002 ms. (steps per millisecond=119 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-10 20:08:54] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
// Phase 1: matrix 1299 rows 146 cols
[2023-03-10 20:08:54] [INFO ] Computed 21 place invariants in 10 ms
[2023-03-10 20:08:54] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 20:08:54] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 9 ms returned sat
[2023-03-10 20:08:55] [INFO ] After 496ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 20:08:55] [INFO ] State equation strengthened by 154 read => feed constraints.
[2023-03-10 20:08:55] [INFO ] After 199ms SMT Verify possible using 154 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-10 20:08:55] [INFO ] After 427ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 136 ms.
[2023-03-10 20:08:55] [INFO ] After 1139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 20 ms.
Support contains 24 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 1499/1499 transitions.
Applied a total of 0 rules in 25 ms. Remains 146 /146 variables (removed 0) and now considering 1499/1499 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 146/146 places, 1499/1499 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 1499/1499 transitions.
Applied a total of 0 rules in 25 ms. Remains 146 /146 variables (removed 0) and now considering 1499/1499 (removed 0) transitions.
[2023-03-10 20:08:55] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
[2023-03-10 20:08:55] [INFO ] Invariant cache hit.
[2023-03-10 20:08:56] [INFO ] Implicit Places using invariants in 526 ms returned []
[2023-03-10 20:08:56] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
[2023-03-10 20:08:56] [INFO ] Invariant cache hit.
[2023-03-10 20:08:56] [INFO ] State equation strengthened by 154 read => feed constraints.
[2023-03-10 20:08:57] [INFO ] Implicit Places using invariants and state equation in 1473 ms returned []
Implicit Place search using SMT with State Equation took 2015 ms to find 0 implicit places.
[2023-03-10 20:08:58] [INFO ] Redundant transitions in 260 ms returned []
[2023-03-10 20:08:58] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
[2023-03-10 20:08:58] [INFO ] Invariant cache hit.
[2023-03-10 20:08:59] [INFO ] Dead Transitions using invariants and state equation in 1265 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3576 ms. Remains : 146/146 places, 1499/1499 transitions.
Graph (trivial) has 108 edges and 146 vertex of which 32 / 146 are part of one of the 4 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions removed 44 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 244 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 118 transition count 1246
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 109 transition count 1244
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 24 place count 107 transition count 1243
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 24 place count 107 transition count 1235
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 40 place count 99 transition count 1235
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 43 place count 96 transition count 1232
Iterating global reduction 3 with 3 rules applied. Total rules applied 46 place count 96 transition count 1232
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 49 place count 93 transition count 1214
Iterating global reduction 3 with 3 rules applied. Total rules applied 52 place count 93 transition count 1214
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 94 place count 93 transition count 1172
Performed 7 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 108 place count 86 transition count 1163
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 114 place count 86 transition count 1157
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 120 place count 83 transition count 1172
Drop transitions removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 5 with 35 rules applied. Total rules applied 155 place count 83 transition count 1137
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 155 place count 83 transition count 1134
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 161 place count 80 transition count 1134
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 163 place count 80 transition count 1132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 165 place count 78 transition count 1132
Applied a total of 165 rules in 91 ms. Remains 78 /146 variables (removed 68) and now considering 1132/1499 (removed 367) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1132 rows 78 cols
[2023-03-10 20:08:59] [INFO ] Computed 21 place invariants in 9 ms
[2023-03-10 20:08:59] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 20:08:59] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-10 20:09:00] [INFO ] After 437ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 20:09:00] [INFO ] After 585ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-03-10 20:09:00] [INFO ] After 744ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1))), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2), (F (AND (NOT p1) p2)), (F (AND p0 (NOT p1) p2)), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 18 factoid took 983 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Product exploration explored 100000 steps with 620 reset in 589 ms.
Product exploration explored 100000 steps with 633 reset in 443 ms.
Support contains 24 out of 941 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 941/941 places, 2533/2533 transitions.
Applied a total of 0 rules in 25 ms. Remains 941 /941 variables (removed 0) and now considering 2533/2533 (removed 0) transitions.
// Phase 1: matrix 2533 rows 941 cols
[2023-03-10 20:09:02] [INFO ] Computed 16 place invariants in 15 ms
[2023-03-10 20:09:03] [INFO ] Implicit Places using invariants in 735 ms returned []
[2023-03-10 20:09:03] [INFO ] Invariant cache hit.
[2023-03-10 20:09:06] [INFO ] Implicit Places using invariants and state equation in 2628 ms returned []
Implicit Place search using SMT with State Equation took 3366 ms to find 0 implicit places.
[2023-03-10 20:09:06] [INFO ] Invariant cache hit.
[2023-03-10 20:09:08] [INFO ] Dead Transitions using invariants and state equation in 1788 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5181 ms. Remains : 941/941 places, 2533/2533 transitions.
Treatment of property CloudDeployment-PT-5b-LTLFireability-04 finished in 56922 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(G((X(p2)||p1))))))))'
Support contains 9 out of 956 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 956/956 places, 2549/2549 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 955 transition count 2549
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 934 transition count 1515
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 934 transition count 1515
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 934 transition count 1514
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 48 place count 930 transition count 1510
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 930 transition count 1510
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 929 transition count 1509
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 929 transition count 1509
Applied a total of 54 rules in 113 ms. Remains 929 /956 variables (removed 27) and now considering 1509/2549 (removed 1040) transitions.
// Phase 1: matrix 1509 rows 929 cols
[2023-03-10 20:09:08] [INFO ] Computed 15 place invariants in 6 ms
[2023-03-10 20:09:09] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-10 20:09:09] [INFO ] Invariant cache hit.
[2023-03-10 20:09:10] [INFO ] Implicit Places using invariants and state equation in 1259 ms returned [11, 19, 185, 193, 358, 366, 531, 539, 704, 712]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 1571 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 919/956 places, 1509/2549 transitions.
Applied a total of 0 rules in 22 ms. Remains 919 /919 variables (removed 0) and now considering 1509/1509 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1707 ms. Remains : 919/956 places, 1509/2549 transitions.
Stuttering acceptance computed with spot in 211 ms :[true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=(AND p1 p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(AND (OR (EQ s182 0) (EQ s189 0) (EQ s344 0) (EQ s876 0)) (OR (EQ s528 0) (EQ s544 0) (EQ s664 0) (EQ s898 0) (EQ s915 0))), p1:(OR (EQ s528 0) (EQ s54...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 627 reset in 267 ms.
Product exploration explored 100000 steps with 630 reset in 286 ms.
Computed a total of 133 stabilizing places and 473 stable transitions
Graph (complete) has 2707 edges and 919 vertex of which 912 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.5 ms
Computed a total of 133 stabilizing places and 473 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 177 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 61 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 189971 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 189971 steps, saw 44520 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1509 rows 919 cols
[2023-03-10 20:09:15] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-10 20:09:15] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-10 20:09:15] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 5 ms returned sat
[2023-03-10 20:09:16] [INFO ] After 1191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-10 20:09:17] [INFO ] After 1824ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 482 ms.
[2023-03-10 20:09:17] [INFO ] After 2624ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 88 ms.
Support contains 9 out of 919 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 919/919 places, 1509/1509 transitions.
Graph (trivial) has 949 edges and 919 vertex of which 341 / 919 are part of one of the 38 SCC in 7 ms
Free SCC test removed 303 places
Drop transitions removed 395 transitions
Reduce isomorphic transitions removed 395 transitions.
Graph (complete) has 2196 edges and 616 vertex of which 609 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 254 transitions
Trivial Post-agglo rules discarded 254 transitions
Performed 254 trivial Post agglomeration. Transition count delta: 254
Iterating post reduction 0 with 264 rules applied. Total rules applied 266 place count 609 transition count 850
Reduce places removed 254 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 257 rules applied. Total rules applied 523 place count 355 transition count 847
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 525 place count 353 transition count 847
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 525 place count 353 transition count 790
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 639 place count 296 transition count 790
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 644 place count 291 transition count 785
Iterating global reduction 3 with 5 rules applied. Total rules applied 649 place count 291 transition count 785
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 649 place count 291 transition count 781
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 657 place count 287 transition count 781
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 823 place count 204 transition count 698
Performed 35 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 893 place count 169 transition count 908
Drop transitions removed 12 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 925 place count 169 transition count 876
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 927 place count 168 transition count 893
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 930 place count 168 transition count 890
Drop transitions removed 128 transitions
Redundant transition composition rules discarded 128 transitions
Iterating global reduction 5 with 128 rules applied. Total rules applied 1058 place count 168 transition count 762
Free-agglomeration rule applied 43 times with reduction of 12 identical transitions.
Iterating global reduction 5 with 43 rules applied. Total rules applied 1101 place count 168 transition count 707
Reduce places removed 43 places and 0 transitions.
Drop transitions removed 60 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 5 with 161 rules applied. Total rules applied 1262 place count 125 transition count 589
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1269 place count 118 transition count 542
Iterating global reduction 6 with 7 rules applied. Total rules applied 1276 place count 118 transition count 542
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1278 place count 118 transition count 540
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 7 with 61 rules applied. Total rules applied 1339 place count 118 transition count 479
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1343 place count 118 transition count 479
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1346 place count 118 transition count 476
Applied a total of 1346 rules in 143 ms. Remains 118 /919 variables (removed 801) and now considering 476/1509 (removed 1033) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 118/919 places, 476/1509 transitions.
Incomplete random walk after 10000 steps, including 168 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 20:09:18] [INFO ] Flow matrix only has 276 transitions (discarded 200 similar events)
// Phase 1: matrix 276 rows 118 cols
[2023-03-10 20:09:18] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-10 20:09:18] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 20:09:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 20:09:18] [INFO ] [Nat]Absence check using 5 positive and 13 generalized place invariants in 6 ms returned sat
[2023-03-10 20:09:18] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 20:09:18] [INFO ] State equation strengthened by 141 read => feed constraints.
[2023-03-10 20:09:18] [INFO ] After 83ms SMT Verify possible using 141 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 20:09:18] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-10 20:09:19] [INFO ] After 435ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 9 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 476/476 transitions.
Applied a total of 0 rules in 8 ms. Remains 118 /118 variables (removed 0) and now considering 476/476 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 118/118 places, 476/476 transitions.
Incomplete random walk after 10000 steps, including 170 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 656308 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :{}
Probabilistic random walk after 656308 steps, saw 83138 distinct states, run finished after 3001 ms. (steps per millisecond=218 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-10 20:09:22] [INFO ] Flow matrix only has 276 transitions (discarded 200 similar events)
[2023-03-10 20:09:22] [INFO ] Invariant cache hit.
[2023-03-10 20:09:22] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 20:09:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 20:09:22] [INFO ] [Nat]Absence check using 5 positive and 13 generalized place invariants in 7 ms returned sat
[2023-03-10 20:09:22] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 20:09:22] [INFO ] State equation strengthened by 141 read => feed constraints.
[2023-03-10 20:09:22] [INFO ] After 82ms SMT Verify possible using 141 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 20:09:22] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-10 20:09:22] [INFO ] After 418ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 9 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 476/476 transitions.
Applied a total of 0 rules in 9 ms. Remains 118 /118 variables (removed 0) and now considering 476/476 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 118/118 places, 476/476 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 476/476 transitions.
Applied a total of 0 rules in 7 ms. Remains 118 /118 variables (removed 0) and now considering 476/476 (removed 0) transitions.
[2023-03-10 20:09:22] [INFO ] Flow matrix only has 276 transitions (discarded 200 similar events)
[2023-03-10 20:09:22] [INFO ] Invariant cache hit.
[2023-03-10 20:09:22] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-10 20:09:22] [INFO ] Flow matrix only has 276 transitions (discarded 200 similar events)
[2023-03-10 20:09:22] [INFO ] Invariant cache hit.
[2023-03-10 20:09:22] [INFO ] State equation strengthened by 141 read => feed constraints.
[2023-03-10 20:09:23] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2023-03-10 20:09:23] [INFO ] Redundant transitions in 280 ms returned []
[2023-03-10 20:09:23] [INFO ] Flow matrix only has 276 transitions (discarded 200 similar events)
[2023-03-10 20:09:23] [INFO ] Invariant cache hit.
[2023-03-10 20:09:23] [INFO ] Dead Transitions using invariants and state equation in 317 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1056 ms. Remains : 118/118 places, 476/476 transitions.
Graph (trivial) has 95 edges and 118 vertex of which 32 / 118 are part of one of the 4 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions removed 44 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 244 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 85 transition count 227
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 17 place count 80 transition count 226
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 79 transition count 225
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 19 place count 79 transition count 216
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 37 place count 70 transition count 216
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 40 place count 67 transition count 213
Iterating global reduction 3 with 3 rules applied. Total rules applied 43 place count 67 transition count 213
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 45 place count 65 transition count 211
Iterating global reduction 3 with 2 rules applied. Total rules applied 47 place count 65 transition count 211
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 64 transition count 205
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 64 transition count 205
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 66 place count 64 transition count 188
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 80 place count 57 transition count 181
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 87 place count 57 transition count 174
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 88 place count 56 transition count 173
Iterating global reduction 5 with 1 rules applied. Total rules applied 89 place count 56 transition count 173
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 90 place count 55 transition count 167
Iterating global reduction 5 with 1 rules applied. Total rules applied 91 place count 55 transition count 167
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 108 place count 55 transition count 150
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 114 place count 52 transition count 168
Drop transitions removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 6 with 46 rules applied. Total rules applied 160 place count 52 transition count 122
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 162 place count 50 transition count 117
Iterating global reduction 6 with 2 rules applied. Total rules applied 164 place count 50 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 165 place count 50 transition count 116
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 173 place count 46 transition count 112
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 175 place count 44 transition count 96
Iterating global reduction 7 with 2 rules applied. Total rules applied 177 place count 44 transition count 96
Applied a total of 177 rules in 26 ms. Remains 44 /118 variables (removed 74) and now considering 96/476 (removed 380) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 96 rows 44 cols
[2023-03-10 20:09:23] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-10 20:09:23] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 20:09:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 20:09:23] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-10 20:09:23] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 20:09:23] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 20:09:23] [INFO ] After 23ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 20:09:23] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-10 20:09:23] [INFO ] After 160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (NOT (AND p2 p1)))]
Knowledge based reduction with 4 factoid took 247 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 9 out of 919 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 919/919 places, 1509/1509 transitions.
Applied a total of 0 rules in 21 ms. Remains 919 /919 variables (removed 0) and now considering 1509/1509 (removed 0) transitions.
// Phase 1: matrix 1509 rows 919 cols
[2023-03-10 20:09:24] [INFO ] Computed 5 place invariants in 9 ms
[2023-03-10 20:09:24] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-03-10 20:09:24] [INFO ] Invariant cache hit.
[2023-03-10 20:09:26] [INFO ] Implicit Places using invariants and state equation in 1128 ms returned []
Implicit Place search using SMT with State Equation took 1440 ms to find 0 implicit places.
[2023-03-10 20:09:26] [INFO ] Invariant cache hit.
[2023-03-10 20:09:27] [INFO ] Dead Transitions using invariants and state equation in 1275 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2739 ms. Remains : 919/919 places, 1509/1509 transitions.
Computed a total of 133 stabilizing places and 473 stable transitions
Graph (complete) has 2707 edges and 919 vertex of which 912 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.5 ms
Computed a total of 133 stabilizing places and 473 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 178 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 61 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 197479 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 197479 steps, saw 46074 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-10 20:09:31] [INFO ] Invariant cache hit.
[2023-03-10 20:09:31] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-10 20:09:31] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 5 ms returned sat
[2023-03-10 20:09:33] [INFO ] After 1215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-10 20:09:33] [INFO ] After 2106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 519 ms.
[2023-03-10 20:09:34] [INFO ] After 2941ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 62 ms.
Support contains 9 out of 919 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 919/919 places, 1509/1509 transitions.
Graph (trivial) has 949 edges and 919 vertex of which 341 / 919 are part of one of the 38 SCC in 1 ms
Free SCC test removed 303 places
Drop transitions removed 395 transitions
Reduce isomorphic transitions removed 395 transitions.
Graph (complete) has 2196 edges and 616 vertex of which 609 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 254 transitions
Trivial Post-agglo rules discarded 254 transitions
Performed 254 trivial Post agglomeration. Transition count delta: 254
Iterating post reduction 0 with 264 rules applied. Total rules applied 266 place count 609 transition count 850
Reduce places removed 254 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 257 rules applied. Total rules applied 523 place count 355 transition count 847
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 525 place count 353 transition count 847
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 525 place count 353 transition count 790
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 639 place count 296 transition count 790
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 644 place count 291 transition count 785
Iterating global reduction 3 with 5 rules applied. Total rules applied 649 place count 291 transition count 785
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 649 place count 291 transition count 781
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 657 place count 287 transition count 781
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 823 place count 204 transition count 698
Performed 35 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 893 place count 169 transition count 908
Drop transitions removed 12 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 925 place count 169 transition count 876
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 927 place count 168 transition count 893
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 930 place count 168 transition count 890
Drop transitions removed 128 transitions
Redundant transition composition rules discarded 128 transitions
Iterating global reduction 5 with 128 rules applied. Total rules applied 1058 place count 168 transition count 762
Free-agglomeration rule applied 43 times with reduction of 12 identical transitions.
Iterating global reduction 5 with 43 rules applied. Total rules applied 1101 place count 168 transition count 707
Reduce places removed 43 places and 0 transitions.
Drop transitions removed 60 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 5 with 161 rules applied. Total rules applied 1262 place count 125 transition count 589
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1269 place count 118 transition count 542
Iterating global reduction 6 with 7 rules applied. Total rules applied 1276 place count 118 transition count 542
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1278 place count 118 transition count 540
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 7 with 61 rules applied. Total rules applied 1339 place count 118 transition count 479
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1343 place count 118 transition count 479
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1346 place count 118 transition count 476
Applied a total of 1346 rules in 135 ms. Remains 118 /919 variables (removed 801) and now considering 476/1509 (removed 1033) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 118/919 places, 476/1509 transitions.
Incomplete random walk after 10000 steps, including 176 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 20:09:34] [INFO ] Flow matrix only has 276 transitions (discarded 200 similar events)
// Phase 1: matrix 276 rows 118 cols
[2023-03-10 20:09:34] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-10 20:09:35] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 20:09:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 20:09:35] [INFO ] [Nat]Absence check using 5 positive and 13 generalized place invariants in 4 ms returned sat
[2023-03-10 20:09:35] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 20:09:35] [INFO ] State equation strengthened by 141 read => feed constraints.
[2023-03-10 20:09:35] [INFO ] After 85ms SMT Verify possible using 141 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 20:09:35] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-10 20:09:35] [INFO ] After 420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 9 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 476/476 transitions.
Applied a total of 0 rules in 8 ms. Remains 118 /118 variables (removed 0) and now considering 476/476 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 118/118 places, 476/476 transitions.
Incomplete random walk after 10000 steps, including 173 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 658509 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :{}
Probabilistic random walk after 658509 steps, saw 83390 distinct states, run finished after 3001 ms. (steps per millisecond=219 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-10 20:09:38] [INFO ] Flow matrix only has 276 transitions (discarded 200 similar events)
[2023-03-10 20:09:38] [INFO ] Invariant cache hit.
[2023-03-10 20:09:38] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 20:09:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 20:09:38] [INFO ] [Nat]Absence check using 5 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-10 20:09:38] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 20:09:38] [INFO ] State equation strengthened by 141 read => feed constraints.
[2023-03-10 20:09:38] [INFO ] After 82ms SMT Verify possible using 141 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 20:09:39] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-10 20:09:39] [INFO ] After 409ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 9 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 476/476 transitions.
Applied a total of 0 rules in 7 ms. Remains 118 /118 variables (removed 0) and now considering 476/476 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 118/118 places, 476/476 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 476/476 transitions.
Applied a total of 0 rules in 8 ms. Remains 118 /118 variables (removed 0) and now considering 476/476 (removed 0) transitions.
[2023-03-10 20:09:39] [INFO ] Flow matrix only has 276 transitions (discarded 200 similar events)
[2023-03-10 20:09:39] [INFO ] Invariant cache hit.
[2023-03-10 20:09:39] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-10 20:09:39] [INFO ] Flow matrix only has 276 transitions (discarded 200 similar events)
[2023-03-10 20:09:39] [INFO ] Invariant cache hit.
[2023-03-10 20:09:39] [INFO ] State equation strengthened by 141 read => feed constraints.
[2023-03-10 20:09:39] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2023-03-10 20:09:39] [INFO ] Redundant transitions in 248 ms returned []
[2023-03-10 20:09:39] [INFO ] Flow matrix only has 276 transitions (discarded 200 similar events)
[2023-03-10 20:09:39] [INFO ] Invariant cache hit.
[2023-03-10 20:09:40] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 990 ms. Remains : 118/118 places, 476/476 transitions.
Graph (trivial) has 95 edges and 118 vertex of which 32 / 118 are part of one of the 4 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions removed 44 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 244 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 85 transition count 227
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 17 place count 80 transition count 226
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 79 transition count 225
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 19 place count 79 transition count 216
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 37 place count 70 transition count 216
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 40 place count 67 transition count 213
Iterating global reduction 3 with 3 rules applied. Total rules applied 43 place count 67 transition count 213
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 45 place count 65 transition count 211
Iterating global reduction 3 with 2 rules applied. Total rules applied 47 place count 65 transition count 211
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 64 transition count 205
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 64 transition count 205
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 66 place count 64 transition count 188
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 80 place count 57 transition count 181
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 87 place count 57 transition count 174
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 88 place count 56 transition count 173
Iterating global reduction 5 with 1 rules applied. Total rules applied 89 place count 56 transition count 173
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 90 place count 55 transition count 167
Iterating global reduction 5 with 1 rules applied. Total rules applied 91 place count 55 transition count 167
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 108 place count 55 transition count 150
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 114 place count 52 transition count 168
Drop transitions removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 6 with 46 rules applied. Total rules applied 160 place count 52 transition count 122
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 162 place count 50 transition count 117
Iterating global reduction 6 with 2 rules applied. Total rules applied 164 place count 50 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 165 place count 50 transition count 116
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 173 place count 46 transition count 112
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 175 place count 44 transition count 96
Iterating global reduction 7 with 2 rules applied. Total rules applied 177 place count 44 transition count 96
Applied a total of 177 rules in 34 ms. Remains 44 /118 variables (removed 74) and now considering 96/476 (removed 380) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 96 rows 44 cols
[2023-03-10 20:09:40] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-10 20:09:40] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 20:09:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 20:09:40] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-10 20:09:40] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 20:09:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 20:09:40] [INFO ] After 24ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 20:09:40] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-10 20:09:40] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p2 p1 p0), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (NOT (AND p2 p1)))]
Knowledge based reduction with 4 factoid took 256 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 638 reset in 267 ms.
Product exploration explored 100000 steps with 623 reset in 290 ms.
Support contains 9 out of 919 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 919/919 places, 1509/1509 transitions.
Applied a total of 0 rules in 22 ms. Remains 919 /919 variables (removed 0) and now considering 1509/1509 (removed 0) transitions.
// Phase 1: matrix 1509 rows 919 cols
[2023-03-10 20:09:41] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-10 20:09:42] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-10 20:09:42] [INFO ] Invariant cache hit.
[2023-03-10 20:09:43] [INFO ] Implicit Places using invariants and state equation in 1180 ms returned []
Implicit Place search using SMT with State Equation took 1486 ms to find 0 implicit places.
[2023-03-10 20:09:43] [INFO ] Invariant cache hit.
[2023-03-10 20:09:44] [INFO ] Dead Transitions using invariants and state equation in 1267 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2779 ms. Remains : 919/919 places, 1509/1509 transitions.
Treatment of property CloudDeployment-PT-5b-LTLFireability-05 finished in 36259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 2 out of 956 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 956/956 places, 2549/2549 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 955 transition count 2549
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 934 transition count 1515
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 934 transition count 1515
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 934 transition count 1514
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 48 place count 930 transition count 1510
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 930 transition count 1510
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 929 transition count 1509
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 929 transition count 1509
Applied a total of 54 rules in 113 ms. Remains 929 /956 variables (removed 27) and now considering 1509/2549 (removed 1040) transitions.
// Phase 1: matrix 1509 rows 929 cols
[2023-03-10 20:09:45] [INFO ] Computed 15 place invariants in 6 ms
[2023-03-10 20:09:45] [INFO ] Implicit Places using invariants in 324 ms returned []
[2023-03-10 20:09:45] [INFO ] Invariant cache hit.
[2023-03-10 20:09:46] [INFO ] Implicit Places using invariants and state equation in 1378 ms returned [11, 19, 185, 193, 358, 366, 531, 539, 704, 712]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 1705 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 919/956 places, 1509/2549 transitions.
Applied a total of 0 rules in 22 ms. Remains 919 /919 variables (removed 0) and now considering 1509/1509 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1841 ms. Remains : 919/956 places, 1509/2549 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, p0, p0]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s697 1) (EQ s792 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 14433 steps with 84 reset in 39 ms.
FORMULA CloudDeployment-PT-5b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5b-LTLFireability-06 finished in 1991 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U (G(p0)||(p0&&G(!p1)))) U X(!p0))))'
Support contains 6 out of 956 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 956/956 places, 2549/2549 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 955 transition count 2549
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 935 transition count 1516
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 935 transition count 1516
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 935 transition count 1515
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 46 place count 931 transition count 1511
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 931 transition count 1511
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 930 transition count 1510
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 930 transition count 1510
Applied a total of 52 rules in 114 ms. Remains 930 /956 variables (removed 26) and now considering 1510/2549 (removed 1039) transitions.
// Phase 1: matrix 1510 rows 930 cols
[2023-03-10 20:09:47] [INFO ] Computed 15 place invariants in 5 ms
[2023-03-10 20:09:47] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-03-10 20:09:47] [INFO ] Invariant cache hit.
[2023-03-10 20:09:48] [INFO ] Implicit Places using invariants and state equation in 1329 ms returned [11, 19, 185, 193, 359, 367, 532, 540, 705, 713]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 1641 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 920/956 places, 1510/2549 transitions.
Applied a total of 0 rules in 28 ms. Remains 920 /920 variables (removed 0) and now considering 1510/1510 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1783 ms. Remains : 920/956 places, 1510/2549 transitions.
Stuttering acceptance computed with spot in 290 ms :[p1, (OR p1 p0), p0, true, p0, p0, true, p0]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 1}, { cond=(AND p1 p0), acceptance={} source=5 dest: 3}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 2}]], initial=7, aps=[p1:(AND (EQ s529 1) (EQ s545 1) (EQ s561 1) (EQ s899 1) (EQ s916 1)), p0:(NEQ s206 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 90 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-5b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5b-LTLFireability-08 finished in 2102 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 956 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 956/956 places, 2549/2549 transitions.
Graph (trivial) has 985 edges and 956 vertex of which 355 / 956 are part of one of the 40 SCC in 1 ms
Free SCC test removed 315 places
Ensure Unique test removed 360 transitions
Reduce isomorphic transitions removed 360 transitions.
Graph (complete) has 2502 edges and 641 vertex of which 613 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.6 ms
Discarding 28 places :
Also discarding 1025 output transitions
Drop transitions removed 1025 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 261 transitions
Trivial Post-agglo rules discarded 261 transitions
Performed 261 trivial Post agglomeration. Transition count delta: 261
Iterating post reduction 0 with 261 rules applied. Total rules applied 263 place count 612 transition count 902
Reduce places removed 261 places and 0 transitions.
Iterating post reduction 1 with 261 rules applied. Total rules applied 524 place count 351 transition count 902
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 524 place count 351 transition count 854
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 620 place count 303 transition count 854
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 624 place count 299 transition count 850
Iterating global reduction 2 with 4 rules applied. Total rules applied 628 place count 299 transition count 850
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 629 place count 299 transition count 849
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 1 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 817 place count 205 transition count 755
Performed 26 Post agglomeration using F-continuation condition with reduction of 56 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 869 place count 179 transition count 840
Drop transitions removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 3 with 53 rules applied. Total rules applied 922 place count 179 transition count 787
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 930 place count 175 transition count 855
Drop transitions removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 3 with 64 rules applied. Total rules applied 994 place count 175 transition count 791
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 995 place count 174 transition count 790
Applied a total of 995 rules in 171 ms. Remains 174 /956 variables (removed 782) and now considering 790/2549 (removed 1759) transitions.
[2023-03-10 20:09:49] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
// Phase 1: matrix 606 rows 174 cols
[2023-03-10 20:09:49] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-10 20:09:49] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-10 20:09:49] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2023-03-10 20:09:49] [INFO ] Invariant cache hit.
[2023-03-10 20:09:49] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-10 20:09:49] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
[2023-03-10 20:09:50] [INFO ] Redundant transitions in 770 ms returned []
[2023-03-10 20:09:50] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2023-03-10 20:09:50] [INFO ] Invariant cache hit.
[2023-03-10 20:09:51] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 174/956 places, 790/2549 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1973 ms. Remains : 174/956 places, 790/2549 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s111 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3096 reset in 572 ms.
Product exploration explored 100000 steps with 3085 reset in 459 ms.
Computed a total of 54 stabilizing places and 505 stable transitions
Computed a total of 54 stabilizing places and 505 stable transitions
Detected a total of 54/174 stabilizing places and 505/790 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 333 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 816917 steps, run timeout after 3001 ms. (steps per millisecond=272 ) properties seen :{}
Probabilistic random walk after 816917 steps, saw 106575 distinct states, run finished after 3001 ms. (steps per millisecond=272 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 20:09:55] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2023-03-10 20:09:55] [INFO ] Invariant cache hit.
[2023-03-10 20:09:55] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 20:09:55] [INFO ] After 185ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-10 20:09:55] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-10 20:09:55] [INFO ] After 27ms SMT Verify possible using 30 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-10 20:09:55] [INFO ] After 60ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-10 20:09:55] [INFO ] After 317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 790/790 transitions.
Drop transitions removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 174 transition count 730
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 80 place count 164 transition count 810
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 90 place count 164 transition count 800
Drop transitions removed 85 transitions
Redundant transition composition rules discarded 85 transitions
Iterating global reduction 2 with 85 rules applied. Total rules applied 175 place count 164 transition count 715
Free-agglomeration rule applied 50 times with reduction of 20 identical transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 225 place count 164 transition count 645
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 95 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 145 transitions.
Graph (complete) has 876 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 196 rules applied. Total rules applied 421 place count 113 transition count 500
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 422 place count 113 transition count 499
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 427 place count 108 transition count 469
Iterating global reduction 4 with 5 rules applied. Total rules applied 432 place count 108 transition count 469
Drop transitions removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 4 with 70 rules applied. Total rules applied 502 place count 108 transition count 399
Applied a total of 502 rules in 67 ms. Remains 108 /174 variables (removed 66) and now considering 399/790 (removed 391) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 108/174 places, 399/790 transitions.
Finished random walk after 423 steps, including 8 resets, run visited all 1 properties in 3 ms. (steps per millisecond=141 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 194 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 790/790 transitions.
Applied a total of 0 rules in 17 ms. Remains 174 /174 variables (removed 0) and now considering 790/790 (removed 0) transitions.
[2023-03-10 20:09:56] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2023-03-10 20:09:56] [INFO ] Invariant cache hit.
[2023-03-10 20:09:56] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-03-10 20:09:56] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2023-03-10 20:09:56] [INFO ] Invariant cache hit.
[2023-03-10 20:09:56] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-10 20:09:56] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
[2023-03-10 20:09:57] [INFO ] Redundant transitions in 849 ms returned []
[2023-03-10 20:09:57] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2023-03-10 20:09:57] [INFO ] Invariant cache hit.
[2023-03-10 20:09:58] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1982 ms. Remains : 174/174 places, 790/790 transitions.
Computed a total of 54 stabilizing places and 505 stable transitions
Computed a total of 54 stabilizing places and 505 stable transitions
Detected a total of 54/174 stabilizing places and 505/790 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 324 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 811968 steps, run timeout after 3001 ms. (steps per millisecond=270 ) properties seen :{}
Probabilistic random walk after 811968 steps, saw 105787 distinct states, run finished after 3001 ms. (steps per millisecond=270 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 20:10:01] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2023-03-10 20:10:01] [INFO ] Invariant cache hit.
[2023-03-10 20:10:01] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 20:10:01] [INFO ] After 186ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-10 20:10:01] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-10 20:10:01] [INFO ] After 26ms SMT Verify possible using 30 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-10 20:10:01] [INFO ] After 59ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-10 20:10:01] [INFO ] After 319ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 790/790 transitions.
Drop transitions removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 174 transition count 730
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 80 place count 164 transition count 810
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 90 place count 164 transition count 800
Drop transitions removed 85 transitions
Redundant transition composition rules discarded 85 transitions
Iterating global reduction 2 with 85 rules applied. Total rules applied 175 place count 164 transition count 715
Free-agglomeration rule applied 50 times with reduction of 20 identical transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 225 place count 164 transition count 645
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 95 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 145 transitions.
Graph (complete) has 876 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 196 rules applied. Total rules applied 421 place count 113 transition count 500
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 422 place count 113 transition count 499
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 427 place count 108 transition count 469
Iterating global reduction 4 with 5 rules applied. Total rules applied 432 place count 108 transition count 469
Drop transitions removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 4 with 70 rules applied. Total rules applied 502 place count 108 transition count 399
Applied a total of 502 rules in 57 ms. Remains 108 /174 variables (removed 66) and now considering 399/790 (removed 391) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 108/174 places, 399/790 transitions.
Finished random walk after 575 steps, including 10 resets, run visited all 1 properties in 3 ms. (steps per millisecond=191 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 175 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3076 reset in 403 ms.
Product exploration explored 100000 steps with 3081 reset in 425 ms.
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 790/790 transitions.
Applied a total of 0 rules in 15 ms. Remains 174 /174 variables (removed 0) and now considering 790/790 (removed 0) transitions.
[2023-03-10 20:10:03] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2023-03-10 20:10:03] [INFO ] Invariant cache hit.
[2023-03-10 20:10:03] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-10 20:10:03] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2023-03-10 20:10:03] [INFO ] Invariant cache hit.
[2023-03-10 20:10:03] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-10 20:10:03] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
[2023-03-10 20:10:04] [INFO ] Redundant transitions in 766 ms returned []
[2023-03-10 20:10:04] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2023-03-10 20:10:04] [INFO ] Invariant cache hit.
[2023-03-10 20:10:04] [INFO ] Dead Transitions using invariants and state equation in 423 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1882 ms. Remains : 174/174 places, 790/790 transitions.
Treatment of property CloudDeployment-PT-5b-LTLFireability-09 finished in 16173 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 2 out of 956 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 956/956 places, 2549/2549 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 955 transition count 2549
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 935 transition count 1516
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 935 transition count 1516
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 935 transition count 1515
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 932 transition count 1512
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 932 transition count 1512
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 931 transition count 1511
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 931 transition count 1511
Applied a total of 50 rules in 109 ms. Remains 931 /956 variables (removed 25) and now considering 1511/2549 (removed 1038) transitions.
// Phase 1: matrix 1511 rows 931 cols
[2023-03-10 20:10:05] [INFO ] Computed 15 place invariants in 4 ms
[2023-03-10 20:10:05] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-03-10 20:10:05] [INFO ] Invariant cache hit.
[2023-03-10 20:10:06] [INFO ] Implicit Places using invariants and state equation in 1324 ms returned [11, 19, 187, 195, 360, 368, 533, 541, 706, 714]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 1634 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 921/956 places, 1511/2549 transitions.
Applied a total of 0 rules in 22 ms. Remains 921 /921 variables (removed 0) and now considering 1511/1511 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1766 ms. Remains : 921/956 places, 1511/2549 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s119 0), p0:(EQ s461 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1282 ms.
Product exploration explored 100000 steps with 50000 reset in 1216 ms.
Computed a total of 135 stabilizing places and 475 stable transitions
Graph (complete) has 2709 edges and 921 vertex of which 914 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Computed a total of 135 stabilizing places and 475 stable transitions
Detected a total of 135/921 stabilizing places and 475/1511 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 7 factoid took 120 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-5b-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-5b-LTLFireability-10 finished in 4533 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 956 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 956/956 places, 2549/2549 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 955 transition count 2549
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 935 transition count 1516
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 935 transition count 1516
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 935 transition count 1515
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 932 transition count 1512
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 932 transition count 1512
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 931 transition count 1511
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 931 transition count 1511
Applied a total of 50 rules in 114 ms. Remains 931 /956 variables (removed 25) and now considering 1511/2549 (removed 1038) transitions.
// Phase 1: matrix 1511 rows 931 cols
[2023-03-10 20:10:09] [INFO ] Computed 15 place invariants in 4 ms
[2023-03-10 20:10:10] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-10 20:10:10] [INFO ] Invariant cache hit.
[2023-03-10 20:10:11] [INFO ] Implicit Places using invariants and state equation in 1395 ms returned [11, 19, 185, 193, 358, 366, 531, 539, 706, 714]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 1743 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 921/956 places, 1511/2549 transitions.
Applied a total of 0 rules in 22 ms. Remains 921 /921 variables (removed 0) and now considering 1511/1511 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1880 ms. Remains : 921/956 places, 1511/2549 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s662 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-5b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5b-LTLFireability-13 finished in 1988 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X((p0 U (X(p1)||G(p0))))))))'
Support contains 2 out of 956 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 956/956 places, 2549/2549 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 955 transition count 2549
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 935 transition count 1516
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 935 transition count 1516
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 935 transition count 1515
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 46 place count 931 transition count 1511
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 931 transition count 1511
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 930 transition count 1510
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 930 transition count 1510
Applied a total of 52 rules in 115 ms. Remains 930 /956 variables (removed 26) and now considering 1510/2549 (removed 1039) transitions.
// Phase 1: matrix 1510 rows 930 cols
[2023-03-10 20:10:11] [INFO ] Computed 15 place invariants in 5 ms
[2023-03-10 20:10:12] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-03-10 20:10:12] [INFO ] Invariant cache hit.
[2023-03-10 20:10:13] [INFO ] Implicit Places using invariants and state equation in 1423 ms returned [11, 19, 185, 193, 358, 366, 531, 539, 705, 713]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 1755 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 920/956 places, 1510/2549 transitions.
Applied a total of 0 rules in 22 ms. Remains 920 /920 variables (removed 0) and now considering 1510/1510 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1893 ms. Remains : 920/956 places, 1510/2549 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s571 1), p1:(EQ s298 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 641 reset in 288 ms.
Product exploration explored 100000 steps with 631 reset in 281 ms.
Computed a total of 133 stabilizing places and 473 stable transitions
Graph (complete) has 2708 edges and 920 vertex of which 913 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Computed a total of 133 stabilizing places and 473 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 223 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 63 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1510 rows 920 cols
[2023-03-10 20:10:15] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-10 20:10:15] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 5 ms returned sat
[2023-03-10 20:10:16] [INFO ] After 771ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-10 20:10:16] [INFO ] After 875ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 20:10:16] [INFO ] After 1089ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 20:10:16] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 20:10:17] [INFO ] After 745ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 20:10:17] [INFO ] After 937ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 116 ms.
[2023-03-10 20:10:17] [INFO ] After 1264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 920 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 920/920 places, 1510/1510 transitions.
Graph (trivial) has 957 edges and 920 vertex of which 340 / 920 are part of one of the 39 SCC in 1 ms
Free SCC test removed 301 places
Drop transitions removed 394 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 395 transitions.
Graph (complete) has 2177 edges and 619 vertex of which 612 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 259 transitions
Trivial Post-agglo rules discarded 259 transitions
Performed 259 trivial Post agglomeration. Transition count delta: 259
Iterating post reduction 0 with 269 rules applied. Total rules applied 271 place count 612 transition count 846
Reduce places removed 259 places and 0 transitions.
Iterating post reduction 1 with 259 rules applied. Total rules applied 530 place count 353 transition count 846
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 530 place count 353 transition count 789
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 644 place count 296 transition count 789
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 649 place count 291 transition count 784
Iterating global reduction 2 with 5 rules applied. Total rules applied 654 place count 291 transition count 784
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 654 place count 291 transition count 779
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 664 place count 286 transition count 779
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 828 place count 204 transition count 697
Performed 36 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 900 place count 168 transition count 910
Drop transitions removed 14 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 932 place count 168 transition count 878
Drop transitions removed 155 transitions
Redundant transition composition rules discarded 155 transitions
Iterating global reduction 3 with 155 rules applied. Total rules applied 1087 place count 168 transition count 723
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1089 place count 167 transition count 734
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1090 place count 167 transition count 733
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 1100 place count 167 transition count 723
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1101 place count 166 transition count 716
Iterating global reduction 4 with 1 rules applied. Total rules applied 1102 place count 166 transition count 716
Free-agglomeration rule applied 50 times with reduction of 20 identical transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 1152 place count 166 transition count 646
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 95 transitions
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 140 transitions.
Graph (complete) has 905 edges and 116 vertex of which 115 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 191 rules applied. Total rules applied 1343 place count 115 transition count 506
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1344 place count 115 transition count 505
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1348 place count 111 transition count 481
Iterating global reduction 6 with 4 rules applied. Total rules applied 1352 place count 111 transition count 481
Drop transitions removed 82 transitions
Redundant transition composition rules discarded 82 transitions
Iterating global reduction 6 with 82 rules applied. Total rules applied 1434 place count 111 transition count 399
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1435 place count 111 transition count 399
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1436 place count 110 transition count 398
Applied a total of 1436 rules in 131 ms. Remains 110 /920 variables (removed 810) and now considering 398/1510 (removed 1112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 110/920 places, 398/1510 transitions.
Finished random walk after 53 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 304 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 920/920 places, 1510/1510 transitions.
Applied a total of 0 rules in 23 ms. Remains 920 /920 variables (removed 0) and now considering 1510/1510 (removed 0) transitions.
[2023-03-10 20:10:18] [INFO ] Invariant cache hit.
[2023-03-10 20:10:18] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-10 20:10:18] [INFO ] Invariant cache hit.
[2023-03-10 20:10:19] [INFO ] Implicit Places using invariants and state equation in 1267 ms returned []
Implicit Place search using SMT with State Equation took 1629 ms to find 0 implicit places.
[2023-03-10 20:10:19] [INFO ] Invariant cache hit.
[2023-03-10 20:10:21] [INFO ] Dead Transitions using invariants and state equation in 1288 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2941 ms. Remains : 920/920 places, 1510/1510 transitions.
Computed a total of 133 stabilizing places and 473 stable transitions
Graph (complete) has 2708 edges and 920 vertex of which 913 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Computed a total of 133 stabilizing places and 473 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 295 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 64 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 20:10:21] [INFO ] Invariant cache hit.
[2023-03-10 20:10:22] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 5 ms returned sat
[2023-03-10 20:10:22] [INFO ] After 752ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-10 20:10:23] [INFO ] After 853ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 20:10:23] [INFO ] After 1073ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 20:10:23] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 5 ms returned sat
[2023-03-10 20:10:23] [INFO ] After 677ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 20:10:24] [INFO ] After 868ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 111 ms.
[2023-03-10 20:10:24] [INFO ] After 1194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 920 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 920/920 places, 1510/1510 transitions.
Graph (trivial) has 957 edges and 920 vertex of which 340 / 920 are part of one of the 39 SCC in 1 ms
Free SCC test removed 301 places
Drop transitions removed 394 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 395 transitions.
Graph (complete) has 2177 edges and 619 vertex of which 612 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 259 transitions
Trivial Post-agglo rules discarded 259 transitions
Performed 259 trivial Post agglomeration. Transition count delta: 259
Iterating post reduction 0 with 269 rules applied. Total rules applied 271 place count 612 transition count 846
Reduce places removed 259 places and 0 transitions.
Iterating post reduction 1 with 259 rules applied. Total rules applied 530 place count 353 transition count 846
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 530 place count 353 transition count 789
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 644 place count 296 transition count 789
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 649 place count 291 transition count 784
Iterating global reduction 2 with 5 rules applied. Total rules applied 654 place count 291 transition count 784
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 654 place count 291 transition count 779
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 664 place count 286 transition count 779
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 828 place count 204 transition count 697
Performed 36 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 900 place count 168 transition count 910
Drop transitions removed 14 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 932 place count 168 transition count 878
Drop transitions removed 155 transitions
Redundant transition composition rules discarded 155 transitions
Iterating global reduction 3 with 155 rules applied. Total rules applied 1087 place count 168 transition count 723
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1089 place count 167 transition count 734
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1090 place count 167 transition count 733
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 1100 place count 167 transition count 723
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1101 place count 166 transition count 716
Iterating global reduction 4 with 1 rules applied. Total rules applied 1102 place count 166 transition count 716
Free-agglomeration rule applied 50 times with reduction of 20 identical transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 1152 place count 166 transition count 646
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 95 transitions
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 140 transitions.
Graph (complete) has 905 edges and 116 vertex of which 115 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 191 rules applied. Total rules applied 1343 place count 115 transition count 506
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1344 place count 115 transition count 505
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1348 place count 111 transition count 481
Iterating global reduction 6 with 4 rules applied. Total rules applied 1352 place count 111 transition count 481
Drop transitions removed 82 transitions
Redundant transition composition rules discarded 82 transitions
Iterating global reduction 6 with 82 rules applied. Total rules applied 1434 place count 111 transition count 399
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1435 place count 111 transition count 399
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1436 place count 110 transition count 398
Applied a total of 1436 rules in 141 ms. Remains 110 /920 variables (removed 810) and now considering 398/1510 (removed 1112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 110/920 places, 398/1510 transitions.
Finished random walk after 323 steps, including 4 resets, run visited all 2 properties in 7 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 283 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 639 reset in 264 ms.
Product exploration explored 100000 steps with 617 reset in 297 ms.
Support contains 2 out of 920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 920/920 places, 1510/1510 transitions.
Applied a total of 0 rules in 22 ms. Remains 920 /920 variables (removed 0) and now considering 1510/1510 (removed 0) transitions.
[2023-03-10 20:10:25] [INFO ] Invariant cache hit.
[2023-03-10 20:10:26] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-10 20:10:26] [INFO ] Invariant cache hit.
[2023-03-10 20:10:27] [INFO ] Implicit Places using invariants and state equation in 1177 ms returned []
Implicit Place search using SMT with State Equation took 1501 ms to find 0 implicit places.
[2023-03-10 20:10:27] [INFO ] Invariant cache hit.
[2023-03-10 20:10:28] [INFO ] Dead Transitions using invariants and state equation in 1191 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2716 ms. Remains : 920/920 places, 1510/1510 transitions.
Treatment of property CloudDeployment-PT-5b-LTLFireability-14 finished in 17136 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p1 U X(G(!p2)))&&p0)))'
Found a Lengthening insensitive property : CloudDeployment-PT-5b-LTLFireability-04
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) p2), p2, p2]
Support contains 24 out of 956 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 956/956 places, 2549/2549 transitions.
Graph (trivial) has 965 edges and 956 vertex of which 346 / 956 are part of one of the 39 SCC in 0 ms
Free SCC test removed 307 places
Ensure Unique test removed 351 transitions
Reduce isomorphic transitions removed 351 transitions.
Graph (complete) has 2518 edges and 649 vertex of which 648 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 261 transitions
Trivial Post-agglo rules discarded 261 transitions
Performed 261 trivial Post agglomeration. Transition count delta: 261
Iterating post reduction 0 with 261 rules applied. Total rules applied 263 place count 648 transition count 1936
Reduce places removed 261 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 264 rules applied. Total rules applied 527 place count 387 transition count 1933
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 529 place count 385 transition count 1933
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 529 place count 385 transition count 1884
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 627 place count 336 transition count 1884
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 631 place count 332 transition count 1880
Iterating global reduction 3 with 4 rules applied. Total rules applied 635 place count 332 transition count 1880
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 636 place count 332 transition count 1879
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 636 place count 332 transition count 1878
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 638 place count 331 transition count 1878
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 1 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 828 place count 236 transition count 1783
Performed 25 Post agglomeration using F-continuation condition with reduction of 54 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 878 place count 211 transition count 1909
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 894 place count 211 transition count 1893
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 898 place count 211 transition count 1889
Applied a total of 898 rules in 158 ms. Remains 211 /956 variables (removed 745) and now considering 1889/2549 (removed 660) transitions.
[2023-03-10 20:10:29] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
// Phase 1: matrix 1706 rows 211 cols
[2023-03-10 20:10:29] [INFO ] Computed 16 place invariants in 11 ms
[2023-03-10 20:10:29] [INFO ] Implicit Places using invariants in 627 ms returned []
[2023-03-10 20:10:29] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2023-03-10 20:10:29] [INFO ] Invariant cache hit.
[2023-03-10 20:10:30] [INFO ] State equation strengthened by 228 read => feed constraints.
[2023-03-10 20:10:31] [INFO ] Implicit Places using invariants and state equation in 2056 ms returned []
Implicit Place search using SMT with State Equation took 2685 ms to find 0 implicit places.
[2023-03-10 20:10:31] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2023-03-10 20:10:31] [INFO ] Invariant cache hit.
[2023-03-10 20:10:33] [INFO ] Dead Transitions using invariants and state equation in 1540 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 211/956 places, 1889/2549 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4385 ms. Remains : 211/956 places, 1889/2549 transitions.
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s174 0) (OR (EQ s4 0) (EQ s10 0) (EQ s17 0) (EQ s39 0) (EQ s45 0) (EQ s51 0) (EQ s73 0) (EQ s79 0) (EQ s86 0) (EQ s107 0) (EQ s113 0) (EQ s120...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2880 reset in 914 ms.
Product exploration explored 100000 steps with 2889 reset in 889 ms.
Computed a total of 68 stabilizing places and 1569 stable transitions
Graph (complete) has 2047 edges and 211 vertex of which 184 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.6 ms
Computed a total of 68 stabilizing places and 1569 stable transitions
Detected a total of 68/211 stabilizing places and 1569/1889 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X p0), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 1120 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter sensitive) to 3 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) p2), p2, p2]
Incomplete random walk after 10000 steps, including 314 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-10 20:10:37] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2023-03-10 20:10:37] [INFO ] Invariant cache hit.
[2023-03-10 20:10:37] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:8
[2023-03-10 20:10:37] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 7 ms returned sat
[2023-03-10 20:10:38] [INFO ] After 1006ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2023-03-10 20:10:38] [INFO ] State equation strengthened by 228 read => feed constraints.
[2023-03-10 20:10:39] [INFO ] After 620ms SMT Verify possible using 228 Read/Feed constraints in natural domain returned unsat :2 sat :8
[2023-03-10 20:10:40] [INFO ] After 1437ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 682 ms.
[2023-03-10 20:10:41] [INFO ] After 3277ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
Fused 10 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 24 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 1889/1889 transitions.
Drop transitions removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 211 transition count 1850
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 59 place count 201 transition count 1930
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 67 place count 201 transition count 1922
Drop transitions removed 130 transitions
Redundant transition composition rules discarded 130 transitions
Iterating global reduction 2 with 130 rules applied. Total rules applied 197 place count 201 transition count 1792
Free-agglomeration rule applied 48 times with reduction of 12 identical transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 245 place count 201 transition count 1732
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 60 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 2 with 166 rules applied. Total rules applied 411 place count 153 transition count 1614
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 418 place count 146 transition count 1567
Iterating global reduction 3 with 7 rules applied. Total rules applied 425 place count 146 transition count 1567
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 427 place count 146 transition count 1565
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 4 with 61 rules applied. Total rules applied 488 place count 146 transition count 1504
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 490 place count 146 transition count 1504
Applied a total of 490 rules in 184 ms. Remains 146 /211 variables (removed 65) and now considering 1504/1889 (removed 385) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 146/211 places, 1504/1889 transitions.
Incomplete random walk after 10000 steps, including 264 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :5
Running SMT prover for 3 properties.
[2023-03-10 20:10:42] [INFO ] Flow matrix only has 1304 transitions (discarded 200 similar events)
// Phase 1: matrix 1304 rows 146 cols
[2023-03-10 20:10:42] [INFO ] Computed 16 place invariants in 8 ms
[2023-03-10 20:10:42] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 20:10:42] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 6 ms returned sat
[2023-03-10 20:10:42] [INFO ] After 520ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 20:10:42] [INFO ] State equation strengthened by 158 read => feed constraints.
[2023-03-10 20:10:42] [INFO ] After 212ms SMT Verify possible using 158 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-10 20:10:43] [INFO ] After 400ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-10 20:10:43] [INFO ] After 1108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 19 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 1504/1504 transitions.
Graph (trivial) has 48 edges and 146 vertex of which 2 / 146 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 143 transition count 1500
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 143 transition count 1499
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 1 with 27 rules applied. Total rules applied 33 place count 143 transition count 1472
Free-agglomeration rule applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 143 transition count 1469
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 56 place count 140 transition count 1452
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 71 place count 140 transition count 1437
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 140 transition count 1437
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 139 transition count 1436
Applied a total of 73 rules in 154 ms. Remains 139 /146 variables (removed 7) and now considering 1436/1504 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 139/146 places, 1436/1504 transitions.
Incomplete random walk after 10000 steps, including 381 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 373870 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :{}
Probabilistic random walk after 373870 steps, saw 57167 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-10 20:10:46] [INFO ] Flow matrix only has 1241 transitions (discarded 195 similar events)
// Phase 1: matrix 1241 rows 139 cols
[2023-03-10 20:10:46] [INFO ] Computed 16 place invariants in 7 ms
[2023-03-10 20:10:46] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 20:10:46] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 6 ms returned sat
[2023-03-10 20:10:47] [INFO ] After 473ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 20:10:47] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-10 20:10:47] [INFO ] After 125ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-10 20:10:47] [INFO ] After 293ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-10 20:10:47] [INFO ] After 942ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 19 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 1436/1436 transitions.
Applied a total of 0 rules in 27 ms. Remains 139 /139 variables (removed 0) and now considering 1436/1436 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 139/139 places, 1436/1436 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 1436/1436 transitions.
Applied a total of 0 rules in 24 ms. Remains 139 /139 variables (removed 0) and now considering 1436/1436 (removed 0) transitions.
[2023-03-10 20:10:47] [INFO ] Flow matrix only has 1241 transitions (discarded 195 similar events)
[2023-03-10 20:10:47] [INFO ] Invariant cache hit.
[2023-03-10 20:10:48] [INFO ] Implicit Places using invariants in 534 ms returned []
[2023-03-10 20:10:48] [INFO ] Flow matrix only has 1241 transitions (discarded 195 similar events)
[2023-03-10 20:10:48] [INFO ] Invariant cache hit.
[2023-03-10 20:10:48] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-10 20:10:49] [INFO ] Implicit Places using invariants and state equation in 1468 ms returned []
Implicit Place search using SMT with State Equation took 2004 ms to find 0 implicit places.
[2023-03-10 20:10:49] [INFO ] Redundant transitions in 65 ms returned []
[2023-03-10 20:10:49] [INFO ] Flow matrix only has 1241 transitions (discarded 195 similar events)
[2023-03-10 20:10:49] [INFO ] Invariant cache hit.
[2023-03-10 20:10:51] [INFO ] Dead Transitions using invariants and state equation in 1386 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3486 ms. Remains : 139/139 places, 1436/1436 transitions.
Graph (trivial) has 114 edges and 139 vertex of which 40 / 139 are part of one of the 5 SCC in 0 ms
Free SCC test removed 35 places
Drop transitions removed 60 transitions
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 255 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 104 transition count 1171
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 94 transition count 1170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 93 transition count 1170
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 23 place count 93 transition count 1162
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 39 place count 85 transition count 1162
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 43 place count 81 transition count 1158
Iterating global reduction 3 with 4 rules applied. Total rules applied 47 place count 81 transition count 1158
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 51 place count 77 transition count 1138
Iterating global reduction 3 with 4 rules applied. Total rules applied 55 place count 77 transition count 1138
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 79 place count 77 transition count 1114
Performed 7 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 93 place count 70 transition count 1105
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 101 place count 70 transition count 1097
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 109 place count 66 transition count 1113
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 5 with 30 rules applied. Total rules applied 139 place count 66 transition count 1083
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 139 place count 66 transition count 1079
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 147 place count 62 transition count 1079
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 148 place count 62 transition count 1078
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 149 place count 61 transition count 1078
Applied a total of 149 rules in 84 ms. Remains 61 /139 variables (removed 78) and now considering 1078/1436 (removed 358) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1078 rows 61 cols
[2023-03-10 20:10:51] [INFO ] Computed 21 place invariants in 7 ms
[2023-03-10 20:10:51] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 20:10:51] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 6 ms returned sat
[2023-03-10 20:10:51] [INFO ] After 380ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 20:10:52] [INFO ] After 509ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-10 20:10:52] [INFO ] After 637ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X p0), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (F (AND (NOT p0) p2)), (F (AND p0 (NOT p1) p2)), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 28 factoid took 1454 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Support contains 24 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 1889/1889 transitions.
Applied a total of 0 rules in 6 ms. Remains 211 /211 variables (removed 0) and now considering 1889/1889 (removed 0) transitions.
[2023-03-10 20:10:53] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
// Phase 1: matrix 1706 rows 211 cols
[2023-03-10 20:10:53] [INFO ] Computed 16 place invariants in 11 ms
[2023-03-10 20:10:54] [INFO ] Implicit Places using invariants in 587 ms returned []
[2023-03-10 20:10:54] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2023-03-10 20:10:54] [INFO ] Invariant cache hit.
[2023-03-10 20:10:54] [INFO ] State equation strengthened by 228 read => feed constraints.
[2023-03-10 20:10:56] [INFO ] Implicit Places using invariants and state equation in 2215 ms returned []
Implicit Place search using SMT with State Equation took 2813 ms to find 0 implicit places.
[2023-03-10 20:10:56] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2023-03-10 20:10:56] [INFO ] Invariant cache hit.
[2023-03-10 20:10:58] [INFO ] Dead Transitions using invariants and state equation in 1539 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4358 ms. Remains : 211/211 places, 1889/1889 transitions.
Computed a total of 68 stabilizing places and 1569 stable transitions
Graph (complete) has 2047 edges and 211 vertex of which 184 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.5 ms
Computed a total of 68 stabilizing places and 1569 stable transitions
Detected a total of 68/211 stabilizing places and 1569/1889 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1))), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 826 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Incomplete random walk after 10000 steps, including 293 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-10 20:10:59] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2023-03-10 20:10:59] [INFO ] Invariant cache hit.
[2023-03-10 20:11:00] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-10 20:11:00] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 9 ms returned sat
[2023-03-10 20:11:01] [INFO ] After 912ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-10 20:11:01] [INFO ] State equation strengthened by 228 read => feed constraints.
[2023-03-10 20:11:01] [INFO ] After 573ms SMT Verify possible using 228 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-10 20:11:02] [INFO ] After 1272ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 556 ms.
[2023-03-10 20:11:02] [INFO ] After 2868ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 3 ms.
Support contains 24 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 1889/1889 transitions.
Drop transitions removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 211 transition count 1850
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 59 place count 201 transition count 1930
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 67 place count 201 transition count 1922
Drop transitions removed 130 transitions
Redundant transition composition rules discarded 130 transitions
Iterating global reduction 2 with 130 rules applied. Total rules applied 197 place count 201 transition count 1792
Free-agglomeration rule applied 48 times with reduction of 12 identical transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 245 place count 201 transition count 1732
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 60 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 2 with 166 rules applied. Total rules applied 411 place count 153 transition count 1614
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 418 place count 146 transition count 1567
Iterating global reduction 3 with 7 rules applied. Total rules applied 425 place count 146 transition count 1567
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 427 place count 146 transition count 1565
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 4 with 61 rules applied. Total rules applied 488 place count 146 transition count 1504
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 490 place count 146 transition count 1504
Applied a total of 490 rules in 181 ms. Remains 146 /211 variables (removed 65) and now considering 1504/1889 (removed 385) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 146/211 places, 1504/1889 transitions.
Incomplete random walk after 10000 steps, including 267 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 306525 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 306525 steps, saw 43747 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-10 20:11:06] [INFO ] Flow matrix only has 1304 transitions (discarded 200 similar events)
// Phase 1: matrix 1304 rows 146 cols
[2023-03-10 20:11:06] [INFO ] Computed 16 place invariants in 8 ms
[2023-03-10 20:11:06] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-10 20:11:07] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 6 ms returned sat
[2023-03-10 20:11:07] [INFO ] After 671ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-10 20:11:07] [INFO ] State equation strengthened by 158 read => feed constraints.
[2023-03-10 20:11:08] [INFO ] After 344ms SMT Verify possible using 158 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-10 20:11:08] [INFO ] After 798ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 323 ms.
[2023-03-10 20:11:08] [INFO ] After 1890ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 26 ms.
Support contains 24 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 1504/1504 transitions.
Applied a total of 0 rules in 29 ms. Remains 146 /146 variables (removed 0) and now considering 1504/1504 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 146/146 places, 1504/1504 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 1504/1504 transitions.
Applied a total of 0 rules in 25 ms. Remains 146 /146 variables (removed 0) and now considering 1504/1504 (removed 0) transitions.
[2023-03-10 20:11:08] [INFO ] Flow matrix only has 1304 transitions (discarded 200 similar events)
[2023-03-10 20:11:08] [INFO ] Invariant cache hit.
[2023-03-10 20:11:09] [INFO ] Implicit Places using invariants in 564 ms returned []
[2023-03-10 20:11:09] [INFO ] Flow matrix only has 1304 transitions (discarded 200 similar events)
[2023-03-10 20:11:09] [INFO ] Invariant cache hit.
[2023-03-10 20:11:09] [INFO ] State equation strengthened by 158 read => feed constraints.
[2023-03-10 20:11:11] [INFO ] Implicit Places using invariants and state equation in 1562 ms returned []
Implicit Place search using SMT with State Equation took 2128 ms to find 0 implicit places.
[2023-03-10 20:11:11] [INFO ] Redundant transitions in 319 ms returned []
[2023-03-10 20:11:11] [INFO ] Flow matrix only has 1304 transitions (discarded 200 similar events)
[2023-03-10 20:11:11] [INFO ] Invariant cache hit.
[2023-03-10 20:11:12] [INFO ] Dead Transitions using invariants and state equation in 1355 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3836 ms. Remains : 146/146 places, 1504/1504 transitions.
Graph (trivial) has 108 edges and 146 vertex of which 32 / 146 are part of one of the 4 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions removed 48 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 248 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 118 transition count 1247
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 109 transition count 1245
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 24 place count 107 transition count 1244
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 24 place count 107 transition count 1236
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 40 place count 99 transition count 1236
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 43 place count 96 transition count 1233
Iterating global reduction 3 with 3 rules applied. Total rules applied 46 place count 96 transition count 1233
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 49 place count 93 transition count 1215
Iterating global reduction 3 with 3 rules applied. Total rules applied 52 place count 93 transition count 1215
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 94 place count 93 transition count 1173
Performed 7 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 108 place count 86 transition count 1164
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 114 place count 86 transition count 1158
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 120 place count 83 transition count 1173
Drop transitions removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 5 with 35 rules applied. Total rules applied 155 place count 83 transition count 1138
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 155 place count 83 transition count 1135
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 161 place count 80 transition count 1135
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 163 place count 80 transition count 1133
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 165 place count 78 transition count 1133
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 166 place count 78 transition count 1133
Applied a total of 166 rules in 116 ms. Remains 78 /146 variables (removed 68) and now considering 1133/1504 (removed 371) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 1133 rows 78 cols
[2023-03-10 20:11:12] [INFO ] Computed 20 place invariants in 7 ms
[2023-03-10 20:11:13] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-10 20:11:13] [INFO ] [Nat]Absence check using 0 positive and 20 generalized place invariants in 6 ms returned sat
[2023-03-10 20:11:13] [INFO ] After 555ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-10 20:11:13] [INFO ] After 875ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 237 ms.
[2023-03-10 20:11:14] [INFO ] After 1184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1))), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 18 factoid took 890 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Product exploration explored 100000 steps with 2889 reset in 825 ms.
Product exploration explored 100000 steps with 2889 reset in 843 ms.
Support contains 24 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 1889/1889 transitions.
Applied a total of 0 rules in 6 ms. Remains 211 /211 variables (removed 0) and now considering 1889/1889 (removed 0) transitions.
[2023-03-10 20:11:17] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
// Phase 1: matrix 1706 rows 211 cols
[2023-03-10 20:11:17] [INFO ] Computed 16 place invariants in 10 ms
[2023-03-10 20:11:17] [INFO ] Implicit Places using invariants in 568 ms returned []
[2023-03-10 20:11:17] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2023-03-10 20:11:17] [INFO ] Invariant cache hit.
[2023-03-10 20:11:18] [INFO ] State equation strengthened by 228 read => feed constraints.
[2023-03-10 20:11:19] [INFO ] Implicit Places using invariants and state equation in 2019 ms returned []
Implicit Place search using SMT with State Equation took 2598 ms to find 0 implicit places.
[2023-03-10 20:11:19] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2023-03-10 20:11:19] [INFO ] Invariant cache hit.
[2023-03-10 20:11:21] [INFO ] Dead Transitions using invariants and state equation in 1499 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4104 ms. Remains : 211/211 places, 1889/1889 transitions.
Treatment of property CloudDeployment-PT-5b-LTLFireability-04 finished in 52776 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(G((X(p2)||p1))))))))'
Found a Lengthening insensitive property : CloudDeployment-PT-5b-LTLFireability-05
Stuttering acceptance computed with spot in 202 ms :[true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 9 out of 956 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 956/956 places, 2549/2549 transitions.
Graph (trivial) has 973 edges and 956 vertex of which 341 / 956 are part of one of the 38 SCC in 1 ms
Free SCC test removed 303 places
Ensure Unique test removed 347 transitions
Reduce isomorphic transitions removed 347 transitions.
Graph (complete) has 2522 edges and 653 vertex of which 625 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 1025 output transitions
Drop transitions removed 1025 transitions
Drop transitions removed 263 transitions
Trivial Post-agglo rules discarded 263 transitions
Performed 263 trivial Post agglomeration. Transition count delta: 263
Iterating post reduction 0 with 263 rules applied. Total rules applied 265 place count 625 transition count 914
Reduce places removed 263 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 266 rules applied. Total rules applied 531 place count 362 transition count 911
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 533 place count 360 transition count 911
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 533 place count 360 transition count 863
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 629 place count 312 transition count 863
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 635 place count 306 transition count 857
Iterating global reduction 3 with 6 rules applied. Total rules applied 641 place count 306 transition count 857
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 642 place count 306 transition count 856
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 642 place count 306 transition count 854
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 646 place count 304 transition count 854
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 836 place count 209 transition count 759
Performed 26 Post agglomeration using F-continuation condition with reduction of 56 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 888 place count 183 transition count 848
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 889 place count 183 transition count 847
Applied a total of 889 rules in 69 ms. Remains 183 /956 variables (removed 773) and now considering 847/2549 (removed 1702) transitions.
[2023-03-10 20:11:22] [INFO ] Flow matrix only has 685 transitions (discarded 162 similar events)
// Phase 1: matrix 685 rows 183 cols
[2023-03-10 20:11:22] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 20:11:22] [INFO ] Implicit Places using invariants in 212 ms returned []
[2023-03-10 20:11:22] [INFO ] Flow matrix only has 685 transitions (discarded 162 similar events)
[2023-03-10 20:11:22] [INFO ] Invariant cache hit.
[2023-03-10 20:11:22] [INFO ] State equation strengthened by 216 read => feed constraints.
[2023-03-10 20:11:22] [INFO ] Implicit Places using invariants and state equation in 679 ms returned []
Implicit Place search using SMT with State Equation took 894 ms to find 0 implicit places.
[2023-03-10 20:11:22] [INFO ] Flow matrix only has 685 transitions (discarded 162 similar events)
[2023-03-10 20:11:22] [INFO ] Invariant cache hit.
[2023-03-10 20:11:23] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 183/956 places, 847/2549 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1426 ms. Remains : 183/956 places, 847/2549 transitions.
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=(AND p1 p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(AND (OR (EQ s31 0) (EQ s34 0) (EQ s58 0) (EQ s159 0)) (OR (EQ s91 0) (EQ s97 0) (EQ s116 0) (EQ s170 0) (EQ s181 0))), p1:(OR (EQ s91 0) (EQ s97 0) (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2892 reset in 535 ms.
Product exploration explored 100000 steps with 2860 reset in 559 ms.
Computed a total of 50 stabilizing places and 509 stable transitions
Computed a total of 50 stabilizing places and 509 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 174 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 294 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 421285 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :{}
Probabilistic random walk after 421285 steps, saw 61154 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-10 20:11:28] [INFO ] Flow matrix only has 685 transitions (discarded 162 similar events)
[2023-03-10 20:11:28] [INFO ] Invariant cache hit.
[2023-03-10 20:11:28] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-10 20:11:28] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 20:11:28] [INFO ] After 472ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-10 20:11:28] [INFO ] State equation strengthened by 216 read => feed constraints.
[2023-03-10 20:11:29] [INFO ] After 296ms SMT Verify possible using 216 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-10 20:11:29] [INFO ] After 630ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 257 ms.
[2023-03-10 20:11:29] [INFO ] After 1457ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 1 ms.
Support contains 9 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 847/847 transitions.
Drop transitions removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 183 transition count 782
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -132
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 28 rules applied. Total rules applied 93 place count 169 transition count 914
Drop transitions removed 11 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 120 place count 169 transition count 887
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 168 transition count 904
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 125 place count 168 transition count 901
Drop transitions removed 133 transitions
Redundant transition composition rules discarded 133 transitions
Iterating global reduction 3 with 133 rules applied. Total rules applied 258 place count 168 transition count 768
Free-agglomeration rule applied 43 times with reduction of 12 identical transitions.
Iterating global reduction 3 with 43 rules applied. Total rules applied 301 place count 168 transition count 713
Reduce places removed 43 places and 0 transitions.
Drop transitions removed 60 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 3 with 161 rules applied. Total rules applied 462 place count 125 transition count 595
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 469 place count 118 transition count 548
Iterating global reduction 4 with 7 rules applied. Total rules applied 476 place count 118 transition count 548
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 478 place count 118 transition count 546
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 5 with 61 rules applied. Total rules applied 539 place count 118 transition count 485
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 543 place count 118 transition count 485
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 546 place count 118 transition count 482
Applied a total of 546 rules in 84 ms. Remains 118 /183 variables (removed 65) and now considering 482/847 (removed 365) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 118/183 places, 482/847 transitions.
Incomplete random walk after 10000 steps, including 197 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 20:11:30] [INFO ] Flow matrix only has 282 transitions (discarded 200 similar events)
// Phase 1: matrix 282 rows 118 cols
[2023-03-10 20:11:30] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 20:11:30] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 20:11:30] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-10 20:11:30] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 20:11:30] [INFO ] State equation strengthened by 146 read => feed constraints.
[2023-03-10 20:11:30] [INFO ] After 83ms SMT Verify possible using 146 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 20:11:30] [INFO ] After 153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-10 20:11:30] [INFO ] After 415ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 9 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 482/482 transitions.
Applied a total of 0 rules in 8 ms. Remains 118 /118 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 118/118 places, 482/482 transitions.
Incomplete random walk after 10000 steps, including 192 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 705725 steps, run timeout after 3001 ms. (steps per millisecond=235 ) properties seen :{}
Probabilistic random walk after 705725 steps, saw 91994 distinct states, run finished after 3001 ms. (steps per millisecond=235 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-10 20:11:33] [INFO ] Flow matrix only has 282 transitions (discarded 200 similar events)
[2023-03-10 20:11:33] [INFO ] Invariant cache hit.
[2023-03-10 20:11:33] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 20:11:33] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-10 20:11:34] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 20:11:34] [INFO ] State equation strengthened by 146 read => feed constraints.
[2023-03-10 20:11:34] [INFO ] After 81ms SMT Verify possible using 146 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 20:11:34] [INFO ] After 162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-10 20:11:34] [INFO ] After 421ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 9 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 482/482 transitions.
Applied a total of 0 rules in 7 ms. Remains 118 /118 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 118/118 places, 482/482 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 482/482 transitions.
Applied a total of 0 rules in 8 ms. Remains 118 /118 variables (removed 0) and now considering 482/482 (removed 0) transitions.
[2023-03-10 20:11:34] [INFO ] Flow matrix only has 282 transitions (discarded 200 similar events)
[2023-03-10 20:11:34] [INFO ] Invariant cache hit.
[2023-03-10 20:11:34] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-10 20:11:34] [INFO ] Flow matrix only has 282 transitions (discarded 200 similar events)
[2023-03-10 20:11:34] [INFO ] Invariant cache hit.
[2023-03-10 20:11:34] [INFO ] State equation strengthened by 146 read => feed constraints.
[2023-03-10 20:11:34] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2023-03-10 20:11:35] [INFO ] Redundant transitions in 302 ms returned []
[2023-03-10 20:11:35] [INFO ] Flow matrix only has 282 transitions (discarded 200 similar events)
[2023-03-10 20:11:35] [INFO ] Invariant cache hit.
[2023-03-10 20:11:35] [INFO ] Dead Transitions using invariants and state equation in 325 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1111 ms. Remains : 118/118 places, 482/482 transitions.
Graph (trivial) has 95 edges and 118 vertex of which 32 / 118 are part of one of the 4 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions removed 49 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 249 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 85 transition count 228
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 17 place count 80 transition count 227
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 79 transition count 226
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 19 place count 79 transition count 217
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 37 place count 70 transition count 217
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 40 place count 67 transition count 214
Iterating global reduction 3 with 3 rules applied. Total rules applied 43 place count 67 transition count 214
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 45 place count 65 transition count 212
Iterating global reduction 3 with 2 rules applied. Total rules applied 47 place count 65 transition count 212
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 64 transition count 206
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 64 transition count 206
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 66 place count 64 transition count 189
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 80 place count 57 transition count 182
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 87 place count 57 transition count 175
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 88 place count 56 transition count 174
Iterating global reduction 5 with 1 rules applied. Total rules applied 89 place count 56 transition count 174
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 90 place count 55 transition count 168
Iterating global reduction 5 with 1 rules applied. Total rules applied 91 place count 55 transition count 168
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 108 place count 55 transition count 151
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 114 place count 52 transition count 169
Drop transitions removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 6 with 46 rules applied. Total rules applied 160 place count 52 transition count 123
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 162 place count 50 transition count 118
Iterating global reduction 6 with 2 rules applied. Total rules applied 164 place count 50 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 165 place count 50 transition count 117
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 173 place count 46 transition count 113
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 175 place count 44 transition count 97
Iterating global reduction 7 with 2 rules applied. Total rules applied 177 place count 44 transition count 97
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 178 place count 44 transition count 97
Applied a total of 178 rules in 17 ms. Remains 44 /118 variables (removed 74) and now considering 97/482 (removed 385) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 97 rows 44 cols
[2023-03-10 20:11:35] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 20:11:35] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 20:11:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 20:11:35] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-10 20:11:35] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 20:11:35] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 20:11:35] [INFO ] After 22ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 20:11:35] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-10 20:11:35] [INFO ] After 160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (NOT (AND p2 p1)))]
Knowledge based reduction with 4 factoid took 236 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 9 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 847/847 transitions.
Applied a total of 0 rules in 2 ms. Remains 183 /183 variables (removed 0) and now considering 847/847 (removed 0) transitions.
[2023-03-10 20:11:36] [INFO ] Flow matrix only has 685 transitions (discarded 162 similar events)
// Phase 1: matrix 685 rows 183 cols
[2023-03-10 20:11:36] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 20:11:36] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-10 20:11:36] [INFO ] Flow matrix only has 685 transitions (discarded 162 similar events)
[2023-03-10 20:11:36] [INFO ] Invariant cache hit.
[2023-03-10 20:11:36] [INFO ] State equation strengthened by 216 read => feed constraints.
[2023-03-10 20:11:37] [INFO ] Implicit Places using invariants and state equation in 656 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
[2023-03-10 20:11:37] [INFO ] Flow matrix only has 685 transitions (discarded 162 similar events)
[2023-03-10 20:11:37] [INFO ] Invariant cache hit.
[2023-03-10 20:11:37] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1299 ms. Remains : 183/183 places, 847/847 transitions.
Computed a total of 50 stabilizing places and 509 stable transitions
Computed a total of 50 stabilizing places and 509 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 162 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 292 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 424244 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{}
Probabilistic random walk after 424244 steps, saw 61627 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-10 20:11:41] [INFO ] Flow matrix only has 685 transitions (discarded 162 similar events)
[2023-03-10 20:11:41] [INFO ] Invariant cache hit.
[2023-03-10 20:11:41] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-10 20:11:41] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 20:11:41] [INFO ] After 431ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-10 20:11:41] [INFO ] State equation strengthened by 216 read => feed constraints.
[2023-03-10 20:11:42] [INFO ] After 290ms SMT Verify possible using 216 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-10 20:11:42] [INFO ] After 628ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 249 ms.
[2023-03-10 20:11:42] [INFO ] After 1398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 1 ms.
Support contains 9 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 847/847 transitions.
Drop transitions removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 183 transition count 782
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -132
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 28 rules applied. Total rules applied 93 place count 169 transition count 914
Drop transitions removed 11 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 120 place count 169 transition count 887
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 168 transition count 904
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 125 place count 168 transition count 901
Drop transitions removed 133 transitions
Redundant transition composition rules discarded 133 transitions
Iterating global reduction 3 with 133 rules applied. Total rules applied 258 place count 168 transition count 768
Free-agglomeration rule applied 43 times with reduction of 12 identical transitions.
Iterating global reduction 3 with 43 rules applied. Total rules applied 301 place count 168 transition count 713
Reduce places removed 43 places and 0 transitions.
Drop transitions removed 60 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 3 with 161 rules applied. Total rules applied 462 place count 125 transition count 595
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 469 place count 118 transition count 548
Iterating global reduction 4 with 7 rules applied. Total rules applied 476 place count 118 transition count 548
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 478 place count 118 transition count 546
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 5 with 61 rules applied. Total rules applied 539 place count 118 transition count 485
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 543 place count 118 transition count 485
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 546 place count 118 transition count 482
Applied a total of 546 rules in 84 ms. Remains 118 /183 variables (removed 65) and now considering 482/847 (removed 365) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 118/183 places, 482/847 transitions.
Incomplete random walk after 10000 steps, including 199 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 502932 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :{}
Probabilistic random walk after 502932 steps, saw 67639 distinct states, run finished after 3002 ms. (steps per millisecond=167 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-10 20:11:46] [INFO ] Flow matrix only has 282 transitions (discarded 200 similar events)
// Phase 1: matrix 282 rows 118 cols
[2023-03-10 20:11:46] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 20:11:46] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-10 20:11:46] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-10 20:11:46] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-10 20:11:46] [INFO ] State equation strengthened by 146 read => feed constraints.
[2023-03-10 20:11:46] [INFO ] After 206ms SMT Verify possible using 146 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-10 20:11:47] [INFO ] After 404ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 181 ms.
[2023-03-10 20:11:47] [INFO ] After 888ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 12 ms.
Support contains 9 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 482/482 transitions.
Applied a total of 0 rules in 8 ms. Remains 118 /118 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 118/118 places, 482/482 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 482/482 transitions.
Applied a total of 0 rules in 7 ms. Remains 118 /118 variables (removed 0) and now considering 482/482 (removed 0) transitions.
[2023-03-10 20:11:47] [INFO ] Flow matrix only has 282 transitions (discarded 200 similar events)
[2023-03-10 20:11:47] [INFO ] Invariant cache hit.
[2023-03-10 20:11:47] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-10 20:11:47] [INFO ] Flow matrix only has 282 transitions (discarded 200 similar events)
[2023-03-10 20:11:47] [INFO ] Invariant cache hit.
[2023-03-10 20:11:47] [INFO ] State equation strengthened by 146 read => feed constraints.
[2023-03-10 20:11:47] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2023-03-10 20:11:48] [INFO ] Redundant transitions in 302 ms returned []
[2023-03-10 20:11:48] [INFO ] Flow matrix only has 282 transitions (discarded 200 similar events)
[2023-03-10 20:11:48] [INFO ] Invariant cache hit.
[2023-03-10 20:11:48] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1100 ms. Remains : 118/118 places, 482/482 transitions.
Graph (trivial) has 95 edges and 118 vertex of which 32 / 118 are part of one of the 4 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions removed 49 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 249 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 85 transition count 228
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 17 place count 80 transition count 227
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 79 transition count 226
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 19 place count 79 transition count 217
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 37 place count 70 transition count 217
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 40 place count 67 transition count 214
Iterating global reduction 3 with 3 rules applied. Total rules applied 43 place count 67 transition count 214
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 45 place count 65 transition count 212
Iterating global reduction 3 with 2 rules applied. Total rules applied 47 place count 65 transition count 212
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 64 transition count 206
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 64 transition count 206
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 66 place count 64 transition count 189
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 80 place count 57 transition count 182
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 87 place count 57 transition count 175
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 88 place count 56 transition count 174
Iterating global reduction 5 with 1 rules applied. Total rules applied 89 place count 56 transition count 174
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 90 place count 55 transition count 168
Iterating global reduction 5 with 1 rules applied. Total rules applied 91 place count 55 transition count 168
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 108 place count 55 transition count 151
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 114 place count 52 transition count 169
Drop transitions removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 6 with 46 rules applied. Total rules applied 160 place count 52 transition count 123
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 162 place count 50 transition count 118
Iterating global reduction 6 with 2 rules applied. Total rules applied 164 place count 50 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 165 place count 50 transition count 117
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 173 place count 46 transition count 113
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 175 place count 44 transition count 97
Iterating global reduction 7 with 2 rules applied. Total rules applied 177 place count 44 transition count 97
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 178 place count 44 transition count 97
Applied a total of 178 rules in 26 ms. Remains 44 /118 variables (removed 74) and now considering 97/482 (removed 385) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 97 rows 44 cols
[2023-03-10 20:11:48] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 20:11:48] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-10 20:11:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 20:11:48] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-10 20:11:48] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-10 20:11:48] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 20:11:48] [INFO ] After 55ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-10 20:11:48] [INFO ] After 117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-10 20:11:48] [INFO ] After 307ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p2 p1 p0), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 165 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 201 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2859 reset in 530 ms.
Product exploration explored 100000 steps with 2856 reset in 545 ms.
Support contains 9 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 847/847 transitions.
Applied a total of 0 rules in 2 ms. Remains 183 /183 variables (removed 0) and now considering 847/847 (removed 0) transitions.
[2023-03-10 20:11:50] [INFO ] Flow matrix only has 685 transitions (discarded 162 similar events)
// Phase 1: matrix 685 rows 183 cols
[2023-03-10 20:11:50] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 20:11:50] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-10 20:11:50] [INFO ] Flow matrix only has 685 transitions (discarded 162 similar events)
[2023-03-10 20:11:50] [INFO ] Invariant cache hit.
[2023-03-10 20:11:51] [INFO ] State equation strengthened by 216 read => feed constraints.
[2023-03-10 20:11:51] [INFO ] Implicit Places using invariants and state equation in 654 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
[2023-03-10 20:11:51] [INFO ] Flow matrix only has 685 transitions (discarded 162 similar events)
[2023-03-10 20:11:51] [INFO ] Invariant cache hit.
[2023-03-10 20:11:52] [INFO ] Dead Transitions using invariants and state equation in 427 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1240 ms. Remains : 183/183 places, 847/847 transitions.
Treatment of property CloudDeployment-PT-5b-LTLFireability-05 finished in 30587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X((p0 U (X(p1)||G(p0))))))))'
[2023-03-10 20:11:52] [INFO ] Flatten gal took : 265 ms
[2023-03-10 20:11:52] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-10 20:11:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 956 places, 2549 transitions and 23543 arcs took 36 ms.
Total runtime 257042 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2883/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2883/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2883/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2883/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CloudDeployment-PT-5b-LTLFireability-04
Could not compute solution for formula : CloudDeployment-PT-5b-LTLFireability-05
Could not compute solution for formula : CloudDeployment-PT-5b-LTLFireability-09
Could not compute solution for formula : CloudDeployment-PT-5b-LTLFireability-14

BK_STOP 1678479120471

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name CloudDeployment-PT-5b-LTLFireability-04
ltl formula formula --ltl=/tmp/2883/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 956 places, 2549 transitions and 23543 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.350 real 0.100 user 0.110 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2883/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2883/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2883/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2883/ltl_0_
terminate called after throwing an instance of 'std::runtime_error'
what(): too many children for formula
ltl formula name CloudDeployment-PT-5b-LTLFireability-05
ltl formula formula --ltl=/tmp/2883/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 956 places, 2549 transitions and 23543 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.340 real 0.120 user 0.090 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2883/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2883/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2883/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2883/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name CloudDeployment-PT-5b-LTLFireability-09
ltl formula formula --ltl=/tmp/2883/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 956 places, 2549 transitions and 23543 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.320 real 0.130 user 0.080 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2883/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2883/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2883/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2883/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x557b6110f3f4]
1: pnml2lts-mc(+0xa2496) [0x557b6110f496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fbd26613140]
3: pnml2lts-mc(+0x405be5) [0x557b61472be5]
4: pnml2lts-mc(+0x16b3f9) [0x557b611d83f9]
5: pnml2lts-mc(+0x164ac4) [0x557b611d1ac4]
6: pnml2lts-mc(+0x272e0a) [0x557b612dfe0a]
7: pnml2lts-mc(+0xb61f0) [0x557b611231f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fbd264664d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fbd2646667a]
10: pnml2lts-mc(+0xa1581) [0x557b6110e581]
11: pnml2lts-mc(+0xa1910) [0x557b6110e910]
12: pnml2lts-mc(+0xa32a2) [0x557b611102a2]
13: pnml2lts-mc(+0xa50f4) [0x557b611120f4]
14: pnml2lts-mc(+0xa516b) [0x557b6111216b]
15: pnml2lts-mc(+0x3f34b3) [0x557b614604b3]
16: pnml2lts-mc(+0x7c63d) [0x557b610e963d]
17: pnml2lts-mc(+0x67d86) [0x557b610d4d86]
18: pnml2lts-mc(+0x60a8a) [0x557b610cda8a]
19: pnml2lts-mc(+0x5eb15) [0x557b610cbb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fbd2644ed0a]
21: pnml2lts-mc(+0x6075e) [0x557b610cd75e]
ltl formula name CloudDeployment-PT-5b-LTLFireability-14
ltl formula formula --ltl=/tmp/2883/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 956 places, 2549 transitions and 23543 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.320 real 0.130 user 0.100 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2883/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2883/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2883/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2883/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-5b"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is CloudDeployment-PT-5b, 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 r073-smll-167814399500420"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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