Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r087-tall-171620522100383.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is CloudDeployment-PT-6b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620522100383
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.2M
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 15:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 11 15:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 11 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.8M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716263189925

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-6b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 03:46:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 03:46:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 03:46:31] [INFO ] Load time of PNML (sax parser for PT used): 385 ms
[2024-05-21 03:46:31] [INFO ] Transformed 1888 places.
[2024-05-21 03:46:31] [INFO ] Transformed 6804 transitions.
[2024-05-21 03:46:31] [INFO ] Found NUPN structural information;
[2024-05-21 03:46:31] [INFO ] Parsed PT model containing 1888 places and 6804 transitions and 91831 arcs in 607 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CloudDeployment-PT-6b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 1888 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1888/1888 places, 6804/6804 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1882 transition count 6804
Discarding 519 places :
Symmetric choice reduction at 1 with 519 rule applications. Total rules 525 place count 1363 transition count 6285
Iterating global reduction 1 with 519 rules applied. Total rules applied 1044 place count 1363 transition count 6285
Discarding 201 places :
Symmetric choice reduction at 1 with 201 rule applications. Total rules 1245 place count 1162 transition count 6084
Iterating global reduction 1 with 201 rules applied. Total rules applied 1446 place count 1162 transition count 6084
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 1474 place count 1162 transition count 6056
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 1493 place count 1143 transition count 6037
Iterating global reduction 2 with 19 rules applied. Total rules applied 1512 place count 1143 transition count 6037
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1513 place count 1142 transition count 6036
Iterating global reduction 2 with 1 rules applied. Total rules applied 1514 place count 1142 transition count 6036
Applied a total of 1514 rules in 785 ms. Remains 1142 /1888 variables (removed 746) and now considering 6036/6804 (removed 768) transitions.
// Phase 1: matrix 6036 rows 1142 cols
[2024-05-21 03:46:33] [INFO ] Computed 19 invariants in 101 ms
[2024-05-21 03:46:33] [INFO ] Implicit Places using invariants in 624 ms returned []
[2024-05-21 03:46:33] [INFO ] Invariant cache hit.
[2024-05-21 03:46:34] [INFO ] Implicit Places using invariants and state equation in 800 ms returned []
Implicit Place search using SMT with State Equation took 1446 ms to find 0 implicit places.
[2024-05-21 03:46:34] [INFO ] Invariant cache hit.
[2024-05-21 03:46:36] [INFO ] Dead Transitions using invariants and state equation in 2397 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1142/1888 places, 6036/6804 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4635 ms. Remains : 1142/1888 places, 6036/6804 transitions.
Support contains 57 out of 1142 places after structural reductions.
[2024-05-21 03:46:38] [INFO ] Flatten gal took : 1158 ms
[2024-05-21 03:46:39] [INFO ] Flatten gal took : 946 ms
[2024-05-21 03:46:40] [INFO ] Input system was already deterministic with 6036 transitions.
Support contains 55 out of 1142 places (down from 57) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 521 ms. (steps per millisecond=19 ) properties (out of 33) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) 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 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 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 6 ms. (steps per millisecond=166 ) 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 6 ms. (steps per millisecond=166 ) 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 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) 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 6 ms. (steps per millisecond=166 ) 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 6 ms. (steps per millisecond=166 ) 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 6 ms. (steps per millisecond=166 ) 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 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) 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 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Running SMT prover for 28 properties.
[2024-05-21 03:46:41] [INFO ] Invariant cache hit.
[2024-05-21 03:46:42] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 10 ms returned sat
[2024-05-21 03:46:43] [INFO ] After 908ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2024-05-21 03:46:43] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 9 ms returned sat
[2024-05-21 03:46:49] [INFO ] After 5293ms SMT Verify possible using state equation in natural domain returned unsat :16 sat :12
[2024-05-21 03:46:53] [INFO ] After 8768ms SMT Verify possible using trap constraints in natural domain returned unsat :16 sat :12
Attempting to minimize the solution found.
Minimization took 1983 ms.
[2024-05-21 03:46:55] [INFO ] After 11790ms SMT Verify possible using all constraints in natural domain returned unsat :16 sat :12
Fused 28 Parikh solutions to 11 different solutions.
Parikh walk visited 2 properties in 139 ms.
Support contains 15 out of 1142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1142/1142 places, 6036/6036 transitions.
Graph (trivial) has 1147 edges and 1142 vertex of which 405 / 1142 are part of one of the 45 SCC in 6 ms
Free SCC test removed 360 places
Drop transitions removed 4554 transitions
Reduce isomorphic transitions removed 4554 transitions.
Graph (complete) has 3164 edges and 782 vertex of which 749 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.8 ms
Discarding 33 places :
Also discarding 0 output transitions
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 304 transitions
Trivial Post-agglo rules discarded 304 transitions
Performed 304 trivial Post agglomeration. Transition count delta: 304
Iterating post reduction 0 with 324 rules applied. Total rules applied 326 place count 749 transition count 1158
Reduce places removed 304 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 310 rules applied. Total rules applied 636 place count 445 transition count 1152
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 641 place count 440 transition count 1152
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 641 place count 440 transition count 1085
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 775 place count 373 transition count 1085
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 784 place count 364 transition count 1076
Iterating global reduction 3 with 9 rules applied. Total rules applied 793 place count 364 transition count 1076
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 794 place count 364 transition count 1075
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 794 place count 364 transition count 1068
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 808 place count 357 transition count 1068
Performed 99 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 4 with 198 rules applied. Total rules applied 1006 place count 258 transition count 968
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -238
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 1080 place count 221 transition count 1206
Drop transitions removed 15 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 4 with 45 rules applied. Total rules applied 1125 place count 221 transition count 1161
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 1137 place count 215 transition count 1221
Drop transitions removed 181 transitions
Redundant transition composition rules discarded 181 transitions
Iterating global reduction 5 with 181 rules applied. Total rules applied 1318 place count 215 transition count 1040
Free-agglomeration rule applied 52 times with reduction of 8 identical transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 1370 place count 215 transition count 980
Reduce places removed 52 places and 0 transitions.
Drop transitions removed 62 transitions
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 154 transitions.
Iterating post reduction 5 with 206 rules applied. Total rules applied 1576 place count 163 transition count 826
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1581 place count 158 transition count 790
Iterating global reduction 6 with 5 rules applied. Total rules applied 1586 place count 158 transition count 790
Drop transitions removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 6 with 55 rules applied. Total rules applied 1641 place count 158 transition count 735
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1643 place count 158 transition count 735
Applied a total of 1643 rules in 293 ms. Remains 158 /1142 variables (removed 984) and now considering 735/6036 (removed 5301) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 293 ms. Remains : 158/1142 places, 735/6036 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-21 03:46:56] [INFO ] Flow matrix only has 432 transitions (discarded 303 similar events)
// Phase 1: matrix 432 rows 158 cols
[2024-05-21 03:46:56] [INFO ] Computed 20 invariants in 5 ms
[2024-05-21 03:46:56] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-21 03:46:56] [INFO ] [Real]Absence check using 6 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-21 03:46:56] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-21 03:46:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-21 03:46:56] [INFO ] [Nat]Absence check using 6 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-21 03:46:56] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-21 03:46:56] [INFO ] State equation strengthened by 254 read => feed constraints.
[2024-05-21 03:46:56] [INFO ] After 226ms SMT Verify possible using 254 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-21 03:46:56] [INFO ] After 455ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 185 ms.
[2024-05-21 03:46:56] [INFO ] After 907ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 24 ms.
Support contains 10 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 735/735 transitions.
Graph (trivial) has 52 edges and 158 vertex of which 2 / 158 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 156 transition count 724
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 156 transition count 724
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 155 transition count 723
Free-agglomeration rule applied 6 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 11 place count 155 transition count 715
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 31 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 50 place count 149 transition count 682
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 147 transition count 662
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 147 transition count 662
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 56 place count 147 transition count 660
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 2 with 30 rules applied. Total rules applied 86 place count 147 transition count 630
Applied a total of 86 rules in 66 ms. Remains 147 /158 variables (removed 11) and now considering 630/735 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 147/158 places, 630/735 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-21 03:46:57] [INFO ] Flow matrix only has 353 transitions (discarded 277 similar events)
// Phase 1: matrix 353 rows 147 cols
[2024-05-21 03:46:57] [INFO ] Computed 22 invariants in 2 ms
[2024-05-21 03:46:57] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 03:46:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-21 03:46:57] [INFO ] [Nat]Absence check using 6 positive and 16 generalized place invariants in 2 ms returned sat
[2024-05-21 03:46:57] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 03:46:57] [INFO ] State equation strengthened by 222 read => feed constraints.
[2024-05-21 03:46:57] [INFO ] After 118ms SMT Verify possible using 222 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-21 03:46:57] [INFO ] After 233ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 102 ms.
[2024-05-21 03:46:57] [INFO ] After 532ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 7 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 630/630 transitions.
Graph (trivial) has 50 edges and 147 vertex of which 2 / 147 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.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 146 transition count 627
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 145 transition count 627
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 145 transition count 626
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 5 place count 144 transition count 626
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 142 transition count 631
Drop transitions removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 13 place count 142 transition count 627
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 20 place count 142 transition count 620
Applied a total of 20 rules in 37 ms. Remains 142 /147 variables (removed 5) and now considering 620/630 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 142/147 places, 620/630 transitions.
Incomplete random walk after 10000 steps, including 149 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
[2024-05-21 03:46:58] [INFO ] Flow matrix only has 337 transitions (discarded 283 similar events)
// Phase 1: matrix 337 rows 142 cols
[2024-05-21 03:46:58] [INFO ] Computed 22 invariants in 2 ms
[2024-05-21 03:46:58] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 03:46:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-21 03:46:58] [INFO ] [Nat]Absence check using 6 positive and 16 generalized place invariants in 5 ms returned sat
[2024-05-21 03:46:58] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 03:46:58] [INFO ] State equation strengthened by 214 read => feed constraints.
[2024-05-21 03:46:58] [INFO ] After 102ms SMT Verify possible using 214 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-21 03:46:58] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 75 ms.
[2024-05-21 03:46:58] [INFO ] After 420ms 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 10 ms.
Support contains 6 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 620/620 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 141 transition count 619
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 141 transition count 619
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 140 transition count 618
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 140 transition count 618
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 139 transition count 617
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 139 transition count 617
Applied a total of 6 rules in 19 ms. Remains 139 /142 variables (removed 3) and now considering 617/620 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 139/142 places, 617/620 transitions.
Incomplete random walk after 10000 steps, including 148 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 725053 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :{}
Probabilistic random walk after 725053 steps, saw 102114 distinct states, run finished after 3002 ms. (steps per millisecond=241 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-21 03:47:01] [INFO ] Flow matrix only has 334 transitions (discarded 283 similar events)
// Phase 1: matrix 334 rows 139 cols
[2024-05-21 03:47:01] [INFO ] Computed 22 invariants in 2 ms
[2024-05-21 03:47:02] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 03:47:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-21 03:47:02] [INFO ] [Nat]Absence check using 6 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-21 03:47:02] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 03:47:02] [INFO ] State equation strengthened by 212 read => feed constraints.
[2024-05-21 03:47:02] [INFO ] After 102ms SMT Verify possible using 212 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-21 03:47:02] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 74 ms.
[2024-05-21 03:47:02] [INFO ] After 426ms 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 6 ms.
Support contains 6 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 617/617 transitions.
Applied a total of 0 rules in 11 ms. Remains 139 /139 variables (removed 0) and now considering 617/617 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 139/139 places, 617/617 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 617/617 transitions.
Applied a total of 0 rules in 10 ms. Remains 139 /139 variables (removed 0) and now considering 617/617 (removed 0) transitions.
[2024-05-21 03:47:02] [INFO ] Flow matrix only has 334 transitions (discarded 283 similar events)
[2024-05-21 03:47:02] [INFO ] Invariant cache hit.
[2024-05-21 03:47:02] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-21 03:47:02] [INFO ] Flow matrix only has 334 transitions (discarded 283 similar events)
[2024-05-21 03:47:02] [INFO ] Invariant cache hit.
[2024-05-21 03:47:02] [INFO ] State equation strengthened by 212 read => feed constraints.
[2024-05-21 03:47:02] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2024-05-21 03:47:03] [INFO ] Redundant transitions in 185 ms returned []
[2024-05-21 03:47:03] [INFO ] Flow matrix only has 334 transitions (discarded 283 similar events)
[2024-05-21 03:47:03] [INFO ] Invariant cache hit.
[2024-05-21 03:47:03] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 781 ms. Remains : 139/139 places, 617/617 transitions.
Graph (trivial) has 129 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 54 transitions
Ensure Unique test removed 285 transitions
Reduce isomorphic transitions removed 339 transitions.
Ensure Unique test removed 9 places
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 95 transition count 264
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 39 place count 81 transition count 263
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 41 place count 80 transition count 262
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 41 place count 80 transition count 253
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 59 place count 71 transition count 253
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 62 place count 68 transition count 250
Iterating global reduction 3 with 3 rules applied. Total rules applied 65 place count 68 transition count 250
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 68 place count 65 transition count 229
Iterating global reduction 3 with 3 rules applied. Total rules applied 71 place count 65 transition count 229
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 119 place count 65 transition count 181
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 137 place count 56 transition count 172
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 147 place count 56 transition count 162
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 148 place count 55 transition count 161
Iterating global reduction 5 with 1 rules applied. Total rules applied 149 place count 55 transition count 161
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 150 place count 54 transition count 154
Iterating global reduction 5 with 1 rules applied. Total rules applied 151 place count 54 transition count 154
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 167 place count 54 transition count 138
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 177 place count 49 transition count 168
Drop transitions removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 6 with 55 rules applied. Total rules applied 232 place count 49 transition count 113
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 233 place count 48 transition count 110
Iterating global reduction 6 with 1 rules applied. Total rules applied 234 place count 48 transition count 110
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 6 with 8 rules applied. Total rules applied 242 place count 44 transition count 106
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 245 place count 41 transition count 82
Iterating global reduction 6 with 3 rules applied. Total rules applied 248 place count 41 transition count 82
Applied a total of 248 rules in 16 ms. Remains 41 /139 variables (removed 98) and now considering 82/617 (removed 535) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 82 rows 41 cols
[2024-05-21 03:47:03] [INFO ] Computed 10 invariants in 1 ms
[2024-05-21 03:47:03] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 03:47:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 03:47:03] [INFO ] [Nat]Absence check using 3 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-21 03:47:03] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 03:47:03] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 03:47:03] [INFO ] After 14ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-21 03:47:03] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-21 03:47:03] [INFO ] After 97ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Successfully simplified 8 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CloudDeployment-PT-6b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 180 stabilizing places and 4754 stable transitions
Graph (complete) has 3775 edges and 1142 vertex of which 1109 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.42 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&F(p1)))||G(p2)))'
Support contains 27 out of 1142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1142/1142 places, 6036/6036 transitions.
Graph (trivial) has 1158 edges and 1142 vertex of which 428 / 1142 are part of one of the 48 SCC in 3 ms
Free SCC test removed 380 places
Ensure Unique test removed 434 transitions
Reduce isomorphic transitions removed 434 transitions.
Graph (complete) has 3265 edges and 762 vertex of which 761 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 300 transitions
Trivial Post-agglo rules discarded 300 transitions
Performed 300 trivial Post agglomeration. Transition count delta: 300
Iterating post reduction 0 with 300 rules applied. Total rules applied 302 place count 760 transition count 5300
Reduce places removed 300 places and 0 transitions.
Iterating post reduction 1 with 300 rules applied. Total rules applied 602 place count 460 transition count 5300
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 602 place count 460 transition count 5240
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 722 place count 400 transition count 5240
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 727 place count 395 transition count 5235
Iterating global reduction 2 with 5 rules applied. Total rules applied 732 place count 395 transition count 5235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 733 place count 395 transition count 5234
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 733 place count 395 transition count 5233
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 735 place count 394 transition count 5233
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 736 place count 393 transition count 5232
Iterating global reduction 3 with 1 rules applied. Total rules applied 737 place count 393 transition count 5232
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 738 place count 392 transition count 5231
Iterating global reduction 3 with 1 rules applied. Total rules applied 739 place count 392 transition count 5231
Performed 114 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 114 places in 0 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 228 rules applied. Total rules applied 967 place count 278 transition count 5116
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -132
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 1015 place count 254 transition count 5248
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 1045 place count 254 transition count 5218
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 1057 place count 248 transition count 5278
Drop transitions removed 102 transitions
Redundant transition composition rules discarded 102 transitions
Iterating global reduction 4 with 102 rules applied. Total rules applied 1159 place count 248 transition count 5176
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1160 place count 247 transition count 5175
Applied a total of 1160 rules in 545 ms. Remains 247 /1142 variables (removed 895) and now considering 5175/6036 (removed 861) transitions.
[2024-05-21 03:47:04] [INFO ] Flow matrix only has 4912 transitions (discarded 263 similar events)
// Phase 1: matrix 4912 rows 247 cols
[2024-05-21 03:47:04] [INFO ] Computed 19 invariants in 56 ms
[2024-05-21 03:47:05] [INFO ] Implicit Places using invariants in 836 ms returned []
[2024-05-21 03:47:05] [INFO ] Flow matrix only has 4912 transitions (discarded 263 similar events)
[2024-05-21 03:47:05] [INFO ] Invariant cache hit.
[2024-05-21 03:47:05] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 03:47:06] [INFO ] Implicit Places using invariants and state equation in 1249 ms returned []
Implicit Place search using SMT with State Equation took 2088 ms to find 0 implicit places.
[2024-05-21 03:47:07] [INFO ] Redundant transitions in 984 ms returned []
[2024-05-21 03:47:07] [INFO ] Flow matrix only has 4912 transitions (discarded 263 similar events)
[2024-05-21 03:47:07] [INFO ] Invariant cache hit.
[2024-05-21 03:47:09] [INFO ] Dead Transitions using invariants and state equation in 1780 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 247/1142 places, 5175/6036 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5412 ms. Remains : 247/1142 places, 5175/6036 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 275 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-6b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s2 1) (EQ s7 1) (EQ s15 1) (EQ s37 1) (EQ s42 1) (EQ s49 1) (EQ s70 1) (EQ s75 1) (EQ s83 1) (EQ s104 1) (EQ s110 1) (EQ s117 1) (EQ s139 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA CloudDeployment-PT-6b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6b-LTLFireability-00 finished in 5744 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)||G(!p1))) U (p2||X(p1))))'
Support contains 26 out of 1142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1142/1142 places, 6036/6036 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1133 transition count 6027
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1133 transition count 6027
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 1133 transition count 6026
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 1130 transition count 6023
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 1130 transition count 6023
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 1130 transition count 6022
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 1129 transition count 6021
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 1129 transition count 6021
Applied a total of 28 rules in 173 ms. Remains 1129 /1142 variables (removed 13) and now considering 6021/6036 (removed 15) transitions.
// Phase 1: matrix 6021 rows 1129 cols
[2024-05-21 03:47:09] [INFO ] Computed 19 invariants in 63 ms
[2024-05-21 03:47:11] [INFO ] Implicit Places using invariants in 1886 ms returned []
[2024-05-21 03:47:11] [INFO ] Invariant cache hit.
[2024-05-21 03:47:13] [INFO ] Implicit Places using invariants and state equation in 2308 ms returned []
Implicit Place search using SMT with State Equation took 4196 ms to find 0 implicit places.
[2024-05-21 03:47:13] [INFO ] Invariant cache hit.
[2024-05-21 03:47:15] [INFO ] Dead Transitions using invariants and state equation in 2213 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1129/1142 places, 6021/6036 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6584 ms. Remains : 1129/1142 places, 6021/6036 transitions.
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), p1, (AND p1 (NOT p0)), true, (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-6b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s543 1) (EQ s718 1)), p1:(AND (EQ s543 1) (EQ s561 1) (EQ s632 1) (EQ s1105 1) (EQ s1125 1)), p0:(AND (EQ s12 1) (EQ s23 1) (EQ s43 1) (EQ s19...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 509 reset in 592 ms.
Product exploration explored 100000 steps with 522 reset in 513 ms.
Computed a total of 174 stabilizing places and 4748 stable transitions
Graph (complete) has 3750 edges and 1129 vertex of which 1096 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.14 ms
Computed a total of 174 stabilizing places and 4748 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 131 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[true, p1, (OR (NOT p2) p1), (OR (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 48 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 03:47:17] [INFO ] Invariant cache hit.
[2024-05-21 03:47:17] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 7 ms returned sat
[2024-05-21 03:47:19] [INFO ] After 1836ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 03:47:19] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 6 ms returned sat
[2024-05-21 03:47:21] [INFO ] After 1611ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 03:47:22] [INFO ] After 2491ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 440 ms.
[2024-05-21 03:47:22] [INFO ] After 3071ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 5 out of 1129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1129/1129 places, 6021/6021 transitions.
Graph (trivial) has 1154 edges and 1129 vertex of which 417 / 1129 are part of one of the 47 SCC in 2 ms
Free SCC test removed 370 places
Drop transitions removed 4567 transitions
Reduce isomorphic transitions removed 4567 transitions.
Graph (complete) has 3124 edges and 759 vertex of which 726 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.1 ms
Discarding 33 places :
Also discarding 0 output transitions
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 304 transitions
Trivial Post-agglo rules discarded 304 transitions
Performed 304 trivial Post agglomeration. Transition count delta: 304
Iterating post reduction 0 with 326 rules applied. Total rules applied 328 place count 726 transition count 1128
Reduce places removed 304 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 307 rules applied. Total rules applied 635 place count 422 transition count 1125
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 637 place count 420 transition count 1125
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 637 place count 420 transition count 1058
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 771 place count 353 transition count 1058
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 777 place count 347 transition count 1052
Iterating global reduction 3 with 6 rules applied. Total rules applied 783 place count 347 transition count 1052
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 783 place count 347 transition count 1046
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 795 place count 341 transition count 1046
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 991 place count 243 transition count 948
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -246
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 1063 place count 207 transition count 1194
Drop transitions removed 15 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 3 with 45 rules applied. Total rules applied 1108 place count 207 transition count 1149
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 1120 place count 201 transition count 1209
Drop transitions removed 187 transitions
Redundant transition composition rules discarded 187 transitions
Iterating global reduction 4 with 187 rules applied. Total rules applied 1307 place count 201 transition count 1022
Free-agglomeration rule applied 55 times with reduction of 20 identical transitions.
Iterating global reduction 4 with 55 rules applied. Total rules applied 1362 place count 201 transition count 947
Reduce places removed 55 places and 0 transitions.
Drop transitions removed 95 transitions
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 177 transitions.
Iterating post reduction 4 with 232 rules applied. Total rules applied 1594 place count 146 transition count 770
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1602 place count 138 transition count 707
Iterating global reduction 5 with 8 rules applied. Total rules applied 1610 place count 138 transition count 707
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1612 place count 138 transition count 705
Drop transitions removed 91 transitions
Redundant transition composition rules discarded 91 transitions
Iterating global reduction 6 with 91 rules applied. Total rules applied 1703 place count 138 transition count 614
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1704 place count 138 transition count 614
Applied a total of 1704 rules in 150 ms. Remains 138 /1129 variables (removed 991) and now considering 614/6021 (removed 5407) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 138/1129 places, 614/6021 transitions.
Incomplete random walk after 10000 steps, including 149 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1078609 steps, run timeout after 3001 ms. (steps per millisecond=359 ) properties seen :{}
Probabilistic random walk after 1078609 steps, saw 130941 distinct states, run finished after 3001 ms. (steps per millisecond=359 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 03:47:25] [INFO ] Flow matrix only has 319 transitions (discarded 295 similar events)
// Phase 1: matrix 319 rows 138 cols
[2024-05-21 03:47:25] [INFO ] Computed 22 invariants in 9 ms
[2024-05-21 03:47:25] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-21 03:47:25] [INFO ] [Real]Absence check using 6 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-21 03:47:26] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 03:47:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-21 03:47:26] [INFO ] [Nat]Absence check using 6 positive and 16 generalized place invariants in 6 ms returned sat
[2024-05-21 03:47:26] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 03:47:26] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-21 03:47:26] [INFO ] After 43ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 03:47:26] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-21 03:47:26] [INFO ] After 239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 614/614 transitions.
Applied a total of 0 rules in 12 ms. Remains 138 /138 variables (removed 0) and now considering 614/614 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 138/138 places, 614/614 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 614/614 transitions.
Applied a total of 0 rules in 9 ms. Remains 138 /138 variables (removed 0) and now considering 614/614 (removed 0) transitions.
[2024-05-21 03:47:26] [INFO ] Flow matrix only has 319 transitions (discarded 295 similar events)
[2024-05-21 03:47:26] [INFO ] Invariant cache hit.
[2024-05-21 03:47:26] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-21 03:47:26] [INFO ] Flow matrix only has 319 transitions (discarded 295 similar events)
[2024-05-21 03:47:26] [INFO ] Invariant cache hit.
[2024-05-21 03:47:26] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-21 03:47:26] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2024-05-21 03:47:26] [INFO ] Redundant transitions in 157 ms returned []
[2024-05-21 03:47:26] [INFO ] Flow matrix only has 319 transitions (discarded 295 similar events)
[2024-05-21 03:47:26] [INFO ] Invariant cache hit.
[2024-05-21 03:47:27] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 733 ms. Remains : 138/138 places, 614/614 transitions.
Graph (trivial) has 127 edges and 138 vertex of which 40 / 138 are part of one of the 5 SCC in 0 ms
Free SCC test removed 35 places
Drop transitions removed 55 transitions
Ensure Unique test removed 295 transitions
Reduce isomorphic transitions removed 350 transitions.
Ensure Unique test removed 9 places
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 19 rules applied. Total rules applied 20 place count 94 transition count 254
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 31 place count 84 transition count 253
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 33 place count 83 transition count 252
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 33 place count 83 transition count 240
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 57 place count 71 transition count 240
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 60 place count 68 transition count 237
Iterating global reduction 3 with 3 rules applied. Total rules applied 63 place count 68 transition count 237
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 66 place count 65 transition count 228
Iterating global reduction 3 with 3 rules applied. Total rules applied 69 place count 65 transition count 228
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 83 place count 65 transition count 214
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 85 place count 63 transition count 200
Iterating global reduction 4 with 2 rules applied. Total rules applied 87 place count 63 transition count 200
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 115 place count 63 transition count 172
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 5 with 16 rules applied. Total rules applied 131 place count 55 transition count 164
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 141 place count 55 transition count 154
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 142 place count 54 transition count 153
Iterating global reduction 6 with 1 rules applied. Total rules applied 143 place count 54 transition count 153
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 144 place count 53 transition count 146
Iterating global reduction 6 with 1 rules applied. Total rules applied 145 place count 53 transition count 146
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 159 place count 53 transition count 132
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 169 place count 48 transition count 162
Drop transitions removed 54 transitions
Redundant transition composition rules discarded 54 transitions
Iterating global reduction 7 with 54 rules applied. Total rules applied 223 place count 48 transition count 108
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 224 place count 47 transition count 105
Iterating global reduction 7 with 1 rules applied. Total rules applied 225 place count 47 transition count 105
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 235 place count 42 transition count 100
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 239 place count 38 transition count 68
Iterating global reduction 7 with 4 rules applied. Total rules applied 243 place count 38 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 245 place count 37 transition count 77
Applied a total of 245 rules in 19 ms. Remains 37 /138 variables (removed 101) and now considering 77/614 (removed 537) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 77 rows 37 cols
[2024-05-21 03:47:27] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 03:47:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-21 03:47:27] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-21 03:47:27] [INFO ] After 20ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 03:47:27] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-21 03:47:27] [INFO ] After 5ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 03:47:27] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 03:47:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-21 03:47:27] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-21 03:47:27] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 03:47:27] [INFO ] After 5ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 03:47:27] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-21 03:47:27] [INFO ] After 60ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 10 factoid took 174 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[true, p1, (OR (NOT p2) p1), (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 116 ms :[true, p1, (OR (NOT p2) p1), (OR (NOT p2) p1)]
// Phase 1: matrix 6021 rows 1129 cols
[2024-05-21 03:47:27] [INFO ] Computed 19 invariants in 66 ms
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) p2)), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 10 factoid took 256 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-6b-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-6b-LTLFireability-01 finished in 20356 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(!p0)||(!p0&&G(!p1)))))'
Support contains 26 out of 1142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1142/1142 places, 6036/6036 transitions.
Graph (trivial) has 1156 edges and 1142 vertex of which 428 / 1142 are part of one of the 48 SCC in 1 ms
Free SCC test removed 380 places
Ensure Unique test removed 434 transitions
Reduce isomorphic transitions removed 434 transitions.
Graph (complete) has 3265 edges and 762 vertex of which 761 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 298 transitions
Trivial Post-agglo rules discarded 298 transitions
Performed 298 trivial Post agglomeration. Transition count delta: 298
Iterating post reduction 0 with 298 rules applied. Total rules applied 300 place count 760 transition count 5302
Reduce places removed 298 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 299 rules applied. Total rules applied 599 place count 462 transition count 5301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 600 place count 461 transition count 5301
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 600 place count 461 transition count 5241
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 720 place count 401 transition count 5241
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 725 place count 396 transition count 5236
Iterating global reduction 3 with 5 rules applied. Total rules applied 730 place count 396 transition count 5236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 731 place count 396 transition count 5235
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 731 place count 396 transition count 5234
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 733 place count 395 transition count 5234
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 734 place count 394 transition count 5233
Iterating global reduction 4 with 1 rules applied. Total rules applied 735 place count 394 transition count 5233
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 736 place count 393 transition count 5232
Iterating global reduction 4 with 1 rules applied. Total rules applied 737 place count 393 transition count 5232
Performed 114 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 4 with 228 rules applied. Total rules applied 965 place count 279 transition count 5117
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -132
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1013 place count 255 transition count 5249
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 1043 place count 255 transition count 5219
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 1055 place count 249 transition count 5279
Drop transitions removed 102 transitions
Redundant transition composition rules discarded 102 transitions
Iterating global reduction 5 with 102 rules applied. Total rules applied 1157 place count 249 transition count 5177
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1158 place count 248 transition count 5176
Applied a total of 1158 rules in 453 ms. Remains 248 /1142 variables (removed 894) and now considering 5176/6036 (removed 860) transitions.
[2024-05-21 03:47:30] [INFO ] Flow matrix only has 4913 transitions (discarded 263 similar events)
// Phase 1: matrix 4913 rows 248 cols
[2024-05-21 03:47:30] [INFO ] Computed 19 invariants in 42 ms
[2024-05-21 03:47:31] [INFO ] Implicit Places using invariants in 1223 ms returned []
[2024-05-21 03:47:31] [INFO ] Flow matrix only has 4913 transitions (discarded 263 similar events)
[2024-05-21 03:47:31] [INFO ] Invariant cache hit.
[2024-05-21 03:47:32] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 03:47:34] [INFO ] Implicit Places using invariants and state equation in 3026 ms returned []
Implicit Place search using SMT with State Equation took 4252 ms to find 0 implicit places.
[2024-05-21 03:47:35] [INFO ] Redundant transitions in 1028 ms returned []
[2024-05-21 03:47:35] [INFO ] Flow matrix only has 4913 transitions (discarded 263 similar events)
[2024-05-21 03:47:35] [INFO ] Invariant cache hit.
[2024-05-21 03:47:37] [INFO ] Dead Transitions using invariants and state equation in 1687 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 248/1142 places, 5176/6036 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7432 ms. Remains : 248/1142 places, 5176/6036 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, p0, (AND p0 p1), p1]
Running random walk in product with property : CloudDeployment-PT-6b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s79 1) (EQ s142 1)), p1:(AND (NOT (AND (NOT (OR (AND (EQ s3 1) (EQ s7 1) (EQ s15 1) (EQ s36 1) (EQ s42 1) (EQ s49 1) (EQ s70 1) (EQ s75 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 2390 reset in 1021 ms.
Product exploration explored 100000 steps with 2366 reset in 955 ms.
Computed a total of 79 stabilizing places and 4779 stable transitions
Graph (complete) has 2653 edges and 248 vertex of which 216 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.9 ms
Computed a total of 79 stabilizing places and 4779 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 120 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[true, p0, p1, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 250 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-21 03:47:40] [INFO ] Flow matrix only has 4913 transitions (discarded 263 similar events)
[2024-05-21 03:47:40] [INFO ] Invariant cache hit.
[2024-05-21 03:47:40] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-21 03:47:41] [INFO ] After 1018ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-21 03:47:41] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-21 03:47:42] [INFO ] After 1009ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (G (NOT (AND p0 p1))), (G (NOT p1)), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 148 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-6b-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-6b-LTLFireability-02 finished in 12528 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Support contains 26 out of 1142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1142/1142 places, 6036/6036 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1133 transition count 6027
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1133 transition count 6027
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 1133 transition count 6026
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 1130 transition count 6023
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 1130 transition count 6023
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 1130 transition count 6022
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 1129 transition count 6021
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 1129 transition count 6021
Applied a total of 28 rules in 152 ms. Remains 1129 /1142 variables (removed 13) and now considering 6021/6036 (removed 15) transitions.
// Phase 1: matrix 6021 rows 1129 cols
[2024-05-21 03:47:42] [INFO ] Computed 19 invariants in 52 ms
[2024-05-21 03:47:43] [INFO ] Implicit Places using invariants in 1062 ms returned []
[2024-05-21 03:47:43] [INFO ] Invariant cache hit.
[2024-05-21 03:47:45] [INFO ] Implicit Places using invariants and state equation in 1531 ms returned []
Implicit Place search using SMT with State Equation took 2595 ms to find 0 implicit places.
[2024-05-21 03:47:45] [INFO ] Invariant cache hit.
[2024-05-21 03:47:47] [INFO ] Dead Transitions using invariants and state equation in 2215 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1129/1142 places, 6021/6036 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4965 ms. Remains : 1129/1142 places, 6021/6036 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : CloudDeployment-PT-6b-LTLFireability-03 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=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(AND (EQ s12 1) (EQ s21 1) (EQ s43 1) (EQ s190 1) (EQ s199 1) (EQ s219 1) (EQ s363 1) (EQ s372 1) (EQ s394 1) (EQ s540 1) (EQ s549 1) (EQ s569 1) (EQ s...], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-6b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6b-LTLFireability-03 finished in 5145 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X((X((!p1&&F(!p2))) U ((!p2&&X((!p1&&F(!p2))))||X(G((!p1&&F(!p2)))))))) U G(p1)))'
Support contains 23 out of 1142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1142/1142 places, 6036/6036 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1134 transition count 6028
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1134 transition count 6028
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 1131 transition count 6025
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 1131 transition count 6025
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1131 transition count 6024
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 1130 transition count 6023
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 1130 transition count 6023
Applied a total of 25 rules in 156 ms. Remains 1130 /1142 variables (removed 12) and now considering 6023/6036 (removed 13) transitions.
// Phase 1: matrix 6023 rows 1130 cols
[2024-05-21 03:47:47] [INFO ] Computed 19 invariants in 63 ms
[2024-05-21 03:47:49] [INFO ] Implicit Places using invariants in 1874 ms returned []
[2024-05-21 03:47:49] [INFO ] Invariant cache hit.
[2024-05-21 03:47:51] [INFO ] Implicit Places using invariants and state equation in 2336 ms returned []
Implicit Place search using SMT with State Equation took 4212 ms to find 0 implicit places.
[2024-05-21 03:47:51] [INFO ] Invariant cache hit.
[2024-05-21 03:47:54] [INFO ] Dead Transitions using invariants and state equation in 2212 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1130/1142 places, 6023/6036 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6581 ms. Remains : 1130/1142 places, 6023/6036 transitions.
Stuttering acceptance computed with spot in 277 ms :[(NOT p1), (OR p1 p2), (OR p1 p2), (AND p2 (NOT p1)), (AND (NOT p1) p2), true, p2, (NOT p1)]
Running random walk in product with property : CloudDeployment-PT-6b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=p1, acceptance={} source=1 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 6}, { cond=p1, acceptance={} source=3 dest: 7}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 3}, { cond=(AND p1 p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p2, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 5}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(AND (EQ s14 1) (EQ s21 1) (EQ s43 1) (EQ s188 1) (EQ s199 1) (EQ s219 1) (EQ s365 1) (EQ s372 1) (EQ s394 1) (EQ s538 1) (EQ s550 1) (EQ s570 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 268 steps with 0 reset in 2 ms.
FORMULA CloudDeployment-PT-6b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6b-LTLFireability-05 finished in 6911 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1142/1142 places, 6036/6036 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1141 transition count 6036
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 1121 transition count 1933
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 1121 transition count 1933
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 1121 transition count 1932
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 1118 transition count 1929
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 1118 transition count 1929
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 1118 transition count 1928
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 1117 transition count 1927
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 1117 transition count 1927
Applied a total of 51 rules in 307 ms. Remains 1117 /1142 variables (removed 25) and now considering 1927/6036 (removed 4109) transitions.
// Phase 1: matrix 1927 rows 1117 cols
[2024-05-21 03:47:54] [INFO ] Computed 18 invariants in 13 ms
[2024-05-21 03:47:54] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-21 03:47:54] [INFO ] Invariant cache hit.
[2024-05-21 03:47:55] [INFO ] Implicit Places using invariants and state equation in 1005 ms returned [12, 20, 187, 195, 360, 368, 533, 541, 706, 714, 879, 887]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 1219 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1105/1142 places, 1927/6036 transitions.
Applied a total of 0 rules in 30 ms. Remains 1105 /1105 variables (removed 0) and now considering 1927/1927 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1556 ms. Remains : 1105/1142 places, 1927/6036 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-6b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s54 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]]
Product exploration explored 100000 steps with 50000 reset in 1099 ms.
Product exploration explored 100000 steps with 50000 reset in 981 ms.
Computed a total of 162 stabilizing places and 654 stable transitions
Graph (complete) has 3479 edges and 1105 vertex of which 1097 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Computed a total of 162 stabilizing places and 654 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-6b-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-6b-LTLFireability-06 finished in 3805 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 2 out of 1142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1142/1142 places, 6036/6036 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1141 transition count 6036
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 1121 transition count 1933
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 1121 transition count 1933
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 1121 transition count 1932
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 1118 transition count 1929
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 1118 transition count 1929
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 1118 transition count 1928
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 1117 transition count 1927
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 1117 transition count 1927
Applied a total of 51 rules in 277 ms. Remains 1117 /1142 variables (removed 25) and now considering 1927/6036 (removed 4109) transitions.
// Phase 1: matrix 1927 rows 1117 cols
[2024-05-21 03:47:58] [INFO ] Computed 18 invariants in 14 ms
[2024-05-21 03:47:58] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-21 03:47:58] [INFO ] Invariant cache hit.
[2024-05-21 03:47:59] [INFO ] Implicit Places using invariants and state equation in 992 ms returned [12, 20, 186, 194, 359, 367, 532, 540, 705, 713, 878, 887]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 1200 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1105/1142 places, 1927/6036 transitions.
Applied a total of 0 rules in 29 ms. Remains 1105 /1105 variables (removed 0) and now considering 1927/1927 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1506 ms. Remains : 1105/1142 places, 1927/6036 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-6b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s1053 0), p0:(EQ s868 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][false, false, false]]
Stuttering criterion allowed to conclude after 168 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-6b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6b-LTLFireability-07 finished in 1660 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(!p1))))'
Support contains 6 out of 1142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1142/1142 places, 6036/6036 transitions.
Graph (trivial) has 1162 edges and 1142 vertex of which 414 / 1142 are part of one of the 46 SCC in 1 ms
Free SCC test removed 368 places
Ensure Unique test removed 421 transitions
Reduce isomorphic transitions removed 421 transitions.
Graph (complete) has 3285 edges and 774 vertex of which 741 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.3 ms
Discarding 33 places :
Also discarding 4097 output transitions
Drop transitions removed 4097 transitions
Drop transitions removed 302 transitions
Trivial Post-agglo rules discarded 302 transitions
Performed 302 trivial Post agglomeration. Transition count delta: 302
Iterating post reduction 0 with 302 rules applied. Total rules applied 304 place count 741 transition count 1216
Reduce places removed 302 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 305 rules applied. Total rules applied 609 place count 439 transition count 1213
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 611 place count 437 transition count 1213
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 611 place count 437 transition count 1152
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 733 place count 376 transition count 1152
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 737 place count 372 transition count 1148
Iterating global reduction 3 with 4 rules applied. Total rules applied 741 place count 372 transition count 1148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 742 place count 372 transition count 1147
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 743 place count 371 transition count 1146
Iterating global reduction 4 with 1 rules applied. Total rules applied 744 place count 371 transition count 1146
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 745 place count 370 transition count 1145
Iterating global reduction 4 with 1 rules applied. Total rules applied 746 place count 370 transition count 1145
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 4 with 236 rules applied. Total rules applied 982 place count 252 transition count 1027
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1030 place count 228 transition count 1081
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1036 place count 228 transition count 1075
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 1048 place count 222 transition count 1135
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 5 with 48 rules applied. Total rules applied 1096 place count 222 transition count 1087
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1098 place count 221 transition count 1093
Applied a total of 1098 rules in 122 ms. Remains 221 /1142 variables (removed 921) and now considering 1093/6036 (removed 4943) transitions.
[2024-05-21 03:47:59] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
// Phase 1: matrix 874 rows 221 cols
[2024-05-21 03:47:59] [INFO ] Computed 6 invariants in 6 ms
[2024-05-21 03:48:00] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-21 03:48:00] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
[2024-05-21 03:48:00] [INFO ] Invariant cache hit.
[2024-05-21 03:48:00] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-21 03:48:00] [INFO ] Implicit Places using invariants and state equation in 772 ms returned []
Implicit Place search using SMT with State Equation took 876 ms to find 0 implicit places.
[2024-05-21 03:48:01] [INFO ] Redundant transitions in 642 ms returned []
[2024-05-21 03:48:01] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
[2024-05-21 03:48:01] [INFO ] Invariant cache hit.
[2024-05-21 03:48:01] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 221/1142 places, 1093/6036 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1933 ms. Remains : 221/1142 places, 1093/6036 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) p1), p1, p1]
Running random walk in product with property : CloudDeployment-PT-6b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s3 1), p1:(AND (EQ s35 1) (EQ s41 1) (EQ s59 1) (EQ s206 1) (EQ s219 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2220 reset in 409 ms.
Product exploration explored 100000 steps with 2210 reset in 420 ms.
Computed a total of 60 stabilizing places and 661 stable transitions
Computed a total of 60 stabilizing places and 661 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 97 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[p1, p1]
Incomplete random walk after 10000 steps, including 234 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 748622 steps, run timeout after 3001 ms. (steps per millisecond=249 ) properties seen :{}
Probabilistic random walk after 748622 steps, saw 123380 distinct states, run finished after 3001 ms. (steps per millisecond=249 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 03:48:05] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
[2024-05-21 03:48:05] [INFO ] Invariant cache hit.
[2024-05-21 03:48:05] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-21 03:48:06] [INFO ] After 254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 03:48:06] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-21 03:48:06] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 03:48:06] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-21 03:48:06] [INFO ] After 84ms SMT Verify possible using 288 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 03:48:06] [INFO ] After 143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2024-05-21 03:48:06] [INFO ] After 441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 1093/1093 transitions.
Drop transitions removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 221 transition count 1024
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 220 transition count 1024
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 219 transition count 1023
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 219 transition count 1022
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -179
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 107 place count 202 transition count 1201
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 122 place count 202 transition count 1186
Drop transitions removed 162 transitions
Redundant transition composition rules discarded 162 transitions
Iterating global reduction 4 with 162 rules applied. Total rules applied 284 place count 202 transition count 1024
Free-agglomeration rule applied 56 times with reduction of 20 identical transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 340 place count 202 transition count 948
Reduce places removed 56 places and 0 transitions.
Drop transitions removed 95 transitions
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 177 transitions.
Iterating post reduction 4 with 233 rules applied. Total rules applied 573 place count 146 transition count 771
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 581 place count 138 transition count 708
Iterating global reduction 5 with 8 rules applied. Total rules applied 589 place count 138 transition count 708
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 591 place count 138 transition count 706
Drop transitions removed 92 transitions
Redundant transition composition rules discarded 92 transitions
Iterating global reduction 6 with 92 rules applied. Total rules applied 683 place count 138 transition count 614
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 685 place count 138 transition count 614
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 686 place count 138 transition count 613
Applied a total of 686 rules in 90 ms. Remains 138 /221 variables (removed 83) and now considering 613/1093 (removed 480) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 138/221 places, 613/1093 transitions.
Finished random walk after 2298 steps, including 38 resets, run visited all 1 properties in 9 ms. (steps per millisecond=255 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 8 factoid took 212 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 61 ms :[p1, p1]
Stuttering acceptance computed with spot in 75 ms :[p1, p1]
Support contains 5 out of 221 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 1093/1093 transitions.
Applied a total of 0 rules in 17 ms. Remains 221 /221 variables (removed 0) and now considering 1093/1093 (removed 0) transitions.
[2024-05-21 03:48:07] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
[2024-05-21 03:48:07] [INFO ] Invariant cache hit.
[2024-05-21 03:48:07] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-21 03:48:07] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
[2024-05-21 03:48:07] [INFO ] Invariant cache hit.
[2024-05-21 03:48:07] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-21 03:48:07] [INFO ] Implicit Places using invariants and state equation in 765 ms returned []
Implicit Place search using SMT with State Equation took 865 ms to find 0 implicit places.
[2024-05-21 03:48:08] [INFO ] Redundant transitions in 622 ms returned []
[2024-05-21 03:48:08] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
[2024-05-21 03:48:08] [INFO ] Invariant cache hit.
[2024-05-21 03:48:08] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1816 ms. Remains : 221/221 places, 1093/1093 transitions.
Computed a total of 60 stabilizing places and 661 stable transitions
Computed a total of 60 stabilizing places and 661 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 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 81 ms :[p1, p1]
Incomplete random walk after 10000 steps, including 234 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 11 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 758828 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :{}
Probabilistic random walk after 758828 steps, saw 124552 distinct states, run finished after 3001 ms. (steps per millisecond=252 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 03:48:12] [INFO ] Flow matrix only has 874 transitions (discarded 219 similar events)
[2024-05-21 03:48:12] [INFO ] Invariant cache hit.
[2024-05-21 03:48:12] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-21 03:48:12] [INFO ] After 267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 03:48:12] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-21 03:48:12] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 03:48:12] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-21 03:48:12] [INFO ] After 87ms SMT Verify possible using 288 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 03:48:12] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2024-05-21 03:48:12] [INFO ] After 450ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 1093/1093 transitions.
Drop transitions removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 221 transition count 1024
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 220 transition count 1024
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 219 transition count 1023
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 219 transition count 1022
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -179
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 107 place count 202 transition count 1201
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 122 place count 202 transition count 1186
Drop transitions removed 162 transitions
Redundant transition composition rules discarded 162 transitions
Iterating global reduction 4 with 162 rules applied. Total rules applied 284 place count 202 transition count 1024
Free-agglomeration rule applied 56 times with reduction of 20 identical transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 340 place count 202 transition count 948
Reduce places removed 56 places and 0 transitions.
Drop transitions removed 95 transitions
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 177 transitions.
Iterating post reduction 4 with 233 rules applied. Total rules applied 573 place count 146 transition count 771
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 581 place count 138 transition count 708
Iterating global reduction 5 with 8 rules applied. Total rules applied 589 place count 138 transition count 708
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 591 place count 138 transition count 706
Drop transitions removed 92 transitions
Redundant transition composition rules discarded 92 transitions
Iterating global reduction 6 with 92 rules applied. Total rules applied 683 place count 138 transition count 614
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 685 place count 138 transition count 614
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 686 place count 138 transition count 613
Applied a total of 686 rules in 100 ms. Remains 138 /221 variables (removed 83) and now considering 613/1093 (removed 480) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 138/221 places, 613/1093 transitions.
Incomplete random walk after 10000 steps, including 171 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1069252 steps, run timeout after 3001 ms. (steps per millisecond=356 ) properties seen :{}
Probabilistic random walk after 1069252 steps, saw 133273 distinct states, run finished after 3001 ms. (steps per millisecond=356 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 03:48:16] [INFO ] Flow matrix only has 324 transitions (discarded 289 similar events)
// Phase 1: matrix 324 rows 138 cols
[2024-05-21 03:48:16] [INFO ] Computed 16 invariants in 3 ms
[2024-05-21 03:48:16] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-21 03:48:16] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 03:48:16] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-21 03:48:16] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 03:48:16] [INFO ] State equation strengthened by 212 read => feed constraints.
[2024-05-21 03:48:16] [INFO ] After 43ms SMT Verify possible using 212 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 03:48:16] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-21 03:48:16] [INFO ] After 214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 613/613 transitions.
Applied a total of 0 rules in 11 ms. Remains 138 /138 variables (removed 0) and now considering 613/613 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 138/138 places, 613/613 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 613/613 transitions.
Applied a total of 0 rules in 8 ms. Remains 138 /138 variables (removed 0) and now considering 613/613 (removed 0) transitions.
[2024-05-21 03:48:16] [INFO ] Flow matrix only has 324 transitions (discarded 289 similar events)
[2024-05-21 03:48:16] [INFO ] Invariant cache hit.
[2024-05-21 03:48:16] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-21 03:48:16] [INFO ] Flow matrix only has 324 transitions (discarded 289 similar events)
[2024-05-21 03:48:16] [INFO ] Invariant cache hit.
[2024-05-21 03:48:16] [INFO ] State equation strengthened by 212 read => feed constraints.
[2024-05-21 03:48:16] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2024-05-21 03:48:16] [INFO ] Redundant transitions in 180 ms returned []
[2024-05-21 03:48:16] [INFO ] Flow matrix only has 324 transitions (discarded 289 similar events)
[2024-05-21 03:48:16] [INFO ] Invariant cache hit.
[2024-05-21 03:48:17] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 734 ms. Remains : 138/138 places, 613/613 transitions.
Graph (trivial) has 128 edges and 138 vertex of which 40 / 138 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 289 transitions
Reduce isomorphic transitions removed 349 transitions.
Ensure Unique test removed 9 places
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 94 transition count 250
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 39 place count 80 transition count 249
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 41 place count 79 transition count 248
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 41 place count 79 transition count 239
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 59 place count 70 transition count 239
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 63 place count 66 transition count 235
Iterating global reduction 3 with 4 rules applied. Total rules applied 67 place count 66 transition count 235
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 70 place count 63 transition count 214
Iterating global reduction 3 with 3 rules applied. Total rules applied 73 place count 63 transition count 214
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 115 place count 63 transition count 172
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 131 place count 55 transition count 164
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 141 place count 55 transition count 154
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 142 place count 54 transition count 153
Iterating global reduction 5 with 1 rules applied. Total rules applied 143 place count 54 transition count 153
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 144 place count 53 transition count 146
Iterating global reduction 5 with 1 rules applied. Total rules applied 145 place count 53 transition count 146
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 159 place count 53 transition count 132
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 171 place count 47 transition count 163
Drop transitions removed 54 transitions
Redundant transition composition rules discarded 54 transitions
Iterating global reduction 6 with 54 rules applied. Total rules applied 225 place count 47 transition count 109
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 235 place count 42 transition count 104
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 239 place count 38 transition count 72
Iterating global reduction 6 with 4 rules applied. Total rules applied 243 place count 38 transition count 72
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 244 place count 38 transition count 72
Applied a total of 244 rules in 13 ms. Remains 38 /138 variables (removed 100) and now considering 72/613 (removed 541) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 72 rows 38 cols
[2024-05-21 03:48:17] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 03:48:17] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 03:48:17] [INFO ] [Real]Absence check using 1 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-21 03:48:17] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 03:48:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 03:48:17] [INFO ] [Nat]Absence check using 1 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-21 03:48:17] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 03:48:17] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 03:48:17] [INFO ] After 5ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 03:48:17] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-21 03:48:17] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 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 64 ms :[p1, p1]
Stuttering acceptance computed with spot in 63 ms :[p1, p1]
Stuttering acceptance computed with spot in 71 ms :[p1, p1]
Product exploration explored 100000 steps with 2200 reset in 407 ms.
Product exploration explored 100000 steps with 2213 reset in 416 ms.
Built C files in :
/tmp/ltsmin7695024123587962801
[2024-05-21 03:48:18] [INFO ] Computing symmetric may disable matrix : 1093 transitions.
[2024-05-21 03:48:18] [INFO ] Computation of Complete disable matrix. took 40 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:48:18] [INFO ] Computing symmetric may enable matrix : 1093 transitions.
[2024-05-21 03:48:18] [INFO ] Computation of Complete enable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:48:18] [INFO ] Computing Do-Not-Accords matrix : 1093 transitions.
[2024-05-21 03:48:18] [INFO ] Computation of Completed DNA matrix. took 47 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:48:18] [INFO ] Built C files in 326ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7695024123587962801
Running compilation step : cd /tmp/ltsmin7695024123587962801;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7695024123587962801;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7695024123587962801;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 1093/1093 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 1092
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 220 transition count 1092
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 219 transition count 1091
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 219 transition count 1090
Applied a total of 5 rules in 27 ms. Remains 219 /221 variables (removed 2) and now considering 1090/1093 (removed 3) transitions.
[2024-05-21 03:48:21] [INFO ] Flow matrix only has 871 transitions (discarded 219 similar events)
// Phase 1: matrix 871 rows 219 cols
[2024-05-21 03:48:21] [INFO ] Computed 6 invariants in 3 ms
[2024-05-21 03:48:21] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-21 03:48:21] [INFO ] Flow matrix only has 871 transitions (discarded 219 similar events)
[2024-05-21 03:48:21] [INFO ] Invariant cache hit.
[2024-05-21 03:48:22] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-21 03:48:22] [INFO ] Implicit Places using invariants and state equation in 652 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
[2024-05-21 03:48:23] [INFO ] Redundant transitions in 628 ms returned []
[2024-05-21 03:48:23] [INFO ] Flow matrix only has 871 transitions (discarded 219 similar events)
[2024-05-21 03:48:23] [INFO ] Invariant cache hit.
[2024-05-21 03:48:23] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 219/221 places, 1090/1093 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1709 ms. Remains : 219/221 places, 1090/1093 transitions.
Built C files in :
/tmp/ltsmin10282090574226664136
[2024-05-21 03:48:23] [INFO ] Computing symmetric may disable matrix : 1090 transitions.
[2024-05-21 03:48:23] [INFO ] Computation of Complete disable matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:48:23] [INFO ] Computing symmetric may enable matrix : 1090 transitions.
[2024-05-21 03:48:23] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:48:23] [INFO ] Computing Do-Not-Accords matrix : 1090 transitions.
[2024-05-21 03:48:23] [INFO ] Computation of Completed DNA matrix. took 39 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:48:23] [INFO ] Built C files in 293ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10282090574226664136
Running compilation step : cd /tmp/ltsmin10282090574226664136;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10282090574226664136;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10282090574226664136;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 03:48:27] [INFO ] Flatten gal took : 56 ms
[2024-05-21 03:48:27] [INFO ] Flatten gal took : 57 ms
[2024-05-21 03:48:27] [INFO ] Time to serialize gal into /tmp/LTL996221397552739468.gal : 21 ms
[2024-05-21 03:48:27] [INFO ] Time to serialize properties into /tmp/LTL15161025775934778236.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL996221397552739468.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6395774359860443063.hoa' '-atoms' '/tmp/LTL15161025775934778236.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL15161025775934778236.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6395774359860443063.hoa
Detected timeout of ITS tools.
[2024-05-21 03:48:43] [INFO ] Flatten gal took : 46 ms
[2024-05-21 03:48:43] [INFO ] Flatten gal took : 44 ms
[2024-05-21 03:48:43] [INFO ] Time to serialize gal into /tmp/LTL18392907826967331151.gal : 13 ms
[2024-05-21 03:48:43] [INFO ] Time to serialize properties into /tmp/LTL17161119226095525968.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18392907826967331151.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17161119226095525968.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G("(p40==1)"))||(G(F("((((p355!=1)||(p396!=1))||((p568!=1)||(p1863!=1)))||(p1884!=1))")))))
Formula 0 simplified : F!"(p40==1)" & FG!"((((p355!=1)||(p396!=1))||((p568!=1)||(p1863!=1)))||(p1884!=1))"
Detected timeout of ITS tools.
[2024-05-21 03:48:58] [INFO ] Flatten gal took : 45 ms
[2024-05-21 03:48:58] [INFO ] Applying decomposition
[2024-05-21 03:48:58] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14730760202523666459.txt' '-o' '/tmp/graph14730760202523666459.bin' '-w' '/tmp/graph14730760202523666459.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14730760202523666459.bin' '-l' '-1' '-v' '-w' '/tmp/graph14730760202523666459.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:48:58] [INFO ] Decomposing Gal with order
[2024-05-21 03:48:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:48:58] [INFO ] Removed a total of 2213 redundant transitions.
[2024-05-21 03:48:58] [INFO ] Flatten gal took : 252 ms
[2024-05-21 03:48:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 219 labels/synchronizations in 34 ms.
[2024-05-21 03:48:58] [INFO ] Time to serialize gal into /tmp/LTL5959461491836937710.gal : 7 ms
[2024-05-21 03:48:58] [INFO ] Time to serialize properties into /tmp/LTL10103331364009033748.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5959461491836937710.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10103331364009033748.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G("(i0.u0.p40==1)"))||(G(F("((((i1.u5.p355!=1)||(i1.u6.p396!=1))||((i1.u12.p568!=1)||(u46.p1863!=1)))||(u46.p1884!=1))")))))
Formula 0 simplified : F!"(i0.u0.p40==1)" & FG!"((((i1.u5.p355!=1)||(i1.u6.p396!=1))||((i1.u12.p568!=1)||(u46.p1863!=1)))||(u46.p1884!=1))"
Reverse transition relation is NOT exact ! Due to transitions t5952_t1168_t1161, t5941_t976, t5266_t1127_t937_t749_t560_t370_t180, u46.t3, i0.t1122, i0.u1....1811
Computing Next relation with stutter on 1.97973e+14 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
165 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.71487,89456,1,0,98319,65651,6245,376742,2760,286630,84620
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudDeployment-PT-6b-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudDeployment-PT-6b-LTLFireability-13 finished in 61206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((G(p1) U p2)&&p0))))'
Support contains 4 out of 1142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1142/1142 places, 6036/6036 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1141 transition count 6036
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 1122 transition count 1934
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 1122 transition count 1934
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 1122 transition count 1933
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 1120 transition count 1931
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 1120 transition count 1931
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 1120 transition count 1930
Applied a total of 45 rules in 257 ms. Remains 1120 /1142 variables (removed 22) and now considering 1930/6036 (removed 4106) transitions.
// Phase 1: matrix 1930 rows 1120 cols
[2024-05-21 03:49:01] [INFO ] Computed 18 invariants in 14 ms
[2024-05-21 03:49:01] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-21 03:49:01] [INFO ] Invariant cache hit.
[2024-05-21 03:49:02] [INFO ] Implicit Places using invariants and state equation in 1134 ms returned [12, 20, 186, 194, 359, 367, 532, 540, 705, 713, 878, 886]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 1358 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1108/1142 places, 1930/6036 transitions.
Applied a total of 0 rules in 28 ms. Remains 1108 /1108 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1643 ms. Remains : 1108/1142 places, 1930/6036 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (OR (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true]
Running random walk in product with property : CloudDeployment-PT-6b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 5}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(EQ s1023 1), p0:(AND (EQ s187 1) (EQ s1070 1)), p2:(EQ s438 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-6b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6b-LTLFireability-15 finished in 1894 ms.
All properties solved by simple procedures.
Total runtime 151577 ms.

BK_STOP 1716263343857

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudDeployment-PT-6b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is CloudDeployment-PT-6b, 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 r087-tall-171620522100383"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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