About the Execution of ITS-Tools for CloudDeployment-PT-7a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1466.703 | 276409.00 | 378434.00 | 1950.80 | FFFFFFFTFFTTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r069-smll-167814396400444.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is CloudDeployment-PT-7a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-167814396400444
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 792K
-rw-r--r-- 1 mcc users 6.4K Feb 25 15:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 15:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 15:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 16:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 16:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 16:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 16:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 420K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CloudDeployment-PT-7a-LTLFireability-00
FORMULA_NAME CloudDeployment-PT-7a-LTLFireability-01
FORMULA_NAME CloudDeployment-PT-7a-LTLFireability-02
FORMULA_NAME CloudDeployment-PT-7a-LTLFireability-03
FORMULA_NAME CloudDeployment-PT-7a-LTLFireability-04
FORMULA_NAME CloudDeployment-PT-7a-LTLFireability-05
FORMULA_NAME CloudDeployment-PT-7a-LTLFireability-06
FORMULA_NAME CloudDeployment-PT-7a-LTLFireability-07
FORMULA_NAME CloudDeployment-PT-7a-LTLFireability-08
FORMULA_NAME CloudDeployment-PT-7a-LTLFireability-09
FORMULA_NAME CloudDeployment-PT-7a-LTLFireability-10
FORMULA_NAME CloudDeployment-PT-7a-LTLFireability-11
FORMULA_NAME CloudDeployment-PT-7a-LTLFireability-12
FORMULA_NAME CloudDeployment-PT-7a-LTLFireability-13
FORMULA_NAME CloudDeployment-PT-7a-LTLFireability-14
FORMULA_NAME CloudDeployment-PT-7a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678466887605
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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-7a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-10 16:48:11] [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]
[2023-03-10 16:48:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 16:48:11] [INFO ] Load time of PNML (sax parser for PT used): 265 ms
[2023-03-10 16:48:11] [INFO ] Transformed 264 places.
[2023-03-10 16:48:11] [INFO ] Transformed 1174 transitions.
[2023-03-10 16:48:11] [INFO ] Found NUPN structural information;
[2023-03-10 16:48:11] [INFO ] Parsed PT model containing 264 places and 1174 transitions and 7331 arcs in 429 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 154 transitions
Reduce redundant transitions removed 154 transitions.
FORMULA CloudDeployment-PT-7a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7a-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 1020/1020 transitions.
Ensure Unique test removed 14 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 250 transition count 1020
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 245 transition count 1015
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 245 transition count 1015
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 241 transition count 1011
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 241 transition count 1011
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 238 transition count 1008
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 238 transition count 1008
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 236 transition count 1006
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 236 transition count 1006
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 235 transition count 1005
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 235 transition count 1005
Drop transitions removed 98 transitions
Redundant transition composition rules discarded 98 transitions
Iterating global reduction 1 with 98 rules applied. Total rules applied 142 place count 235 transition count 907
Applied a total of 142 rules in 196 ms. Remains 235 /264 variables (removed 29) and now considering 907/1020 (removed 113) transitions.
[2023-03-10 16:48:12] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
// Phase 1: matrix 460 rows 235 cols
[2023-03-10 16:48:12] [INFO ] Computed 28 place invariants in 37 ms
[2023-03-10 16:48:12] [INFO ] Implicit Places using invariants in 533 ms returned []
[2023-03-10 16:48:12] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2023-03-10 16:48:12] [INFO ] Invariant cache hit.
[2023-03-10 16:48:13] [INFO ] State equation strengthened by 225 read => feed constraints.
[2023-03-10 16:48:13] [INFO ] Implicit Places using invariants and state equation in 1000 ms returned []
Implicit Place search using SMT with State Equation took 1595 ms to find 0 implicit places.
[2023-03-10 16:48:13] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2023-03-10 16:48:13] [INFO ] Invariant cache hit.
[2023-03-10 16:48:14] [INFO ] Dead Transitions using invariants and state equation in 841 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/264 places, 907/1020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2635 ms. Remains : 235/264 places, 907/1020 transitions.
Support contains 48 out of 235 places after structural reductions.
[2023-03-10 16:48:15] [INFO ] Flatten gal took : 180 ms
[2023-03-10 16:48:15] [INFO ] Flatten gal took : 91 ms
[2023-03-10 16:48:15] [INFO ] Input system was already deterministic with 907 transitions.
Incomplete random walk after 10000 steps, including 99 resets, run finished after 814 ms. (steps per millisecond=12 ) properties (out of 29) seen :16
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 13) seen :7
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :2
Finished Best-First random walk after 4353 steps, including 2 resets, run visited all 2 properties in 12 ms. (steps per millisecond=362 )
Computed a total of 116 stabilizing places and 669 stable transitions
Graph (complete) has 2487 edges and 235 vertex of which 234 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.20 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(G(p0)) U (p1&&G(F(p2)))))))'
Support contains 8 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 907/907 transitions.
Graph (trivial) has 272 edges and 235 vertex of which 65 / 235 are part of one of the 19 SCC in 5 ms
Free SCC test removed 46 places
Ensure Unique test removed 142 transitions
Reduce isomorphic transitions removed 142 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 184 transition count 720
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 184 transition count 720
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 53 place count 163 transition count 811
Drop transitions removed 140 transitions
Redundant transition composition rules discarded 140 transitions
Iterating global reduction 0 with 140 rules applied. Total rules applied 193 place count 163 transition count 671
Applied a total of 193 rules in 244 ms. Remains 163 /235 variables (removed 72) and now considering 671/907 (removed 236) transitions.
[2023-03-10 16:48:17] [INFO ] Flow matrix only has 258 transitions (discarded 413 similar events)
// Phase 1: matrix 258 rows 163 cols
[2023-03-10 16:48:17] [INFO ] Computed 28 place invariants in 8 ms
[2023-03-10 16:48:17] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-10 16:48:17] [INFO ] Flow matrix only has 258 transitions (discarded 413 similar events)
[2023-03-10 16:48:17] [INFO ] Invariant cache hit.
[2023-03-10 16:48:17] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-03-10 16:48:18] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
[2023-03-10 16:48:19] [INFO ] Redundant transitions in 1044 ms returned []
[2023-03-10 16:48:19] [INFO ] Flow matrix only has 258 transitions (discarded 413 similar events)
[2023-03-10 16:48:19] [INFO ] Invariant cache hit.
[2023-03-10 16:48:19] [INFO ] Dead Transitions using invariants and state equation in 475 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 163/235 places, 671/907 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2530 ms. Remains : 163/235 places, 671/907 transitions.
Stuttering acceptance computed with spot in 524 ms :[(OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND p0 (NOT p1)) (AND p1 (NOT p2))), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : CloudDeployment-PT-7a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p1), acceptance={0, 1} source=0 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={1} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0, 1} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s23 1), p2:(AND (EQ s95 1) (EQ s97 1)), p0:(AND (EQ s47 1) (EQ s48 1) (EQ s50 1) (EQ s146 1) (EQ s161 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 2 reset in 4 ms.
FORMULA CloudDeployment-PT-7a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7a-LTLFireability-00 finished in 3179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((G(p2)||p1)))))'
Support contains 28 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 907/907 transitions.
Applied a total of 0 rules in 6 ms. Remains 235 /235 variables (removed 0) and now considering 907/907 (removed 0) transitions.
[2023-03-10 16:48:20] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
// Phase 1: matrix 460 rows 235 cols
[2023-03-10 16:48:20] [INFO ] Computed 28 place invariants in 3 ms
[2023-03-10 16:48:20] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-10 16:48:20] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2023-03-10 16:48:20] [INFO ] Invariant cache hit.
[2023-03-10 16:48:20] [INFO ] State equation strengthened by 225 read => feed constraints.
[2023-03-10 16:48:20] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 761 ms to find 0 implicit places.
[2023-03-10 16:48:20] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2023-03-10 16:48:20] [INFO ] Invariant cache hit.
[2023-03-10 16:48:21] [INFO ] Dead Transitions using invariants and state equation in 896 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1670 ms. Remains : 235/235 places, 907/907 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CloudDeployment-PT-7a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s147 0) (OR (EQ s1 0) (EQ s2 0) (EQ s26 0) (EQ s229 0))), p1:(OR (EQ s53 0) (EQ s54 0) (EQ s56 0) (EQ s218 0) (EQ s233 0)), p2:(AND (OR (EQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 508 ms.
Product exploration explored 100000 steps with 0 reset in 284 ms.
Computed a total of 116 stabilizing places and 669 stable transitions
Graph (complete) has 2487 edges and 235 vertex of which 234 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Computed a total of 116 stabilizing places and 669 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X p2))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 10 factoid took 696 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 96 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 16:48:24] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2023-03-10 16:48:24] [INFO ] Invariant cache hit.
[2023-03-10 16:48:24] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 16:48:24] [INFO ] [Nat]Absence check using 0 positive and 28 generalized place invariants in 17 ms returned sat
[2023-03-10 16:48:25] [INFO ] After 422ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 16:48:25] [INFO ] State equation strengthened by 225 read => feed constraints.
[2023-03-10 16:48:25] [INFO ] After 250ms SMT Verify possible using 225 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 16:48:25] [INFO ] After 471ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 185 ms.
[2023-03-10 16:48:25] [INFO ] After 1277ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 31 ms.
Support contains 26 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 907/907 transitions.
Graph (trivial) has 223 edges and 235 vertex of which 64 / 235 are part of one of the 19 SCC in 2 ms
Free SCC test removed 45 places
Drop transitions removed 147 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 196 transitions.
Graph (complete) has 1381 edges and 190 vertex of which 189 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 7 place count 184 transition count 671
Iterating global reduction 0 with 5 rules applied. Total rules applied 12 place count 184 transition count 671
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 26 place count 177 transition count 664
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 68 place count 156 transition count 755
Drop transitions removed 141 transitions
Redundant transition composition rules discarded 141 transitions
Iterating global reduction 0 with 141 rules applied. Total rules applied 209 place count 156 transition count 614
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 211 place count 155 transition count 613
Applied a total of 211 rules in 154 ms. Remains 155 /235 variables (removed 80) and now considering 613/907 (removed 294) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 155/235 places, 613/907 transitions.
Incomplete random walk after 10000 steps, including 151 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-10 16:48:26] [INFO ] Flow matrix only has 256 transitions (discarded 357 similar events)
// Phase 1: matrix 256 rows 155 cols
[2023-03-10 16:48:26] [INFO ] Computed 28 place invariants in 5 ms
[2023-03-10 16:48:26] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 16:48:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 16:48:26] [INFO ] [Nat]Absence check using 7 positive and 21 generalized place invariants in 11 ms returned sat
[2023-03-10 16:48:26] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 16:48:26] [INFO ] State equation strengthened by 175 read => feed constraints.
[2023-03-10 16:48:26] [INFO ] After 66ms SMT Verify possible using 175 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 16:48:26] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-10 16:48:26] [INFO ] After 385ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 26 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 613/613 transitions.
Applied a total of 0 rules in 19 ms. Remains 155 /155 variables (removed 0) and now considering 613/613 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 155/155 places, 613/613 transitions.
Incomplete random walk after 10000 steps, including 151 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 337862 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{}
Probabilistic random walk after 337862 steps, saw 67439 distinct states, run finished after 3004 ms. (steps per millisecond=112 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 16:48:29] [INFO ] Flow matrix only has 256 transitions (discarded 357 similar events)
[2023-03-10 16:48:29] [INFO ] Invariant cache hit.
[2023-03-10 16:48:29] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 16:48:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 16:48:30] [INFO ] [Nat]Absence check using 7 positive and 21 generalized place invariants in 9 ms returned sat
[2023-03-10 16:48:30] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 16:48:30] [INFO ] State equation strengthened by 175 read => feed constraints.
[2023-03-10 16:48:30] [INFO ] After 77ms SMT Verify possible using 175 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 16:48:30] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-10 16:48:30] [INFO ] After 369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 26 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 613/613 transitions.
Applied a total of 0 rules in 22 ms. Remains 155 /155 variables (removed 0) and now considering 613/613 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 155/155 places, 613/613 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 613/613 transitions.
Applied a total of 0 rules in 17 ms. Remains 155 /155 variables (removed 0) and now considering 613/613 (removed 0) transitions.
[2023-03-10 16:48:30] [INFO ] Flow matrix only has 256 transitions (discarded 357 similar events)
[2023-03-10 16:48:30] [INFO ] Invariant cache hit.
[2023-03-10 16:48:30] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-10 16:48:30] [INFO ] Flow matrix only has 256 transitions (discarded 357 similar events)
[2023-03-10 16:48:30] [INFO ] Invariant cache hit.
[2023-03-10 16:48:30] [INFO ] State equation strengthened by 175 read => feed constraints.
[2023-03-10 16:48:31] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
[2023-03-10 16:48:31] [INFO ] Redundant transitions in 105 ms returned []
[2023-03-10 16:48:31] [INFO ] Flow matrix only has 256 transitions (discarded 357 similar events)
[2023-03-10 16:48:31] [INFO ] Invariant cache hit.
[2023-03-10 16:48:31] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1269 ms. Remains : 155/155 places, 613/613 transitions.
Ensure Unique test removed 357 transitions
Reduce isomorphic transitions removed 357 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 406 rules applied. Total rules applied 406 place count 155 transition count 207
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 455 place count 106 transition count 207
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 455 place count 106 transition count 194
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 481 place count 93 transition count 194
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 494 place count 80 transition count 181
Iterating global reduction 2 with 13 rules applied. Total rules applied 507 place count 80 transition count 181
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 513 place count 80 transition count 175
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 519 place count 74 transition count 133
Iterating global reduction 3 with 6 rules applied. Total rules applied 525 place count 74 transition count 133
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 537 place count 74 transition count 121
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 551 place count 67 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 552 place count 67 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 553 place count 66 transition count 162
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 559 place count 66 transition count 162
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 560 place count 66 transition count 161
Applied a total of 560 rules in 78 ms. Remains 66 /155 variables (removed 89) and now considering 161/613 (removed 452) transitions.
Running SMT prover for 1 properties.
[2023-03-10 16:48:31] [INFO ] Flow matrix only has 113 transitions (discarded 48 similar events)
// Phase 1: matrix 113 rows 66 cols
[2023-03-10 16:48:31] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-10 16:48:31] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 16:48:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-10 16:48:31] [INFO ] [Nat]Absence check using 7 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-10 16:48:31] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 16:48:31] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 16:48:31] [INFO ] After 30ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 16:48:31] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-10 16:48:31] [INFO ] After 212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X p2))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p1) p2)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 10 factoid took 809 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 173 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Support contains 28 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 907/907 transitions.
Applied a total of 0 rules in 7 ms. Remains 235 /235 variables (removed 0) and now considering 907/907 (removed 0) transitions.
[2023-03-10 16:48:33] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
// Phase 1: matrix 460 rows 235 cols
[2023-03-10 16:48:33] [INFO ] Computed 28 place invariants in 5 ms
[2023-03-10 16:48:33] [INFO ] Implicit Places using invariants in 232 ms returned []
[2023-03-10 16:48:33] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2023-03-10 16:48:33] [INFO ] Invariant cache hit.
[2023-03-10 16:48:33] [INFO ] State equation strengthened by 225 read => feed constraints.
[2023-03-10 16:48:34] [INFO ] Implicit Places using invariants and state equation in 794 ms returned []
Implicit Place search using SMT with State Equation took 1029 ms to find 0 implicit places.
[2023-03-10 16:48:34] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2023-03-10 16:48:34] [INFO ] Invariant cache hit.
[2023-03-10 16:48:35] [INFO ] Dead Transitions using invariants and state equation in 964 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2002 ms. Remains : 235/235 places, 907/907 transitions.
Computed a total of 116 stabilizing places and 669 stable transitions
Graph (complete) has 2487 edges and 235 vertex of which 234 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 116 stabilizing places and 669 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X p2))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 10 factoid took 542 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 98 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 16:48:36] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2023-03-10 16:48:36] [INFO ] Invariant cache hit.
[2023-03-10 16:48:36] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 16:48:36] [INFO ] [Nat]Absence check using 0 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-10 16:48:36] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 16:48:36] [INFO ] State equation strengthened by 225 read => feed constraints.
[2023-03-10 16:48:36] [INFO ] After 172ms SMT Verify possible using 225 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 16:48:36] [INFO ] After 333ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 144 ms.
[2023-03-10 16:48:37] [INFO ] After 825ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 22 ms.
Support contains 26 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 907/907 transitions.
Graph (trivial) has 223 edges and 235 vertex of which 64 / 235 are part of one of the 19 SCC in 1 ms
Free SCC test removed 45 places
Drop transitions removed 147 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 196 transitions.
Graph (complete) has 1381 edges and 190 vertex of which 189 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 7 place count 184 transition count 671
Iterating global reduction 0 with 5 rules applied. Total rules applied 12 place count 184 transition count 671
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 26 place count 177 transition count 664
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 68 place count 156 transition count 755
Drop transitions removed 141 transitions
Redundant transition composition rules discarded 141 transitions
Iterating global reduction 0 with 141 rules applied. Total rules applied 209 place count 156 transition count 614
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 211 place count 155 transition count 613
Applied a total of 211 rules in 90 ms. Remains 155 /235 variables (removed 80) and now considering 613/907 (removed 294) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 155/235 places, 613/907 transitions.
Incomplete random walk after 10000 steps, including 151 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 370982 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :{}
Probabilistic random walk after 370982 steps, saw 73133 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-10 16:48:40] [INFO ] Flow matrix only has 256 transitions (discarded 357 similar events)
// Phase 1: matrix 256 rows 155 cols
[2023-03-10 16:48:40] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-10 16:48:40] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 16:48:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 16:48:40] [INFO ] [Nat]Absence check using 7 positive and 21 generalized place invariants in 7 ms returned sat
[2023-03-10 16:48:40] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 16:48:40] [INFO ] State equation strengthened by 175 read => feed constraints.
[2023-03-10 16:48:40] [INFO ] After 93ms SMT Verify possible using 175 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 16:48:40] [INFO ] After 175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-10 16:48:40] [INFO ] After 453ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 26 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 613/613 transitions.
Applied a total of 0 rules in 13 ms. Remains 155 /155 variables (removed 0) and now considering 613/613 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 155/155 places, 613/613 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 613/613 transitions.
Applied a total of 0 rules in 16 ms. Remains 155 /155 variables (removed 0) and now considering 613/613 (removed 0) transitions.
[2023-03-10 16:48:40] [INFO ] Flow matrix only has 256 transitions (discarded 357 similar events)
[2023-03-10 16:48:40] [INFO ] Invariant cache hit.
[2023-03-10 16:48:41] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-10 16:48:41] [INFO ] Flow matrix only has 256 transitions (discarded 357 similar events)
[2023-03-10 16:48:41] [INFO ] Invariant cache hit.
[2023-03-10 16:48:41] [INFO ] State equation strengthened by 175 read => feed constraints.
[2023-03-10 16:48:41] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
[2023-03-10 16:48:41] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-10 16:48:41] [INFO ] Flow matrix only has 256 transitions (discarded 357 similar events)
[2023-03-10 16:48:41] [INFO ] Invariant cache hit.
[2023-03-10 16:48:42] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1115 ms. Remains : 155/155 places, 613/613 transitions.
Ensure Unique test removed 357 transitions
Reduce isomorphic transitions removed 357 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 406 rules applied. Total rules applied 406 place count 155 transition count 207
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 455 place count 106 transition count 207
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 455 place count 106 transition count 194
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 481 place count 93 transition count 194
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 494 place count 80 transition count 181
Iterating global reduction 2 with 13 rules applied. Total rules applied 507 place count 80 transition count 181
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 513 place count 80 transition count 175
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 519 place count 74 transition count 133
Iterating global reduction 3 with 6 rules applied. Total rules applied 525 place count 74 transition count 133
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 537 place count 74 transition count 121
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 551 place count 67 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 552 place count 67 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 553 place count 66 transition count 162
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 559 place count 66 transition count 162
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 560 place count 66 transition count 161
Applied a total of 560 rules in 42 ms. Remains 66 /155 variables (removed 89) and now considering 161/613 (removed 452) transitions.
Running SMT prover for 2 properties.
[2023-03-10 16:48:42] [INFO ] Flow matrix only has 113 transitions (discarded 48 similar events)
// Phase 1: matrix 113 rows 66 cols
[2023-03-10 16:48:42] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-10 16:48:42] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 16:48:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 16:48:42] [INFO ] [Nat]Absence check using 7 positive and 21 generalized place invariants in 6 ms returned sat
[2023-03-10 16:48:42] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 16:48:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 16:48:42] [INFO ] After 37ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 16:48:42] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-10 16:48:42] [INFO ] After 264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X p2))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 10 factoid took 949 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 172 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 176 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 238 ms.
Product exploration explored 100000 steps with 0 reset in 313 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 121 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Support contains 28 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 907/907 transitions.
Graph (trivial) has 222 edges and 235 vertex of which 64 / 235 are part of one of the 19 SCC in 1 ms
Free SCC test removed 45 places
Ensure Unique test removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 185 transition count 729
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 185 transition count 729
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -140
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 0 with 21 rules applied. Total rules applied 32 place count 185 transition count 869
Deduced a syphon composed of 21 places in 0 ms
Drop transitions removed 162 transitions
Redundant transition composition rules discarded 162 transitions
Iterating global reduction 0 with 162 rules applied. Total rules applied 194 place count 185 transition count 707
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 22 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 195 place count 185 transition count 707
Deduced a syphon composed of 22 places in 1 ms
Applied a total of 195 rules in 94 ms. Remains 185 /235 variables (removed 50) and now considering 707/907 (removed 200) transitions.
[2023-03-10 16:48:45] [INFO ] Redundant transitions in 699 ms returned []
[2023-03-10 16:48:45] [INFO ] Flow matrix only has 294 transitions (discarded 413 similar events)
// Phase 1: matrix 294 rows 185 cols
[2023-03-10 16:48:45] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-10 16:48:46] [INFO ] Dead Transitions using invariants and state equation in 551 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 185/235 places, 707/907 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1352 ms. Remains : 185/235 places, 707/907 transitions.
Built C files in :
/tmp/ltsmin7667663089471995016
[2023-03-10 16:48:46] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7667663089471995016
Running compilation step : cd /tmp/ltsmin7667663089471995016;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7667663089471995016;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7667663089471995016;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 28 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 907/907 transitions.
Applied a total of 0 rules in 5 ms. Remains 235 /235 variables (removed 0) and now considering 907/907 (removed 0) transitions.
[2023-03-10 16:48:49] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
// Phase 1: matrix 460 rows 235 cols
[2023-03-10 16:48:49] [INFO ] Computed 28 place invariants in 3 ms
[2023-03-10 16:48:49] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-10 16:48:49] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2023-03-10 16:48:49] [INFO ] Invariant cache hit.
[2023-03-10 16:48:49] [INFO ] State equation strengthened by 225 read => feed constraints.
[2023-03-10 16:48:50] [INFO ] Implicit Places using invariants and state equation in 718 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
[2023-03-10 16:48:50] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2023-03-10 16:48:50] [INFO ] Invariant cache hit.
[2023-03-10 16:48:51] [INFO ] Dead Transitions using invariants and state equation in 962 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1803 ms. Remains : 235/235 places, 907/907 transitions.
Built C files in :
/tmp/ltsmin1365511101405025736
[2023-03-10 16:48:51] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1365511101405025736
Running compilation step : cd /tmp/ltsmin1365511101405025736;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2759 ms.
Running link step : cd /tmp/ltsmin1365511101405025736;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin1365511101405025736;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11158713303376783988.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-10 16:49:06] [INFO ] Flatten gal took : 68 ms
[2023-03-10 16:49:06] [INFO ] Flatten gal took : 67 ms
[2023-03-10 16:49:06] [INFO ] Time to serialize gal into /tmp/LTL1495568859884311751.gal : 10 ms
[2023-03-10 16:49:06] [INFO ] Time to serialize properties into /tmp/LTL15730418330456478782.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1495568859884311751.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4148598269419620568.hoa' '-atoms' '/tmp/LTL15730418330456478782.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15730418330456478782.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4148598269419620568.hoa
Detected timeout of ITS tools.
[2023-03-10 16:49:21] [INFO ] Flatten gal took : 55 ms
[2023-03-10 16:49:21] [INFO ] Flatten gal took : 51 ms
[2023-03-10 16:49:21] [INFO ] Time to serialize gal into /tmp/LTL9482780662899148885.gal : 7 ms
[2023-03-10 16:49:21] [INFO ] Time to serialize properties into /tmp/LTL16770354542061914051.ltl : 4 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9482780662899148885.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16770354542061914051.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((X(("(((p58==0)||(p60==0))||((p62==0)||(p247==0)))")||(("(p262==0)")||(G("(((((((p2==0)||(p4==0))||((p16==0)||(p30==0)))||(((p32=...466
Formula 0 simplified : F(!"((p159==0)&&(((p2==0)||(p4==0))||((p28==0)||(p258==0))))" & X(!"(((p58==0)||(p60==0))||((p62==0)||(p247==0)))" & !"(p262==0)" & ...456
Detected timeout of ITS tools.
[2023-03-10 16:49:36] [INFO ] Flatten gal took : 48 ms
[2023-03-10 16:49:36] [INFO ] Applying decomposition
[2023-03-10 16:49:36] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14805484984141295104.txt' '-o' '/tmp/graph14805484984141295104.bin' '-w' '/tmp/graph14805484984141295104.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14805484984141295104.bin' '-l' '-1' '-v' '-w' '/tmp/graph14805484984141295104.weights' '-q' '0' '-e' '0.001'
[2023-03-10 16:49:37] [INFO ] Decomposing Gal with order
[2023-03-10 16:49:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 16:49:37] [INFO ] Removed a total of 1103 redundant transitions.
[2023-03-10 16:49:37] [INFO ] Flatten gal took : 268 ms
[2023-03-10 16:49:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 348 labels/synchronizations in 39 ms.
[2023-03-10 16:49:37] [INFO ] Time to serialize gal into /tmp/LTL3599979623783426636.gal : 11 ms
[2023-03-10 16:49:37] [INFO ] Time to serialize properties into /tmp/LTL18407771158947200107.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3599979623783426636.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18407771158947200107.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((X(("(((i8.u65.p58==0)||(i8.u65.p60==0))||((i2.i1.u15.p62==0)||(i8.u65.p247==0)))")||(("(i8.u65.p262==0)")||(G("(((((((i8.u65.p2=...738
Formula 0 simplified : F(!"((i5.i0.u40.p159==0)&&(((i8.u65.p2==0)||(i8.u65.p4==0))||((i0.i1.u6.p28==0)||(i6.i1.u63.p258==0))))" & X(!"(((i8.u65.p58==0)||(i...728
Reverse transition relation is NOT exact ! Due to transitions t248, t782, t795, i0.t242, i0.t219, i0.i0.t226, i0.i0.t234, i0.i0.t239, i0.i0.u3.t748, i0.i1....847
Computing Next relation with stutter on 2 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
715 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,7.22637,217384,1,0,356943,6025,5574,628273,1794,37271,530512
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudDeployment-PT-7a-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudDeployment-PT-7a-LTLFireability-01 finished in 85656 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(G((p1&&F(G(p2))))))))'
Support contains 7 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 907/907 transitions.
Applied a total of 0 rules in 3 ms. Remains 235 /235 variables (removed 0) and now considering 907/907 (removed 0) transitions.
[2023-03-10 16:49:45] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2023-03-10 16:49:45] [INFO ] Invariant cache hit.
[2023-03-10 16:49:45] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-10 16:49:45] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2023-03-10 16:49:45] [INFO ] Invariant cache hit.
[2023-03-10 16:49:46] [INFO ] State equation strengthened by 225 read => feed constraints.
[2023-03-10 16:49:46] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
[2023-03-10 16:49:46] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2023-03-10 16:49:46] [INFO ] Invariant cache hit.
[2023-03-10 16:49:47] [INFO ] Dead Transitions using invariants and state equation in 809 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1562 ms. Remains : 235/235 places, 907/907 transitions.
Stuttering acceptance computed with spot in 273 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CloudDeployment-PT-7a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s114 1), p1:(OR (EQ s27 0) (EQ s28 0) (EQ s30 0) (EQ s218 0) (EQ s233 0)), p2:(AND (EQ s27 1) (EQ s28 1) (EQ s43 1) (EQ s218 1) (EQ s233 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-7a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7a-LTLFireability-02 finished in 1860 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))&&(p1||X((G(p0) U (p1&&G(p0))))))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 907/907 transitions.
Applied a total of 0 rules in 5 ms. Remains 235 /235 variables (removed 0) and now considering 907/907 (removed 0) transitions.
[2023-03-10 16:49:47] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2023-03-10 16:49:47] [INFO ] Invariant cache hit.
[2023-03-10 16:49:47] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-03-10 16:49:47] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2023-03-10 16:49:47] [INFO ] Invariant cache hit.
[2023-03-10 16:49:48] [INFO ] State equation strengthened by 225 read => feed constraints.
[2023-03-10 16:49:48] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 1155 ms to find 0 implicit places.
[2023-03-10 16:49:48] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2023-03-10 16:49:48] [INFO ] Invariant cache hit.
[2023-03-10 16:49:49] [INFO ] Dead Transitions using invariants and state equation in 592 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1753 ms. Remains : 235/235 places, 907/907 transitions.
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-7a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s54 1) (EQ s132 1)), p1:(EQ s153 1)], 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, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-7a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7a-LTLFireability-03 finished in 2125 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(p0))&&(X(p1)||p1)) U (X(G(p2)) U p1)))'
Support contains 9 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 907/907 transitions.
Applied a total of 0 rules in 5 ms. Remains 235 /235 variables (removed 0) and now considering 907/907 (removed 0) transitions.
[2023-03-10 16:49:49] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2023-03-10 16:49:49] [INFO ] Invariant cache hit.
[2023-03-10 16:49:50] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-03-10 16:49:50] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2023-03-10 16:49:50] [INFO ] Invariant cache hit.
[2023-03-10 16:49:50] [INFO ] State equation strengthened by 225 read => feed constraints.
[2023-03-10 16:49:50] [INFO ] Implicit Places using invariants and state equation in 878 ms returned []
Implicit Place search using SMT with State Equation took 1122 ms to find 0 implicit places.
[2023-03-10 16:49:50] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2023-03-10 16:49:50] [INFO ] Invariant cache hit.
[2023-03-10 16:49:51] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1735 ms. Remains : 235/235 places, 907/907 transitions.
Stuttering acceptance computed with spot in 246 ms :[true, (NOT p1), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : CloudDeployment-PT-7a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p1 p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=5 dest: 5}, { cond=(AND p1 p2), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=1, aps=[p1:(AND (EQ s105 1) (EQ s106 1) (EQ s121 1) (EQ s218 1) (EQ s233 1)), p0:(AND (EQ s53 1) (EQ s54 1) (EQ s56 1) (EQ s218 1) (EQ s233 1)), p2:(AND (EQ s53 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, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-7a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7a-LTLFireability-04 finished in 2014 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 7 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 907/907 transitions.
Graph (trivial) has 272 edges and 235 vertex of which 66 / 235 are part of one of the 20 SCC in 1 ms
Free SCC test removed 46 places
Ensure Unique test removed 141 transitions
Reduce isomorphic transitions removed 141 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 183 transition count 712
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 183 transition count 712
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -90
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 53 place count 163 transition count 802
Drop transitions removed 137 transitions
Redundant transition composition rules discarded 137 transitions
Iterating global reduction 0 with 137 rules applied. Total rules applied 190 place count 163 transition count 665
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 192 place count 163 transition count 665
Applied a total of 192 rules in 79 ms. Remains 163 /235 variables (removed 72) and now considering 665/907 (removed 242) transitions.
[2023-03-10 16:49:51] [INFO ] Flow matrix only has 260 transitions (discarded 405 similar events)
// Phase 1: matrix 260 rows 163 cols
[2023-03-10 16:49:51] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-10 16:49:52] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-10 16:49:52] [INFO ] Flow matrix only has 260 transitions (discarded 405 similar events)
[2023-03-10 16:49:52] [INFO ] Invariant cache hit.
[2023-03-10 16:49:52] [INFO ] State equation strengthened by 170 read => feed constraints.
[2023-03-10 16:49:52] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
[2023-03-10 16:49:53] [INFO ] Redundant transitions in 604 ms returned []
[2023-03-10 16:49:53] [INFO ] Flow matrix only has 260 transitions (discarded 405 similar events)
[2023-03-10 16:49:53] [INFO ] Invariant cache hit.
[2023-03-10 16:49:53] [INFO ] Dead Transitions using invariants and state equation in 521 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 163/235 places, 665/907 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1898 ms. Remains : 163/235 places, 665/907 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CloudDeployment-PT-7a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s24 1), p1:(AND (EQ s80 1) (EQ s81 1) (EQ s90 1) (EQ s146 1) (EQ s161 1) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-7a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7a-LTLFireability-05 finished in 2041 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(p1)||p0)))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 907/907 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 907/907 (removed 0) transitions.
[2023-03-10 16:49:53] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
// Phase 1: matrix 460 rows 235 cols
[2023-03-10 16:49:53] [INFO ] Computed 28 place invariants in 5 ms
[2023-03-10 16:49:54] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-10 16:49:54] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2023-03-10 16:49:54] [INFO ] Invariant cache hit.
[2023-03-10 16:49:54] [INFO ] State equation strengthened by 225 read => feed constraints.
[2023-03-10 16:49:54] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 1096 ms to find 0 implicit places.
[2023-03-10 16:49:54] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2023-03-10 16:49:54] [INFO ] Invariant cache hit.
[2023-03-10 16:49:55] [INFO ] Dead Transitions using invariants and state equation in 960 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2063 ms. Remains : 235/235 places, 907/907 transitions.
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-7a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(OR (EQ s28 0) (EQ s41 0)), p1:(EQ s38 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2872 ms.
Product exploration explored 100000 steps with 33333 reset in 2904 ms.
Computed a total of 116 stabilizing places and 669 stable transitions
Graph (complete) has 2487 edges and 235 vertex of which 234 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 116 stabilizing places and 669 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 64 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-7a-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-7a-LTLFireability-07 finished in 8149 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 907/907 transitions.
Graph (trivial) has 277 edges and 235 vertex of which 70 / 235 are part of one of the 21 SCC in 1 ms
Free SCC test removed 49 places
Ensure Unique test removed 147 transitions
Reduce isomorphic transitions removed 147 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 179 transition count 697
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 179 transition count 697
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 57 place count 158 transition count 788
Drop transitions removed 140 transitions
Redundant transition composition rules discarded 140 transitions
Iterating global reduction 0 with 140 rules applied. Total rules applied 197 place count 158 transition count 648
Applied a total of 197 rules in 81 ms. Remains 158 /235 variables (removed 77) and now considering 648/907 (removed 259) transitions.
[2023-03-10 16:50:02] [INFO ] Flow matrix only has 250 transitions (discarded 398 similar events)
// Phase 1: matrix 250 rows 158 cols
[2023-03-10 16:50:02] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-10 16:50:02] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-10 16:50:02] [INFO ] Flow matrix only has 250 transitions (discarded 398 similar events)
[2023-03-10 16:50:02] [INFO ] Invariant cache hit.
[2023-03-10 16:50:02] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-03-10 16:50:02] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
[2023-03-10 16:50:03] [INFO ] Redundant transitions in 815 ms returned []
[2023-03-10 16:50:03] [INFO ] Flow matrix only has 250 transitions (discarded 398 similar events)
[2023-03-10 16:50:03] [INFO ] Invariant cache hit.
[2023-03-10 16:50:03] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/235 places, 648/907 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1930 ms. Remains : 158/235 places, 648/907 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-7a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s61 1) (EQ s62 1) (EQ s65 1) (EQ s141 1) (EQ s156 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-7a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7a-LTLFireability-08 finished in 1984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 907/907 transitions.
Graph (trivial) has 275 edges and 235 vertex of which 70 / 235 are part of one of the 21 SCC in 0 ms
Free SCC test removed 49 places
Ensure Unique test removed 147 transitions
Reduce isomorphic transitions removed 147 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 178 transition count 696
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 178 transition count 696
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 57 place count 157 transition count 787
Drop transitions removed 140 transitions
Redundant transition composition rules discarded 140 transitions
Iterating global reduction 0 with 140 rules applied. Total rules applied 197 place count 157 transition count 647
Applied a total of 197 rules in 47 ms. Remains 157 /235 variables (removed 78) and now considering 647/907 (removed 260) transitions.
[2023-03-10 16:50:04] [INFO ] Flow matrix only has 249 transitions (discarded 398 similar events)
// Phase 1: matrix 249 rows 157 cols
[2023-03-10 16:50:04] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-10 16:50:04] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-10 16:50:04] [INFO ] Flow matrix only has 249 transitions (discarded 398 similar events)
[2023-03-10 16:50:04] [INFO ] Invariant cache hit.
[2023-03-10 16:50:04] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 16:50:04] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2023-03-10 16:50:05] [INFO ] Redundant transitions in 893 ms returned []
[2023-03-10 16:50:05] [INFO ] Flow matrix only has 249 transitions (discarded 398 similar events)
[2023-03-10 16:50:05] [INFO ] Invariant cache hit.
[2023-03-10 16:50:05] [INFO ] Dead Transitions using invariants and state equation in 579 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/235 places, 647/907 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1973 ms. Remains : 157/235 places, 647/907 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-7a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s99 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-7a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7a-LTLFireability-09 finished in 2039 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((!p1||X(X(X(!p2)))))))'
Support contains 11 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 907/907 transitions.
Applied a total of 0 rules in 5 ms. Remains 235 /235 variables (removed 0) and now considering 907/907 (removed 0) transitions.
[2023-03-10 16:50:06] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
// Phase 1: matrix 460 rows 235 cols
[2023-03-10 16:50:06] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-10 16:50:06] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-10 16:50:06] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2023-03-10 16:50:06] [INFO ] Invariant cache hit.
[2023-03-10 16:50:06] [INFO ] State equation strengthened by 225 read => feed constraints.
[2023-03-10 16:50:06] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 827 ms to find 0 implicit places.
[2023-03-10 16:50:06] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2023-03-10 16:50:06] [INFO ] Invariant cache hit.
[2023-03-10 16:50:07] [INFO ] Dead Transitions using invariants and state equation in 808 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1641 ms. Remains : 235/235 places, 907/907 transitions.
Stuttering acceptance computed with spot in 607 ms :[(OR (AND (NOT p0) p2) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p2 (NOT p0)), (AND p1 p2), (AND p1 p2), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (OR (AND (NOT p0) p2) (AND p1 p2)), true, p2, p2, p2, (AND (NOT p0) p2), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-7a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 8}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 13}], [{ cond=(AND p0 p1 p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 8}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=1 dest: 13}], [{ cond=(NOT p0), acceptance={} source=2 dest: 11}, { cond=p0, acceptance={} source=2 dest: 12}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 9}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 9}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND p0 p1), acceptance={} source=6 dest: 7}, { cond=(NOT p0), acceptance={} source=6 dest: 10}], [{ cond=(AND p0 p1), acceptance={} source=7 dest: 0}, { cond=(NOT p0), acceptance={} source=7 dest: 11}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 12}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=true, acceptance={} source=9 dest: 10}], [{ cond=true, acceptance={} source=10 dest: 11}], [{ cond=p2, acceptance={} source=11 dest: 8}], [{ cond=(AND (NOT p0) p2), acceptance={} source=12 dest: 8}, { cond=(AND p0 p2), acceptance={} source=12 dest: 13}], [{ cond=(NOT p0), acceptance={} source=13 dest: 8}, { cond=p0, acceptance={} source=13 dest: 13}]], initial=3, aps=[p0:(AND (EQ s27 1) (EQ s28 1) (EQ s41 1) (EQ s218 1) (EQ s233 1)), p1:(AND (EQ s105 1) (EQ s106 1) (EQ s113 1) (EQ s218 1) (EQ s233 1)), p2:(AND (EQ s53 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, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 4268 ms.
Product exploration explored 100000 steps with 50000 reset in 4316 ms.
Computed a total of 116 stabilizing places and 669 stable transitions
Graph (complete) has 2487 edges and 235 vertex of which 234 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 116 stabilizing places and 669 stable transitions
Detected a total of 116/235 stabilizing places and 669/907 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 p1)))
Knowledge based reduction with 9 factoid took 205 ms. Reduced automaton from 14 states, 27 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-7a-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-7a-LTLFireability-11 finished in 11088 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Support contains 6 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 907/907 transitions.
Graph (trivial) has 268 edges and 235 vertex of which 66 / 235 are part of one of the 20 SCC in 1 ms
Free SCC test removed 46 places
Ensure Unique test removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 183 transition count 719
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 183 transition count 719
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -79
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 53 place count 163 transition count 798
Drop transitions removed 128 transitions
Redundant transition composition rules discarded 128 transitions
Iterating global reduction 0 with 128 rules applied. Total rules applied 181 place count 163 transition count 670
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 185 place count 161 transition count 668
Applied a total of 185 rules in 96 ms. Remains 161 /235 variables (removed 74) and now considering 668/907 (removed 239) transitions.
[2023-03-10 16:50:17] [INFO ] Flow matrix only has 262 transitions (discarded 406 similar events)
// Phase 1: matrix 262 rows 161 cols
[2023-03-10 16:50:17] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-10 16:50:17] [INFO ] Implicit Places using invariants in 201 ms returned []
[2023-03-10 16:50:17] [INFO ] Flow matrix only has 262 transitions (discarded 406 similar events)
[2023-03-10 16:50:17] [INFO ] Invariant cache hit.
[2023-03-10 16:50:17] [INFO ] State equation strengthened by 176 read => feed constraints.
[2023-03-10 16:50:18] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
[2023-03-10 16:50:18] [INFO ] Redundant transitions in 830 ms returned []
[2023-03-10 16:50:18] [INFO ] Flow matrix only has 262 transitions (discarded 406 similar events)
[2023-03-10 16:50:18] [INFO ] Invariant cache hit.
[2023-03-10 16:50:19] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/235 places, 668/907 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2372 ms. Remains : 161/235 places, 668/907 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-7a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (NEQ s46 1) (NEQ s47 1) (NEQ s57 1) (NEQ s144 1) (NEQ s159 1)), p0:(EQ s91 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 176 ms.
Product exploration explored 100000 steps with 0 reset in 196 ms.
Computed a total of 95 stabilizing places and 536 stable transitions
Graph (complete) has 2084 edges and 161 vertex of which 160 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 95 stabilizing places and 536 stable transitions
Detected a total of 95/161 stabilizing places and 536/668 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 231 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 135 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) seen :1
Finished Best-First random walk after 796 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=265 )
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 326 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 668/668 transitions.
Applied a total of 0 rules in 29 ms. Remains 161 /161 variables (removed 0) and now considering 668/668 (removed 0) transitions.
[2023-03-10 16:50:20] [INFO ] Flow matrix only has 262 transitions (discarded 406 similar events)
[2023-03-10 16:50:20] [INFO ] Invariant cache hit.
[2023-03-10 16:50:21] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-03-10 16:50:21] [INFO ] Flow matrix only has 262 transitions (discarded 406 similar events)
[2023-03-10 16:50:21] [INFO ] Invariant cache hit.
[2023-03-10 16:50:21] [INFO ] State equation strengthened by 176 read => feed constraints.
[2023-03-10 16:50:21] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
[2023-03-10 16:50:22] [INFO ] Redundant transitions in 699 ms returned []
[2023-03-10 16:50:22] [INFO ] Flow matrix only has 262 transitions (discarded 406 similar events)
[2023-03-10 16:50:22] [INFO ] Invariant cache hit.
[2023-03-10 16:50:22] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1908 ms. Remains : 161/161 places, 668/668 transitions.
Computed a total of 95 stabilizing places and 536 stable transitions
Graph (complete) has 2084 edges and 161 vertex of which 160 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 95 stabilizing places and 536 stable transitions
Detected a total of 95/161 stabilizing places and 536/668 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 263 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 135 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :1
Finished Best-First random walk after 1481 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=370 )
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 325 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 177 ms.
Product exploration explored 100000 steps with 0 reset in 197 ms.
Built C files in :
/tmp/ltsmin16565992134921961690
[2023-03-10 16:50:24] [INFO ] Computing symmetric may disable matrix : 668 transitions.
[2023-03-10 16:50:24] [INFO ] Computation of Complete disable matrix. took 51 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 16:50:24] [INFO ] Computing symmetric may enable matrix : 668 transitions.
[2023-03-10 16:50:24] [INFO ] Computation of Complete enable matrix. took 54 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 16:50:24] [INFO ] Computing Do-Not-Accords matrix : 668 transitions.
[2023-03-10 16:50:24] [INFO ] Computation of Completed DNA matrix. took 57 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 16:50:24] [INFO ] Built C files in 395ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16565992134921961690
Running compilation step : cd /tmp/ltsmin16565992134921961690;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin16565992134921961690;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin16565992134921961690;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 6 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 668/668 transitions.
Applied a total of 0 rules in 29 ms. Remains 161 /161 variables (removed 0) and now considering 668/668 (removed 0) transitions.
[2023-03-10 16:50:27] [INFO ] Flow matrix only has 262 transitions (discarded 406 similar events)
[2023-03-10 16:50:27] [INFO ] Invariant cache hit.
[2023-03-10 16:50:27] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-03-10 16:50:27] [INFO ] Flow matrix only has 262 transitions (discarded 406 similar events)
[2023-03-10 16:50:27] [INFO ] Invariant cache hit.
[2023-03-10 16:50:28] [INFO ] State equation strengthened by 176 read => feed constraints.
[2023-03-10 16:50:28] [INFO ] Implicit Places using invariants and state equation in 616 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
[2023-03-10 16:50:29] [INFO ] Redundant transitions in 611 ms returned []
[2023-03-10 16:50:29] [INFO ] Flow matrix only has 262 transitions (discarded 406 similar events)
[2023-03-10 16:50:29] [INFO ] Invariant cache hit.
[2023-03-10 16:50:29] [INFO ] Dead Transitions using invariants and state equation in 669 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2155 ms. Remains : 161/161 places, 668/668 transitions.
Built C files in :
/tmp/ltsmin17904906837030980274
[2023-03-10 16:50:29] [INFO ] Computing symmetric may disable matrix : 668 transitions.
[2023-03-10 16:50:29] [INFO ] Computation of Complete disable matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 16:50:29] [INFO ] Computing symmetric may enable matrix : 668 transitions.
[2023-03-10 16:50:29] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 16:50:30] [INFO ] Computing Do-Not-Accords matrix : 668 transitions.
[2023-03-10 16:50:30] [INFO ] Computation of Completed DNA matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 16:50:30] [INFO ] Built C files in 240ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17904906837030980274
Running compilation step : cd /tmp/ltsmin17904906837030980274;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin17904906837030980274;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin17904906837030980274;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
[2023-03-10 16:50:33] [INFO ] Flatten gal took : 32 ms
[2023-03-10 16:50:33] [INFO ] Flatten gal took : 30 ms
[2023-03-10 16:50:33] [INFO ] Time to serialize gal into /tmp/LTL15881854370465701776.gal : 7 ms
[2023-03-10 16:50:33] [INFO ] Time to serialize properties into /tmp/LTL13530390379032050496.prop : 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15881854370465701776.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4253424984619198157.hoa' '-atoms' '/tmp/LTL13530390379032050496.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13530390379032050496.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4253424984619198157.hoa
Detected timeout of ITS tools.
[2023-03-10 16:50:48] [INFO ] Flatten gal took : 32 ms
[2023-03-10 16:50:48] [INFO ] Flatten gal took : 32 ms
[2023-03-10 16:50:48] [INFO ] Time to serialize gal into /tmp/LTL14160073703759625594.gal : 6 ms
[2023-03-10 16:50:48] [INFO ] Time to serialize properties into /tmp/LTL5687762871656422698.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14160073703759625594.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5687762871656422698.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F(G("(p165==0)")))||(G("((((p86!=1)||(p88!=1))||((p103!=1)||(p247!=1)))||(p262!=1))"))))
Formula 0 simplified : GF!"(p165==0)" & F!"((((p86!=1)||(p88!=1))||((p103!=1)||(p247!=1)))||(p262!=1))"
Detected timeout of ITS tools.
[2023-03-10 16:51:03] [INFO ] Flatten gal took : 25 ms
[2023-03-10 16:51:03] [INFO ] Applying decomposition
[2023-03-10 16:51:03] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13434675840322979979.txt' '-o' '/tmp/graph13434675840322979979.bin' '-w' '/tmp/graph13434675840322979979.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13434675840322979979.bin' '-l' '-1' '-v' '-w' '/tmp/graph13434675840322979979.weights' '-q' '0' '-e' '0.001'
[2023-03-10 16:51:03] [INFO ] Decomposing Gal with order
[2023-03-10 16:51:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 16:51:03] [INFO ] Removed a total of 1088 redundant transitions.
[2023-03-10 16:51:03] [INFO ] Flatten gal took : 133 ms
[2023-03-10 16:51:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 187 labels/synchronizations in 24 ms.
[2023-03-10 16:51:03] [INFO ] Time to serialize gal into /tmp/LTL1250812780247356734.gal : 9 ms
[2023-03-10 16:51:03] [INFO ] Time to serialize properties into /tmp/LTL14984412001687431711.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1250812780247356734.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14984412001687431711.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F(G("(i5.i1.u35.p165==0)")))||(G("((((u59.p86!=1)||(u59.p88!=1))||((i3.i1.u22.p103!=1)||(u59.p247!=1)))||(u59.p262!=1))"))))
Formula 0 simplified : GF!"(i5.i1.u35.p165==0)" & F!"((((u59.p86!=1)||(u59.p88!=1))||((i3.i1.u22.p103!=1)||(u59.p247!=1)))||(u59.p262!=1))"
Reverse transition relation is NOT exact ! Due to transitions t248, t782, t795, u59.t2, i0.t242, i0.t239, i0.u0.t218.t243, i0.u3.t234, i1.t207, i1.t204, i1...555
Computing Next relation with stutter on 2 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
135 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.42812,51876,1,0,70804,1332,4447,132509,1349,6164,185655
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudDeployment-PT-7a-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CloudDeployment-PT-7a-LTLFireability-12 finished in 48347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 907/907 transitions.
Graph (trivial) has 277 edges and 235 vertex of which 70 / 235 are part of one of the 21 SCC in 1 ms
Free SCC test removed 49 places
Ensure Unique test removed 147 transitions
Reduce isomorphic transitions removed 147 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 179 transition count 697
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 179 transition count 697
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 57 place count 158 transition count 788
Drop transitions removed 140 transitions
Redundant transition composition rules discarded 140 transitions
Iterating global reduction 0 with 140 rules applied. Total rules applied 197 place count 158 transition count 648
Applied a total of 197 rules in 45 ms. Remains 158 /235 variables (removed 77) and now considering 648/907 (removed 259) transitions.
[2023-03-10 16:51:05] [INFO ] Flow matrix only has 250 transitions (discarded 398 similar events)
// Phase 1: matrix 250 rows 158 cols
[2023-03-10 16:51:05] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-10 16:51:05] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-10 16:51:05] [INFO ] Flow matrix only has 250 transitions (discarded 398 similar events)
[2023-03-10 16:51:05] [INFO ] Invariant cache hit.
[2023-03-10 16:51:05] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-03-10 16:51:06] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2023-03-10 16:51:06] [INFO ] Redundant transitions in 611 ms returned []
[2023-03-10 16:51:06] [INFO ] Flow matrix only has 250 transitions (discarded 398 similar events)
[2023-03-10 16:51:06] [INFO ] Invariant cache hit.
[2023-03-10 16:51:07] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/235 places, 648/907 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1607 ms. Remains : 158/235 places, 648/907 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-7a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s46 1) (NEQ s47 1) (NEQ s50 1) (NEQ s141 1) (NEQ s156 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 174 ms.
Product exploration explored 100000 steps with 0 reset in 194 ms.
Computed a total of 95 stabilizing places and 522 stable transitions
Graph (complete) has 2053 edges and 158 vertex of which 157 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 95 stabilizing places and 522 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 230 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 144 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 534213 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :{}
Probabilistic random walk after 534213 steps, saw 88845 distinct states, run finished after 3006 ms. (steps per millisecond=177 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 16:51:10] [INFO ] Flow matrix only has 250 transitions (discarded 398 similar events)
[2023-03-10 16:51:10] [INFO ] Invariant cache hit.
[2023-03-10 16:51:10] [INFO ] [Real]Absence check using 0 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-10 16:51:11] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 16:51:11] [INFO ] [Nat]Absence check using 0 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-10 16:51:11] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 16:51:11] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-03-10 16:51:11] [INFO ] After 53ms SMT Verify possible using 169 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 16:51:11] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-10 16:51:11] [INFO ] After 286ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 648/648 transitions.
Graph (complete) has 1256 edges and 158 vertex of which 157 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 157 transition count 591
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 72 place count 150 transition count 584
Applied a total of 72 rules in 18 ms. Remains 150 /158 variables (removed 8) and now considering 584/648 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 150/158 places, 584/648 transitions.
Incomplete random walk after 10000 steps, including 159 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Finished Best-First random walk after 8010 steps, including 9 resets, run visited all 1 properties in 10 ms. (steps per millisecond=801 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Support contains 5 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 648/648 transitions.
Applied a total of 0 rules in 25 ms. Remains 158 /158 variables (removed 0) and now considering 648/648 (removed 0) transitions.
[2023-03-10 16:51:11] [INFO ] Flow matrix only has 250 transitions (discarded 398 similar events)
[2023-03-10 16:51:11] [INFO ] Invariant cache hit.
[2023-03-10 16:51:11] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-03-10 16:51:11] [INFO ] Flow matrix only has 250 transitions (discarded 398 similar events)
[2023-03-10 16:51:11] [INFO ] Invariant cache hit.
[2023-03-10 16:51:12] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-03-10 16:51:12] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
[2023-03-10 16:51:13] [INFO ] Redundant transitions in 669 ms returned []
[2023-03-10 16:51:13] [INFO ] Flow matrix only has 250 transitions (discarded 398 similar events)
[2023-03-10 16:51:13] [INFO ] Invariant cache hit.
[2023-03-10 16:51:13] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1637 ms. Remains : 158/158 places, 648/648 transitions.
Computed a total of 95 stabilizing places and 522 stable transitions
Graph (complete) has 2053 edges and 158 vertex of which 157 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 95 stabilizing places and 522 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 138 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Finished Best-First random walk after 7828 steps, including 8 resets, run visited all 1 properties in 15 ms. (steps per millisecond=521 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 185 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 171 ms.
Product exploration explored 100000 steps with 0 reset in 197 ms.
Built C files in :
/tmp/ltsmin16771215296250527153
[2023-03-10 16:51:14] [INFO ] Computing symmetric may disable matrix : 648 transitions.
[2023-03-10 16:51:14] [INFO ] Computation of Complete disable matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 16:51:14] [INFO ] Computing symmetric may enable matrix : 648 transitions.
[2023-03-10 16:51:14] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 16:51:14] [INFO ] Computing Do-Not-Accords matrix : 648 transitions.
[2023-03-10 16:51:14] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 16:51:14] [INFO ] Built C files in 221ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16771215296250527153
Running compilation step : cd /tmp/ltsmin16771215296250527153;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin16771215296250527153;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin16771215296250527153;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 648/648 transitions.
Applied a total of 0 rules in 16 ms. Remains 158 /158 variables (removed 0) and now considering 648/648 (removed 0) transitions.
[2023-03-10 16:51:17] [INFO ] Flow matrix only has 250 transitions (discarded 398 similar events)
[2023-03-10 16:51:17] [INFO ] Invariant cache hit.
[2023-03-10 16:51:17] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-10 16:51:17] [INFO ] Flow matrix only has 250 transitions (discarded 398 similar events)
[2023-03-10 16:51:17] [INFO ] Invariant cache hit.
[2023-03-10 16:51:17] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-03-10 16:51:18] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
[2023-03-10 16:51:19] [INFO ] Redundant transitions in 781 ms returned []
[2023-03-10 16:51:19] [INFO ] Flow matrix only has 250 transitions (discarded 398 similar events)
[2023-03-10 16:51:19] [INFO ] Invariant cache hit.
[2023-03-10 16:51:19] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1764 ms. Remains : 158/158 places, 648/648 transitions.
Built C files in :
/tmp/ltsmin8442807084978396800
[2023-03-10 16:51:19] [INFO ] Computing symmetric may disable matrix : 648 transitions.
[2023-03-10 16:51:19] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 16:51:19] [INFO ] Computing symmetric may enable matrix : 648 transitions.
[2023-03-10 16:51:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 16:51:19] [INFO ] Computing Do-Not-Accords matrix : 648 transitions.
[2023-03-10 16:51:19] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 16:51:19] [INFO ] Built C files in 183ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8442807084978396800
Running compilation step : cd /tmp/ltsmin8442807084978396800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8442807084978396800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8442807084978396800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
[2023-03-10 16:51:22] [INFO ] Flatten gal took : 23 ms
[2023-03-10 16:51:22] [INFO ] Flatten gal took : 24 ms
[2023-03-10 16:51:22] [INFO ] Time to serialize gal into /tmp/LTL3895589769215889834.gal : 8 ms
[2023-03-10 16:51:22] [INFO ] Time to serialize properties into /tmp/LTL17598378072475950347.prop : 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3895589769215889834.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14096328672523539654.hoa' '-atoms' '/tmp/LTL17598378072475950347.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17598378072475950347.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14096328672523539654.hoa
Detected timeout of ITS tools.
[2023-03-10 16:51:37] [INFO ] Flatten gal took : 24 ms
[2023-03-10 16:51:37] [INFO ] Flatten gal took : 23 ms
[2023-03-10 16:51:37] [INFO ] Time to serialize gal into /tmp/LTL6702948515805518491.gal : 4 ms
[2023-03-10 16:51:37] [INFO ] Time to serialize properties into /tmp/LTL18343456561051679805.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6702948515805518491.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18343456561051679805.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((((p86!=1)||(p88!=1))||((p92!=1)||(p247!=1)))||(p262!=1))"))))
Formula 0 simplified : GF!"((((p86!=1)||(p88!=1))||((p92!=1)||(p247!=1)))||(p262!=1))"
Detected timeout of ITS tools.
[2023-03-10 16:51:52] [INFO ] Flatten gal took : 26 ms
[2023-03-10 16:51:52] [INFO ] Applying decomposition
[2023-03-10 16:51:52] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1809319142614603799.txt' '-o' '/tmp/graph1809319142614603799.bin' '-w' '/tmp/graph1809319142614603799.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1809319142614603799.bin' '-l' '-1' '-v' '-w' '/tmp/graph1809319142614603799.weights' '-q' '0' '-e' '0.001'
[2023-03-10 16:51:52] [INFO ] Decomposing Gal with order
[2023-03-10 16:51:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 16:51:53] [INFO ] Removed a total of 1103 redundant transitions.
[2023-03-10 16:51:53] [INFO ] Flatten gal took : 118 ms
[2023-03-10 16:51:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 174 labels/synchronizations in 18 ms.
[2023-03-10 16:51:53] [INFO ] Time to serialize gal into /tmp/LTL4835100156874642886.gal : 6 ms
[2023-03-10 16:51:53] [INFO ] Time to serialize properties into /tmp/LTL9743442104925007398.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4835100156874642886.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9743442104925007398.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("((((i4.i1.u23.p86!=1)||(u58.p88!=1))||((i4.i1.u19.p92!=1)||(u58.p247!=1)))||(u58.p262!=1))"))))
Formula 0 simplified : GF!"((((i4.i1.u23.p86!=1)||(u58.p88!=1))||((i4.i1.u19.p92!=1)||(u58.p247!=1)))||(u58.p262!=1))"
Reverse transition relation is NOT exact ! Due to transitions t248, t782, t795, u58.t2, i0.t242, i0.t239, i0.u2.t234, i0.u3.t218.t243, i1.t207, i1.t204, i1...534
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
160 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.66943,60868,1,0,93407,935,3982,197941,1262,3050,178946
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudDeployment-PT-7a-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudDeployment-PT-7a-LTLFireability-13 finished in 49588 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 907/907 transitions.
Graph (trivial) has 276 edges and 235 vertex of which 70 / 235 are part of one of the 21 SCC in 1 ms
Free SCC test removed 49 places
Ensure Unique test removed 147 transitions
Reduce isomorphic transitions removed 147 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 179 transition count 697
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 179 transition count 697
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 57 place count 158 transition count 788
Drop transitions removed 139 transitions
Redundant transition composition rules discarded 139 transitions
Iterating global reduction 0 with 139 rules applied. Total rules applied 196 place count 158 transition count 649
Applied a total of 196 rules in 75 ms. Remains 158 /235 variables (removed 77) and now considering 649/907 (removed 258) transitions.
[2023-03-10 16:51:55] [INFO ] Flow matrix only has 251 transitions (discarded 398 similar events)
// Phase 1: matrix 251 rows 158 cols
[2023-03-10 16:51:55] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-10 16:51:55] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-10 16:51:55] [INFO ] Flow matrix only has 251 transitions (discarded 398 similar events)
[2023-03-10 16:51:55] [INFO ] Invariant cache hit.
[2023-03-10 16:51:55] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-03-10 16:51:55] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
[2023-03-10 16:51:56] [INFO ] Redundant transitions in 620 ms returned []
[2023-03-10 16:51:56] [INFO ] Flow matrix only has 251 transitions (discarded 398 similar events)
[2023-03-10 16:51:56] [INFO ] Invariant cache hit.
[2023-03-10 16:51:57] [INFO ] Dead Transitions using invariants and state equation in 597 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/235 places, 649/907 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1957 ms. Remains : 158/235 places, 649/907 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-7a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s61 0) (EQ s62 0) (EQ s72 0) (EQ s141 0) (EQ s156 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 83 ms.
Product exploration explored 100000 steps with 0 reset in 104 ms.
Computed a total of 95 stabilizing places and 523 stable transitions
Graph (complete) has 2054 edges and 158 vertex of which 157 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 95 stabilizing places and 523 stable transitions
Detected a total of 95/158 stabilizing places and 523/649 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 144 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 84 ms :[(NOT p0), (NOT p0)]
Finished random walk after 7576 steps, including 108 resets, run visited all 1 properties in 51 ms. (steps per millisecond=148 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 312 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 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Support contains 5 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 649/649 transitions.
Applied a total of 0 rules in 26 ms. Remains 158 /158 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2023-03-10 16:51:58] [INFO ] Flow matrix only has 251 transitions (discarded 398 similar events)
[2023-03-10 16:51:58] [INFO ] Invariant cache hit.
[2023-03-10 16:51:58] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-10 16:51:58] [INFO ] Flow matrix only has 251 transitions (discarded 398 similar events)
[2023-03-10 16:51:58] [INFO ] Invariant cache hit.
[2023-03-10 16:51:58] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-03-10 16:51:58] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
[2023-03-10 16:51:59] [INFO ] Redundant transitions in 744 ms returned []
[2023-03-10 16:51:59] [INFO ] Flow matrix only has 251 transitions (discarded 398 similar events)
[2023-03-10 16:51:59] [INFO ] Invariant cache hit.
[2023-03-10 16:52:00] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1919 ms. Remains : 158/158 places, 649/649 transitions.
Computed a total of 95 stabilizing places and 523 stable transitions
Graph (complete) has 2054 edges and 158 vertex of which 157 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 95 stabilizing places and 523 stable transitions
Detected a total of 95/158 stabilizing places and 523/649 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 146 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 68 ms :[(NOT p0), (NOT p0)]
Finished random walk after 727 steps, including 11 resets, run visited all 1 properties in 4 ms. (steps per millisecond=181 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 166 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 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 91 ms.
Product exploration explored 100000 steps with 0 reset in 102 ms.
Built C files in :
/tmp/ltsmin15523781188351032504
[2023-03-10 16:52:00] [INFO ] Computing symmetric may disable matrix : 649 transitions.
[2023-03-10 16:52:00] [INFO ] Computation of Complete disable matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 16:52:00] [INFO ] Computing symmetric may enable matrix : 649 transitions.
[2023-03-10 16:52:00] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 16:52:01] [INFO ] Computing Do-Not-Accords matrix : 649 transitions.
[2023-03-10 16:52:01] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 16:52:01] [INFO ] Built C files in 226ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15523781188351032504
Running compilation step : cd /tmp/ltsmin15523781188351032504;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin15523781188351032504;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin15523781188351032504;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 649/649 transitions.
Applied a total of 0 rules in 28 ms. Remains 158 /158 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2023-03-10 16:52:04] [INFO ] Flow matrix only has 251 transitions (discarded 398 similar events)
[2023-03-10 16:52:04] [INFO ] Invariant cache hit.
[2023-03-10 16:52:04] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-10 16:52:04] [INFO ] Flow matrix only has 251 transitions (discarded 398 similar events)
[2023-03-10 16:52:04] [INFO ] Invariant cache hit.
[2023-03-10 16:52:04] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-03-10 16:52:05] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 814 ms to find 0 implicit places.
[2023-03-10 16:52:05] [INFO ] Redundant transitions in 758 ms returned []
[2023-03-10 16:52:05] [INFO ] Flow matrix only has 251 transitions (discarded 398 similar events)
[2023-03-10 16:52:05] [INFO ] Invariant cache hit.
[2023-03-10 16:52:06] [INFO ] Dead Transitions using invariants and state equation in 687 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2315 ms. Remains : 158/158 places, 649/649 transitions.
Built C files in :
/tmp/ltsmin13523137496732662805
[2023-03-10 16:52:06] [INFO ] Computing symmetric may disable matrix : 649 transitions.
[2023-03-10 16:52:06] [INFO ] Computation of Complete disable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 16:52:06] [INFO ] Computing symmetric may enable matrix : 649 transitions.
[2023-03-10 16:52:06] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 16:52:06] [INFO ] Computing Do-Not-Accords matrix : 649 transitions.
[2023-03-10 16:52:06] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 16:52:06] [INFO ] Built C files in 133ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13523137496732662805
Running compilation step : cd /tmp/ltsmin13523137496732662805;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin13523137496732662805;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin13523137496732662805;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
[2023-03-10 16:52:09] [INFO ] Flatten gal took : 23 ms
[2023-03-10 16:52:09] [INFO ] Flatten gal took : 25 ms
[2023-03-10 16:52:09] [INFO ] Time to serialize gal into /tmp/LTL17476011061117626878.gal : 4 ms
[2023-03-10 16:52:09] [INFO ] Time to serialize properties into /tmp/LTL5397239922866725445.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17476011061117626878.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7441985204594164788.hoa' '-atoms' '/tmp/LTL5397239922866725445.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5397239922866725445.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7441985204594164788.hoa
Detected timeout of ITS tools.
[2023-03-10 16:52:24] [INFO ] Flatten gal took : 23 ms
[2023-03-10 16:52:24] [INFO ] Flatten gal took : 23 ms
[2023-03-10 16:52:24] [INFO ] Time to serialize gal into /tmp/LTL8423871975293775545.gal : 4 ms
[2023-03-10 16:52:24] [INFO ] Time to serialize properties into /tmp/LTL3884708903090661085.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8423871975293775545.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3884708903090661085.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((((p114==0)||(p116==0))||((p136==0)||(p247==0)))||(p262==0))"))))
Formula 0 simplified : FG!"((((p114==0)||(p116==0))||((p136==0)||(p247==0)))||(p262==0))"
Detected timeout of ITS tools.
[2023-03-10 16:52:39] [INFO ] Flatten gal took : 23 ms
[2023-03-10 16:52:39] [INFO ] Applying decomposition
[2023-03-10 16:52:39] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1775684898367460442.txt' '-o' '/tmp/graph1775684898367460442.bin' '-w' '/tmp/graph1775684898367460442.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1775684898367460442.bin' '-l' '-1' '-v' '-w' '/tmp/graph1775684898367460442.weights' '-q' '0' '-e' '0.001'
[2023-03-10 16:52:39] [INFO ] Decomposing Gal with order
[2023-03-10 16:52:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 16:52:40] [INFO ] Removed a total of 1104 redundant transitions.
[2023-03-10 16:52:40] [INFO ] Flatten gal took : 122 ms
[2023-03-10 16:52:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 170 labels/synchronizations in 16 ms.
[2023-03-10 16:52:40] [INFO ] Time to serialize gal into /tmp/LTL16110282656244378695.gal : 5 ms
[2023-03-10 16:52:40] [INFO ] Time to serialize properties into /tmp/LTL15639220291343238687.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16110282656244378695.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15639220291343238687.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("((((i4.i0.u27.p114==0)||(u57.p116==0))||((i4.i0.u28.p136==0)||(u57.p247==0)))||(u57.p262==0))"))))
Formula 0 simplified : FG!"((((i4.i0.u27.p114==0)||(u57.p116==0))||((i4.i0.u28.p136==0)||(u57.p247==0)))||(u57.p262==0))"
Reverse transition relation is NOT exact ! Due to transitions t248, t782, t795, u57.t2, i0.t242, i0.t239, i0.u0.t218.t243, i0.u3.t234, i1.t207, i1.t204, i1...533
Computing Next relation with stutter on 2 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
44 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,0.530952,25736,1,0,17056,930,4310,38380,1316,2693,44116
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudDeployment-PT-7a-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudDeployment-PT-7a-LTLFireability-14 finished in 45664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)&&G(p1)))))'
Support contains 9 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 907/907 transitions.
Applied a total of 0 rules in 5 ms. Remains 235 /235 variables (removed 0) and now considering 907/907 (removed 0) transitions.
[2023-03-10 16:52:40] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
// Phase 1: matrix 460 rows 235 cols
[2023-03-10 16:52:40] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-10 16:52:40] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-10 16:52:40] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2023-03-10 16:52:40] [INFO ] Invariant cache hit.
[2023-03-10 16:52:41] [INFO ] State equation strengthened by 225 read => feed constraints.
[2023-03-10 16:52:41] [INFO ] Implicit Places using invariants and state equation in 737 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
[2023-03-10 16:52:41] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2023-03-10 16:52:41] [INFO ] Invariant cache hit.
[2023-03-10 16:52:42] [INFO ] Dead Transitions using invariants and state equation in 927 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1852 ms. Remains : 235/235 places, 907/907 transitions.
Stuttering acceptance computed with spot in 253 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CloudDeployment-PT-7a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 1}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(AND (EQ s27 1) (EQ s28 1) (EQ s52 1) (EQ s223 1)), p0:(AND (EQ s157 1) (EQ s158 1) (EQ s160 1) (EQ s218 1) (EQ s233 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-7a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7a-LTLFireability-15 finished in 2125 ms.
All properties solved by simple procedures.
Total runtime 271565 ms.
BK_STOP 1678467164014
--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-7a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is CloudDeployment-PT-7a, 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 r069-smll-167814396400444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-7a.tgz
mv CloudDeployment-PT-7a 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 '
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 ;