Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 11 16:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 317K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716262941907

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-6a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 03:42:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 03:42:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 03:42:23] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-05-21 03:42:23] [INFO ] Transformed 221 places.
[2024-05-21 03:42:23] [INFO ] Transformed 908 transitions.
[2024-05-21 03:42:23] [INFO ] Found NUPN structural information;
[2024-05-21 03:42:23] [INFO ] Parsed PT model containing 221 places and 908 transitions and 5517 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 114 transitions
Reduce redundant transitions removed 114 transitions.
FORMULA CloudDeployment-PT-6a-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 794/794 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 209 transition count 794
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 205 transition count 790
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 205 transition count 790
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 202 transition count 787
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 202 transition count 787
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 200 transition count 785
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 200 transition count 785
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 199 transition count 784
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 199 transition count 784
Drop transitions removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 1 with 75 rules applied. Total rules applied 107 place count 199 transition count 709
Applied a total of 107 rules in 58 ms. Remains 199 /221 variables (removed 22) and now considering 709/794 (removed 85) transitions.
[2024-05-21 03:42:23] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2024-05-21 03:42:23] [INFO ] Computed 24 invariants in 24 ms
[2024-05-21 03:42:24] [INFO ] Implicit Places using invariants in 422 ms returned []
[2024-05-21 03:42:24] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 03:42:24] [INFO ] Invariant cache hit.
[2024-05-21 03:42:24] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-21 03:42:24] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
[2024-05-21 03:42:24] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 03:42:24] [INFO ] Invariant cache hit.
[2024-05-21 03:42:24] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 199/221 places, 709/794 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1059 ms. Remains : 199/221 places, 709/794 transitions.
Support contains 42 out of 199 places after structural reductions.
[2024-05-21 03:42:24] [INFO ] Flatten gal took : 81 ms
[2024-05-21 03:42:24] [INFO ] Flatten gal took : 46 ms
[2024-05-21 03:42:25] [INFO ] Input system was already deterministic with 709 transitions.
Incomplete random walk after 10000 steps, including 110 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 30) seen :24
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
[2024-05-21 03:42:25] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 03:42:25] [INFO ] Invariant cache hit.
[2024-05-21 03:42:25] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 6 ms returned sat
[2024-05-21 03:42:25] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-21 03:42:25] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-21 03:42:26] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2024-05-21 03:42:26] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-21 03:42:26] [INFO ] After 54ms SMT Verify possible using 172 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2024-05-21 03:42:26] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2024-05-21 03:42:26] [INFO ] After 312ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 239 edges and 199 vertex of which 60 / 199 are part of one of the 18 SCC in 2 ms
Free SCC test removed 42 places
Drop transitions removed 133 transitions
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 175 transitions.
Graph (complete) has 1053 edges and 157 vertex of which 156 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 8 place count 150 transition count 492
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 150 transition count 492
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 24 place count 145 transition count 487
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 60 place count 127 transition count 553
Drop transitions removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 0 with 108 rules applied. Total rules applied 168 place count 127 transition count 445
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 169 place count 127 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 170 place count 126 transition count 444
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 171 place count 126 transition count 444
Applied a total of 171 rules in 110 ms. Remains 126 /199 variables (removed 73) and now considering 444/709 (removed 265) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 126/199 places, 444/709 transitions.
Finished random walk after 2944 steps, including 43 resets, run visited all 1 properties in 12 ms. (steps per millisecond=245 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CloudDeployment-PT-6a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6a-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 97 stabilizing places and 505 stable transitions
Graph (complete) has 1967 edges and 199 vertex of which 198 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(X(F((G(p2)&&p1)))))))'
Support contains 9 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 4 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2024-05-21 03:42:26] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 03:42:26] [INFO ] Invariant cache hit.
[2024-05-21 03:42:26] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-21 03:42:26] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 03:42:26] [INFO ] Invariant cache hit.
[2024-05-21 03:42:27] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-21 03:42:27] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2024-05-21 03:42:27] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 03:42:27] [INFO ] Invariant cache hit.
[2024-05-21 03:42:27] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 721 ms. Remains : 199/199 places, 709/709 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 341 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))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s79 1) (EQ s80 1) (EQ s104 1) (EQ s183 1)), p1:(AND (EQ s105 1) (EQ s106 1) (EQ s119 1) (EQ s184 1) (EQ s197 1)), p2:(AND (EQ s80 1) (EQ s106 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA CloudDeployment-PT-6a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLFireability-01 finished in 1168 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((G(p1) U (p0&&G(p1)))))))'
Support contains 1 out of 199 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 234 edges and 199 vertex of which 58 / 199 are part of one of the 18 SCC in 1 ms
Free SCC test removed 40 places
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 152 transition count 545
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 152 transition count 545
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 47 place count 135 transition count 610
Drop transitions removed 107 transitions
Redundant transition composition rules discarded 107 transitions
Iterating global reduction 0 with 107 rules applied. Total rules applied 154 place count 135 transition count 503
Applied a total of 154 rules in 95 ms. Remains 135 /199 variables (removed 64) and now considering 503/709 (removed 206) transitions.
[2024-05-21 03:42:27] [INFO ] Flow matrix only has 204 transitions (discarded 299 similar events)
// Phase 1: matrix 204 rows 135 cols
[2024-05-21 03:42:27] [INFO ] Computed 24 invariants in 1 ms
[2024-05-21 03:42:27] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 03:42:27] [INFO ] Flow matrix only has 204 transitions (discarded 299 similar events)
[2024-05-21 03:42:27] [INFO ] Invariant cache hit.
[2024-05-21 03:42:28] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 03:42:28] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2024-05-21 03:42:28] [INFO ] Redundant transitions in 340 ms returned []
[2024-05-21 03:42:28] [INFO ] Flow matrix only has 204 transitions (discarded 299 similar events)
[2024-05-21 03:42:28] [INFO ] Invariant cache hit.
[2024-05-21 03:42:28] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/199 places, 503/709 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1156 ms. Remains : 135/199 places, 503/709 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s84 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 0 ms.
FORMULA CloudDeployment-PT-6a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLFireability-02 finished in 1216 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 5 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 234 edges and 199 vertex of which 58 / 199 are part of one of the 17 SCC in 2 ms
Free SCC test removed 41 places
Ensure Unique test removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 153 transition count 550
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 153 transition count 550
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 45 place count 136 transition count 606
Drop transitions removed 96 transitions
Redundant transition composition rules discarded 96 transitions
Iterating global reduction 0 with 96 rules applied. Total rules applied 141 place count 136 transition count 510
Applied a total of 141 rules in 110 ms. Remains 136 /199 variables (removed 63) and now considering 510/709 (removed 199) transitions.
[2024-05-21 03:42:29] [INFO ] Flow matrix only has 205 transitions (discarded 305 similar events)
// Phase 1: matrix 205 rows 136 cols
[2024-05-21 03:42:29] [INFO ] Computed 24 invariants in 2 ms
[2024-05-21 03:42:29] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-21 03:42:29] [INFO ] Flow matrix only has 205 transitions (discarded 305 similar events)
[2024-05-21 03:42:29] [INFO ] Invariant cache hit.
[2024-05-21 03:42:29] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-05-21 03:42:29] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2024-05-21 03:42:29] [INFO ] Redundant transitions in 315 ms returned []
[2024-05-21 03:42:29] [INFO ] Flow matrix only has 205 transitions (discarded 305 similar events)
[2024-05-21 03:42:29] [INFO ] Invariant cache hit.
[2024-05-21 03:42:30] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 136/199 places, 510/709 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1015 ms. Remains : 136/199 places, 510/709 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s66 1), p1:(OR (AND (EQ s66 1) (EQ s32 1) (EQ s48 1)) (AND (EQ s16 1) (EQ s29 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-6a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLFireability-03 finished in 1095 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U G((p1||F(p2))))))'
Support contains 7 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 5 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2024-05-21 03:42:30] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2024-05-21 03:42:30] [INFO ] Computed 24 invariants in 3 ms
[2024-05-21 03:42:30] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 03:42:30] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 03:42:30] [INFO ] Invariant cache hit.
[2024-05-21 03:42:30] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-21 03:42:30] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2024-05-21 03:42:30] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 03:42:30] [INFO ] Invariant cache hit.
[2024-05-21 03:42:30] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 591 ms. Remains : 199/199 places, 709/709 transitions.
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s143 1), p2:(AND (EQ s105 1) (EQ s106 1) (EQ s127 1) (EQ s184 1) (EQ s197 1)), p0:(AND (EQ s2 1) (EQ s106 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-6a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLFireability-04 finished in 937 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((F(p0)&&(p1||F(p2))))))))'
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 6 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2024-05-21 03:42:31] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 03:42:31] [INFO ] Invariant cache hit.
[2024-05-21 03:42:31] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 03:42:31] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 03:42:31] [INFO ] Invariant cache hit.
[2024-05-21 03:42:31] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-21 03:42:31] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2024-05-21 03:42:31] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 03:42:31] [INFO ] Invariant cache hit.
[2024-05-21 03:42:31] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 663 ms. Remains : 199/199 places, 709/709 transitions.
Stuttering acceptance computed with spot in 316 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 0}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p1:(EQ s64 0), p2:(OR (EQ s2 0) (EQ s80 0)), p0:(EQ s40 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, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 1384 ms.
Product exploration explored 100000 steps with 25000 reset in 1209 ms.
Computed a total of 97 stabilizing places and 505 stable transitions
Graph (complete) has 1967 edges and 199 vertex of which 198 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 97 stabilizing places and 505 stable transitions
Detected a total of 97/199 stabilizing places and 505/709 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), true, (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Finished random walk after 1054 steps, including 13 resets, run visited all 7 properties in 19 ms. (steps per millisecond=55 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2 p0), true, (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p2) p0 (NOT p1))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))), (F (AND (NOT p2) (NOT p1))), (F (NOT p0)), (F (AND (NOT p2) (NOT p0) p1))]
Knowledge based reduction with 3 factoid took 241 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 440 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 3 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2024-05-21 03:42:36] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 03:42:36] [INFO ] Invariant cache hit.
[2024-05-21 03:42:36] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-21 03:42:36] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 03:42:36] [INFO ] Invariant cache hit.
[2024-05-21 03:42:36] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-21 03:42:36] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2024-05-21 03:42:36] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 03:42:36] [INFO ] Invariant cache hit.
[2024-05-21 03:42:36] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 599 ms. Remains : 199/199 places, 709/709 transitions.
Computed a total of 97 stabilizing places and 505 stable transitions
Graph (complete) has 1967 edges and 199 vertex of which 198 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 97 stabilizing places and 505 stable transitions
Detected a total of 97/199 stabilizing places and 505/709 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0), true, (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 110 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :6
Finished Best-First random walk after 1927 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=963 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p1 p0), true, (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p2) p0 (NOT p1))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))), (F (AND (NOT p2) (NOT p1))), (F (NOT p0)), (F (AND (NOT p2) (NOT p0) p1))]
Knowledge based reduction with 3 factoid took 261 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 355 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 378 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 406 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 25000 reset in 1184 ms.
Product exploration explored 100000 steps with 25000 reset in 1169 ms.
Applying partial POR strategy [true, true, true, true, false, false, false]
Stuttering acceptance computed with spot in 312 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 229 edges and 199 vertex of which 59 / 199 are part of one of the 18 SCC in 2 ms
Free SCC test removed 41 places
Ensure Unique test removed 118 transitions
Reduce isomorphic transitions removed 118 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 152 transition count 543
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 152 transition count 543
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -108
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 0 with 18 rules applied. Total rules applied 31 place count 152 transition count 651
Deduced a syphon composed of 18 places in 1 ms
Drop transitions removed 125 transitions
Redundant transition composition rules discarded 125 transitions
Iterating global reduction 0 with 125 rules applied. Total rules applied 156 place count 152 transition count 526
Deduced a syphon composed of 18 places in 0 ms
Applied a total of 156 rules in 40 ms. Remains 152 /199 variables (removed 47) and now considering 526/709 (removed 183) transitions.
[2024-05-21 03:42:41] [INFO ] Redundant transitions in 249 ms returned []
[2024-05-21 03:42:41] [INFO ] Flow matrix only has 227 transitions (discarded 299 similar events)
// Phase 1: matrix 227 rows 152 cols
[2024-05-21 03:42:41] [INFO ] Computed 24 invariants in 2 ms
[2024-05-21 03:42:41] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/199 places, 526/709 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 469 ms. Remains : 152/199 places, 526/709 transitions.
Built C files in :
/tmp/ltsmin2820849139317643708
[2024-05-21 03:42:41] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2820849139317643708
Running compilation step : cd /tmp/ltsmin2820849139317643708;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1230 ms.
Running link step : cd /tmp/ltsmin2820849139317643708;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin2820849139317643708;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16348728877568260733.hoa' '--buchi-type=spotba'
LTSmin run took 215 ms.
FORMULA CloudDeployment-PT-6a-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-6a-LTLFireability-05 finished in 12404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(F(p0))))||(X(!p1) U ((p2&&X(!p1))||X(G(!p1))))))'
Support contains 6 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 3 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2024-05-21 03:42:43] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2024-05-21 03:42:43] [INFO ] Computed 24 invariants in 4 ms
[2024-05-21 03:42:43] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 03:42:43] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 03:42:43] [INFO ] Invariant cache hit.
[2024-05-21 03:42:43] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-21 03:42:43] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2024-05-21 03:42:43] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 03:42:43] [INFO ] Invariant cache hit.
[2024-05-21 03:42:44] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 607 ms. Remains : 199/199 places, 709/709 transitions.
Stuttering acceptance computed with spot in 391 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 8}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 6}, { cond=p1, acceptance={} source=2 dest: 7}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 8}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 8}], [{ cond=p1, acceptance={} source=5 dest: 7}], [{ cond=p1, acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=8 dest: 8}]], initial=1, aps=[p1:(AND (EQ s53 1) (EQ s54 1) (EQ s76 1) (EQ s184 1) (EQ s197 1)), p0:(EQ s197 1), p2:(NEQ s65 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][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1909 ms.
Product exploration explored 100000 steps with 50000 reset in 1910 ms.
Computed a total of 97 stabilizing places and 505 stable transitions
Graph (complete) has 1967 edges and 199 vertex of which 198 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 97 stabilizing places and 505 stable transitions
Detected a total of 97/199 stabilizing places and 505/709 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), true, (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 17 ms. Reduced automaton from 9 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-6a-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-6a-LTLFireability-06 finished in 4863 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 6 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 230 edges and 199 vertex of which 59 / 199 are part of one of the 18 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 118 transitions
Reduce isomorphic transitions removed 118 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 153 transition count 551
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 153 transition count 551
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -55
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 43 place count 137 transition count 606
Drop transitions removed 95 transitions
Redundant transition composition rules discarded 95 transitions
Iterating global reduction 0 with 95 rules applied. Total rules applied 138 place count 137 transition count 511
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 140 place count 136 transition count 510
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 141 place count 136 transition count 510
Applied a total of 141 rules in 57 ms. Remains 136 /199 variables (removed 63) and now considering 510/709 (removed 199) transitions.
[2024-05-21 03:42:48] [INFO ] Flow matrix only has 204 transitions (discarded 306 similar events)
// Phase 1: matrix 204 rows 136 cols
[2024-05-21 03:42:48] [INFO ] Computed 24 invariants in 2 ms
[2024-05-21 03:42:48] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 03:42:48] [INFO ] Flow matrix only has 204 transitions (discarded 306 similar events)
[2024-05-21 03:42:48] [INFO ] Invariant cache hit.
[2024-05-21 03:42:48] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-05-21 03:42:48] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2024-05-21 03:42:48] [INFO ] Redundant transitions in 291 ms returned []
[2024-05-21 03:42:48] [INFO ] Flow matrix only has 204 transitions (discarded 306 similar events)
[2024-05-21 03:42:48] [INFO ] Invariant cache hit.
[2024-05-21 03:42:49] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 136/199 places, 510/709 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 821 ms. Remains : 136/199 places, 510/709 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-08 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 s57 1) (AND (EQ s31 1) (EQ s32 1) (EQ s43 1) (EQ s121 1) (EQ s134 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-6a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLFireability-08 finished in 911 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 5 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 2 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2024-05-21 03:42:49] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2024-05-21 03:42:49] [INFO ] Computed 24 invariants in 4 ms
[2024-05-21 03:42:49] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-21 03:42:49] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 03:42:49] [INFO ] Invariant cache hit.
[2024-05-21 03:42:49] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-21 03:42:49] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2024-05-21 03:42:49] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 03:42:49] [INFO ] Invariant cache hit.
[2024-05-21 03:42:49] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 604 ms. Remains : 199/199 places, 709/709 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s79 1) (EQ s80 1) (EQ s92 1) (EQ s184 1) (EQ s197 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-6a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLFireability-09 finished in 713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 9 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 235 edges and 199 vertex of which 60 / 199 are part of one of the 18 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 151 transition count 541
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 151 transition count 541
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 47 place count 134 transition count 606
Drop transitions removed 104 transitions
Redundant transition composition rules discarded 104 transitions
Iterating global reduction 0 with 104 rules applied. Total rules applied 151 place count 134 transition count 502
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 153 place count 134 transition count 502
Applied a total of 153 rules in 43 ms. Remains 134 /199 variables (removed 65) and now considering 502/709 (removed 207) transitions.
[2024-05-21 03:42:49] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
// Phase 1: matrix 203 rows 134 cols
[2024-05-21 03:42:49] [INFO ] Computed 24 invariants in 1 ms
[2024-05-21 03:42:50] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 03:42:50] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
[2024-05-21 03:42:50] [INFO ] Invariant cache hit.
[2024-05-21 03:42:50] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-05-21 03:42:50] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-05-21 03:42:50] [INFO ] Redundant transitions in 245 ms returned []
[2024-05-21 03:42:50] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
[2024-05-21 03:42:50] [INFO ] Invariant cache hit.
[2024-05-21 03:42:50] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/199 places, 502/709 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 689 ms. Remains : 134/199 places, 502/709 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s32 1) (EQ s33 1) (EQ s46 1) (EQ s116 1)), p0:(OR (EQ s1 0) (EQ s2 0) (EQ s11 0) (EQ s119 0) (EQ s132 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 114 ms.
Product exploration explored 100000 steps with 0 reset in 191 ms.
Computed a total of 80 stabilizing places and 394 stable transitions
Graph (complete) has 1610 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 80 stabilizing places and 394 stable transitions
Detected a total of 80/134 stabilizing places and 394/502 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 245 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 4207 steps, including 69 resets, run visited all 3 properties in 17 ms. (steps per millisecond=247 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 208 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 9 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 502/502 transitions.
Applied a total of 0 rules in 18 ms. Remains 134 /134 variables (removed 0) and now considering 502/502 (removed 0) transitions.
[2024-05-21 03:42:51] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
[2024-05-21 03:42:51] [INFO ] Invariant cache hit.
[2024-05-21 03:42:51] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 03:42:51] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
[2024-05-21 03:42:51] [INFO ] Invariant cache hit.
[2024-05-21 03:42:51] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-05-21 03:42:52] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2024-05-21 03:42:52] [INFO ] Redundant transitions in 248 ms returned []
[2024-05-21 03:42:52] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
[2024-05-21 03:42:52] [INFO ] Invariant cache hit.
[2024-05-21 03:42:52] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 707 ms. Remains : 134/134 places, 502/502 transitions.
Computed a total of 80 stabilizing places and 394 stable transitions
Graph (complete) has 1610 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 80 stabilizing places and 394 stable transitions
Detected a total of 80/134 stabilizing places and 394/502 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 156 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2024-05-21 03:42:52] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
[2024-05-21 03:42:52] [INFO ] Invariant cache hit.
[2024-05-21 03:42:52] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned sat
[2024-05-21 03:42:52] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 03:42:52] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 3 ms returned sat
[2024-05-21 03:42:53] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 03:42:53] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-05-21 03:42:53] [INFO ] After 39ms SMT Verify possible using 130 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 03:42:53] [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 14 ms.
[2024-05-21 03:42:53] [INFO ] After 164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 502/502 transitions.
Graph (complete) has 972 edges and 134 vertex of which 133 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 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 133 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 132 transition count 452
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 62 place count 127 transition count 447
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 127 transition count 445
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 127 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 126 transition count 444
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 126 transition count 444
Applied a total of 67 rules in 47 ms. Remains 126 /134 variables (removed 8) and now considering 444/502 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 126/134 places, 444/502 transitions.
Finished random walk after 1979 steps, including 32 resets, run visited all 1 properties in 7 ms. (steps per millisecond=282 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 222 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 112 ms.
Product exploration explored 100000 steps with 0 reset in 200 ms.
Built C files in :
/tmp/ltsmin6070211965310800031
[2024-05-21 03:42:53] [INFO ] Computing symmetric may disable matrix : 502 transitions.
[2024-05-21 03:42:53] [INFO ] Computation of Complete disable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:42:54] [INFO ] Computing symmetric may enable matrix : 502 transitions.
[2024-05-21 03:42:54] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:42:54] [INFO ] Computing Do-Not-Accords matrix : 502 transitions.
[2024-05-21 03:42:54] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:42:54] [INFO ] Built C files in 116ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6070211965310800031
Running compilation step : cd /tmp/ltsmin6070211965310800031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1244 ms.
Running link step : cd /tmp/ltsmin6070211965310800031;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin6070211965310800031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15220099901459748004.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 9 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 502/502 transitions.
Applied a total of 0 rules in 16 ms. Remains 134 /134 variables (removed 0) and now considering 502/502 (removed 0) transitions.
[2024-05-21 03:43:09] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
[2024-05-21 03:43:09] [INFO ] Invariant cache hit.
[2024-05-21 03:43:09] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 03:43:09] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
[2024-05-21 03:43:09] [INFO ] Invariant cache hit.
[2024-05-21 03:43:09] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-05-21 03:43:09] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2024-05-21 03:43:09] [INFO ] Redundant transitions in 297 ms returned []
[2024-05-21 03:43:09] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
[2024-05-21 03:43:09] [INFO ] Invariant cache hit.
[2024-05-21 03:43:09] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 751 ms. Remains : 134/134 places, 502/502 transitions.
Built C files in :
/tmp/ltsmin2073185350491855226
[2024-05-21 03:43:09] [INFO ] Computing symmetric may disable matrix : 502 transitions.
[2024-05-21 03:43:09] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:43:09] [INFO ] Computing symmetric may enable matrix : 502 transitions.
[2024-05-21 03:43:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:43:09] [INFO ] Computing Do-Not-Accords matrix : 502 transitions.
[2024-05-21 03:43:09] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:43:09] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2073185350491855226
Running compilation step : cd /tmp/ltsmin2073185350491855226;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1254 ms.
Running link step : cd /tmp/ltsmin2073185350491855226;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin2073185350491855226;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4771455438310571280.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 03:43:24] [INFO ] Flatten gal took : 28 ms
[2024-05-21 03:43:24] [INFO ] Flatten gal took : 27 ms
[2024-05-21 03:43:24] [INFO ] Time to serialize gal into /tmp/LTL17054373948066339699.gal : 4 ms
[2024-05-21 03:43:24] [INFO ] Time to serialize properties into /tmp/LTL1179607935654659943.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17054373948066339699.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3385519727124663162.hoa' '-atoms' '/tmp/LTL1179607935654659943.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1179607935654659943.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3385519727124663162.hoa
Reverse transition relation is NOT exact ! Due to transitions t2, t24, t29, t32, t59, t64, t67, t94, t99, t102, t129, t134, t137, t164, t169, t172, t199, t...360
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2024-05-21 03:43:40] [INFO ] Flatten gal took : 24 ms
[2024-05-21 03:43:40] [INFO ] Flatten gal took : 22 ms
[2024-05-21 03:43:40] [INFO ] Time to serialize gal into /tmp/LTL16732720971167480755.gal : 4 ms
[2024-05-21 03:43:40] [INFO ] Time to serialize properties into /tmp/LTL6580309752774595180.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16732720971167480755.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6580309752774595180.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G("((((p2==0)||(p4==0))||((p22==0)||(p206==0)))||(p219==0))"))||(F("(((p58==1)&&(p60==1))&&((p84==1)&&(p199==1)))"))))
Formula 0 simplified : F!"((((p2==0)||(p4==0))||((p22==0)||(p206==0)))||(p219==0))" & G!"(((p58==1)&&(p60==1))&&((p84==1)&&(p199==1)))"
Reverse transition relation is NOT exact ! Due to transitions t2, t24, t29, t32, t59, t64, t67, t94, t99, t102, t129, t134, t137, t164, t169, t172, t199, t...360
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2024-05-21 03:43:55] [INFO ] Flatten gal took : 20 ms
[2024-05-21 03:43:55] [INFO ] Applying decomposition
[2024-05-21 03:43:55] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8726219470613659667.txt' '-o' '/tmp/graph8726219470613659667.bin' '-w' '/tmp/graph8726219470613659667.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8726219470613659667.bin' '-l' '-1' '-v' '-w' '/tmp/graph8726219470613659667.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:43:55] [INFO ] Decomposing Gal with order
[2024-05-21 03:43:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:43:55] [INFO ] Removed a total of 801 redundant transitions.
[2024-05-21 03:43:55] [INFO ] Flatten gal took : 113 ms
[2024-05-21 03:43:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 12 ms.
[2024-05-21 03:43:55] [INFO ] Time to serialize gal into /tmp/LTL11682690538042711920.gal : 5 ms
[2024-05-21 03:43:55] [INFO ] Time to serialize properties into /tmp/LTL7882123466837343499.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11682690538042711920.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7882123466837343499.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G("((((u46.p2==0)||(u46.p4==0))||((i0.u2.p22==0)||(u46.p206==0)))||(u46.p219==0))"))||(F("(((i2.u14.p58==1)&&(u46.p60==1))&&((i2.u...187
Formula 0 simplified : F!"((((u46.p2==0)||(u46.p4==0))||((i0.u2.p22==0)||(u46.p206==0)))||(u46.p219==0))" & G!"(((i2.u14.p58==1)&&(u46.p60==1))&&((i2.u14.p...179
Reverse transition relation is NOT exact ! Due to transitions t213, t617, t628, u46.t2, i0.t207, i0.t199, i0.u2.t204, i0.u2.t183.t208, i0.u2.t181.t209.t208...507
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
60 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.636782,44648,1,0,55653,1336,3665,120554,1176,5550,122400
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudDeployment-PT-6a-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudDeployment-PT-6a-LTLFireability-10 finished in 66204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(((X(F(!p1))&&(!p2 U (G(!p2)||(!p2&&G(!p3)))))||G(F(!p1)))))))'
Support contains 8 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 5 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2024-05-21 03:43:56] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2024-05-21 03:43:56] [INFO ] Computed 24 invariants in 4 ms
[2024-05-21 03:43:56] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-21 03:43:56] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 03:43:56] [INFO ] Invariant cache hit.
[2024-05-21 03:43:56] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-21 03:43:56] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-05-21 03:43:56] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 03:43:56] [INFO ] Invariant cache hit.
[2024-05-21 03:43:56] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 576 ms. Remains : 199/199 places, 709/709 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p0) p1), p1, (AND p1 p2 p3), p1, (AND p1 p2), (AND p1 p3), (AND p1 p3)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 p1) (AND p0 (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p2), acceptance={} source=0 dest: 3}, { cond=(AND p0 p3 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p3 p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p3 p2), acceptance={} source=2 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 5}], [{ cond=(OR p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(OR (AND p1 p3) (AND p3 (NOT p2))), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p3 p2), acceptance={} source=5 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND p1 p3), acceptance={} source=6 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s53 0) (EQ s54 0) (EQ s72 0) (EQ s184 0) (EQ s197 0)), p1:(AND (EQ s53 1) (EQ s54 1) (EQ s72 1) (EQ s184 1) (EQ s197 1) (EQ s28 1) (EQ s79 1)),...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 104 ms.
Product exploration explored 100000 steps with 0 reset in 115 ms.
Computed a total of 97 stabilizing places and 505 stable transitions
Graph (complete) has 1967 edges and 199 vertex of which 198 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 97 stabilizing places and 505 stable transitions
Detected a total of 97/199 stabilizing places and 505/709 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X p2), (X (AND (NOT p3) p2)), (X (NOT (AND p1 p2))), (X (AND p0 p2)), (X (NOT (AND p3 (NOT p2)))), (X p0), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (OR p1 (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND p3 p2))), (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2))))), (X (NOT (AND p1 p3 p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (OR (AND p1 p3) (AND p3 (NOT p2)))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p3 (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (OR p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2)))))), (X (X (NOT (AND p1 p3 p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 33 factoid took 1217 ms. Reduced automaton from 7 states, 27 edges and 4 AP (stutter sensitive) to 7 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[(AND p1 p2 p3), p1, (AND p1 p2 p3), p1, (AND p1 p2), (AND p1 p3), (AND p1 p3)]
Incomplete random walk after 10000 steps, including 117 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
[2024-05-21 03:43:59] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 03:43:59] [INFO ] Invariant cache hit.
[2024-05-21 03:43:59] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 6 ms returned sat
[2024-05-21 03:43:59] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 03:43:59] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 6 ms returned sat
[2024-05-21 03:43:59] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 03:43:59] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-21 03:43:59] [INFO ] After 38ms SMT Verify possible using 172 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 03:43:59] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-21 03:43:59] [INFO ] After 238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 237 edges and 199 vertex of which 58 / 199 are part of one of the 18 SCC in 0 ms
Free SCC test removed 40 places
Drop transitions removed 129 transitions
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 170 transitions.
Graph (complete) has 1063 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 8 place count 152 transition count 497
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 152 transition count 497
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 26 place count 146 transition count 491
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 62 place count 128 transition count 557
Drop transitions removed 109 transitions
Redundant transition composition rules discarded 109 transitions
Iterating global reduction 0 with 109 rules applied. Total rules applied 171 place count 128 transition count 448
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 172 place count 128 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 173 place count 127 transition count 449
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 174 place count 127 transition count 448
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 175 place count 127 transition count 448
Applied a total of 175 rules in 45 ms. Remains 127 /199 variables (removed 72) and now considering 448/709 (removed 261) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 127/199 places, 448/709 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1119805 steps, run timeout after 3001 ms. (steps per millisecond=373 ) properties seen :{}
Probabilistic random walk after 1119805 steps, saw 197243 distinct states, run finished after 3002 ms. (steps per millisecond=373 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 03:44:02] [INFO ] Flow matrix only has 196 transitions (discarded 252 similar events)
// Phase 1: matrix 196 rows 127 cols
[2024-05-21 03:44:02] [INFO ] Computed 24 invariants in 2 ms
[2024-05-21 03:44:02] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-21 03:44:02] [INFO ] [Real]Absence check using 6 positive and 18 generalized place invariants in 4 ms returned sat
[2024-05-21 03:44:02] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 03:44:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-21 03:44:02] [INFO ] [Nat]Absence check using 6 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-21 03:44:02] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 03:44:02] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-21 03:44:02] [INFO ] After 26ms SMT Verify possible using 131 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 03:44:03] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 2 ms to minimize.
[2024-05-21 03:44:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 95 ms
[2024-05-21 03:44:03] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2024-05-21 03:44:03] [INFO ] After 228ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X p2), (X (AND (NOT p3) p2)), (X (NOT (AND p1 p2))), (X (AND p0 p2)), (X (NOT (AND p3 (NOT p2)))), (X p0), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (OR p1 (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND p3 p2))), (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2))))), (X (NOT (AND p1 p3 p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (OR (AND p1 p3) (AND p3 (NOT p2)))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p3 (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (OR p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2)))))), (X (X (NOT (AND p1 p3 p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p2) p3)))]
False Knowledge obtained : [(F (AND p1 p2)), (F p2), (F (OR (AND p1 p3) (AND (NOT p2) p3))), (F (AND p2 p3)), (F (NOT (OR p1 (NOT p2)))), (F (AND p2 (NOT p3))), (F p1), (F (NOT (AND (NOT p2) (NOT p3)))), (F (AND p1 p2 p3)), (F (AND p1 (NOT p3))), (F (AND p1 p3))]
Knowledge based reduction with 34 factoid took 4204 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND p1 p3), p1, (AND p1 p3), p1]
Stuttering acceptance computed with spot in 165 ms :[(AND p1 p3), p1, (AND p1 p3), p1]
Support contains 8 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 3 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2024-05-21 03:44:07] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2024-05-21 03:44:07] [INFO ] Computed 24 invariants in 4 ms
[2024-05-21 03:44:07] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 03:44:07] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 03:44:07] [INFO ] Invariant cache hit.
[2024-05-21 03:44:07] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-21 03:44:07] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-05-21 03:44:07] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 03:44:07] [INFO ] Invariant cache hit.
[2024-05-21 03:44:08] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 545 ms. Remains : 199/199 places, 709/709 transitions.
Computed a total of 97 stabilizing places and 505 stable transitions
Graph (complete) has 1967 edges and 199 vertex of which 198 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 97 stabilizing places and 505 stable transitions
Detected a total of 97/199 stabilizing places and 505/709 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2)), (X (NOT p3)), (X (NOT (AND p3 p1))), (X (X (NOT (OR (NOT p2) p1)))), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND p3 p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 235 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND p1 p3), p1, (AND p1 p3), p1]
Incomplete random walk after 10000 steps, including 111 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 03:44:08] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 03:44:08] [INFO ] Invariant cache hit.
[2024-05-21 03:44:08] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-21 03:44:08] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 03:44:08] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-21 03:44:08] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 03:44:08] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-21 03:44:08] [INFO ] After 41ms SMT Verify possible using 172 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 03:44:08] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-21 03:44:09] [INFO ] After 241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 8 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 233 edges and 199 vertex of which 58 / 199 are part of one of the 18 SCC in 0 ms
Free SCC test removed 40 places
Drop transitions removed 129 transitions
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 170 transitions.
Graph (complete) has 1063 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 8 place count 152 transition count 497
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 152 transition count 497
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 26 place count 146 transition count 491
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 60 place count 129 transition count 556
Drop transitions removed 107 transitions
Redundant transition composition rules discarded 107 transitions
Iterating global reduction 0 with 107 rules applied. Total rules applied 167 place count 129 transition count 449
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 168 place count 129 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 169 place count 128 transition count 448
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 170 place count 128 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 171 place count 127 transition count 449
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 127 transition count 448
Applied a total of 172 rules in 45 ms. Remains 127 /199 variables (removed 72) and now considering 448/709 (removed 261) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 127/199 places, 448/709 transitions.
Incomplete random walk after 10000 steps, including 180 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Finished Best-First random walk after 7166 steps, including 11 resets, run visited all 1 properties in 6 ms. (steps per millisecond=1194 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2)), (X (NOT p3)), (X (NOT (AND p3 p1))), (X (X (NOT (OR (NOT p2) p1)))), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND p3 p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2), (F (NOT (OR (NOT p2) p1))), (F p1), (F p3), (F (AND p3 p1))]
Knowledge based reduction with 10 factoid took 579 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND p1 p3), p1, (AND p1 p3), p1]
Stuttering acceptance computed with spot in 146 ms :[(AND p1 p3), p1, (AND p1 p3), p1]
Stuttering acceptance computed with spot in 201 ms :[(AND p1 p3), p1, (AND p1 p3), p1]
Product exploration explored 100000 steps with 0 reset in 66 ms.
Product exploration explored 100000 steps with 0 reset in 74 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 173 ms :[(AND p1 p3), p1, (AND p1 p3), p1]
Support contains 8 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 233 edges and 199 vertex of which 58 / 199 are part of one of the 18 SCC in 1 ms
Free SCC test removed 40 places
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 153 transition count 546
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 153 transition count 546
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -104
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 0 with 17 rules applied. Total rules applied 30 place count 153 transition count 650
Deduced a syphon composed of 17 places in 0 ms
Drop transitions removed 121 transitions
Redundant transition composition rules discarded 121 transitions
Iterating global reduction 0 with 121 rules applied. Total rules applied 151 place count 153 transition count 529
Deduced a syphon composed of 17 places in 0 ms
Applied a total of 151 rules in 29 ms. Remains 153 /199 variables (removed 46) and now considering 529/709 (removed 180) transitions.
[2024-05-21 03:44:10] [INFO ] Redundant transitions in 281 ms returned []
[2024-05-21 03:44:10] [INFO ] Flow matrix only has 230 transitions (discarded 299 similar events)
// Phase 1: matrix 230 rows 153 cols
[2024-05-21 03:44:10] [INFO ] Computed 24 invariants in 1 ms
[2024-05-21 03:44:11] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/199 places, 529/709 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 490 ms. Remains : 153/199 places, 529/709 transitions.
Built C files in :
/tmp/ltsmin9226855950996740126
[2024-05-21 03:44:11] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9226855950996740126
Running compilation step : cd /tmp/ltsmin9226855950996740126;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1148 ms.
Running link step : cd /tmp/ltsmin9226855950996740126;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9226855950996740126;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3990022969727043139.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 5 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2024-05-21 03:44:26] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2024-05-21 03:44:26] [INFO ] Computed 24 invariants in 4 ms
[2024-05-21 03:44:26] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 03:44:26] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 03:44:26] [INFO ] Invariant cache hit.
[2024-05-21 03:44:26] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-21 03:44:26] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2024-05-21 03:44:26] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 03:44:26] [INFO ] Invariant cache hit.
[2024-05-21 03:44:26] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 591 ms. Remains : 199/199 places, 709/709 transitions.
Built C files in :
/tmp/ltsmin7106684212543452315
[2024-05-21 03:44:26] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7106684212543452315
Running compilation step : cd /tmp/ltsmin7106684212543452315;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1249 ms.
Running link step : cd /tmp/ltsmin7106684212543452315;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin7106684212543452315;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7704661972725326983.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 03:44:41] [INFO ] Flatten gal took : 28 ms
[2024-05-21 03:44:41] [INFO ] Flatten gal took : 26 ms
[2024-05-21 03:44:41] [INFO ] Time to serialize gal into /tmp/LTL3004905862107358357.gal : 4 ms
[2024-05-21 03:44:41] [INFO ] Time to serialize properties into /tmp/LTL2278775647744925253.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3004905862107358357.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7926252881769045539.hoa' '-atoms' '/tmp/LTL2278775647744925253.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2278775647744925253.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7926252881769045539.hoa
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t16, t24, t29, t32, t33, t36, t38, t51, t59, t64, t67, t68, t71, t73, t86, t94, t99, ...453
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2024-05-21 03:44:57] [INFO ] Flatten gal took : 24 ms
[2024-05-21 03:44:57] [INFO ] Flatten gal took : 23 ms
[2024-05-21 03:44:57] [INFO ] Time to serialize gal into /tmp/LTL9950637767101717565.gal : 5 ms
[2024-05-21 03:44:57] [INFO ] Time to serialize properties into /tmp/LTL2612357693779262516.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9950637767101717565.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2612357693779262516.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((F((G(F("((((p58!=1)||(p60!=1))||((p78!=1)||(p206!=1)))||(((p219!=1)||(p32!=1))||(p86!=1)))")))||((X(F("((((p58!=1)||(p60!=1))||(...399
Formula 0 simplified : G(!"((((p58==0)||(p60==0))||((p78==0)||(p206==0)))||(p219==0))" | G(FG!"((((p58!=1)||(p60!=1))||((p78!=1)||(p206!=1)))||(((p219!=1)|...315
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t16, t24, t29, t32, t33, t36, t38, t51, t59, t64, t67, t68, t71, t73, t86, t94, t99, ...453
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2024-05-21 03:45:12] [INFO ] Flatten gal took : 22 ms
[2024-05-21 03:45:12] [INFO ] Applying decomposition
[2024-05-21 03:45:12] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13475172029256003025.txt' '-o' '/tmp/graph13475172029256003025.bin' '-w' '/tmp/graph13475172029256003025.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13475172029256003025.bin' '-l' '-1' '-v' '-w' '/tmp/graph13475172029256003025.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:45:12] [INFO ] Decomposing Gal with order
[2024-05-21 03:45:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:45:12] [INFO ] Removed a total of 822 redundant transitions.
[2024-05-21 03:45:12] [INFO ] Flatten gal took : 77 ms
[2024-05-21 03:45:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 266 labels/synchronizations in 12 ms.
[2024-05-21 03:45:12] [INFO ] Time to serialize gal into /tmp/LTL17645903896705011205.gal : 5 ms
[2024-05-21 03:45:12] [INFO ] Time to serialize properties into /tmp/LTL16517615003288401645.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17645903896705011205.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16517615003288401645.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((F((G(F("((((i8.u53.p58!=1)||(i8.u53.p60!=1))||((i2.i1.u19.p78!=1)||(i8.u53.p206!=1)))||(((i8.u53.p219!=1)||(i8.u53.p32!=1))||(i8...593
Formula 0 simplified : G(!"((((i8.u53.p58==0)||(i8.u53.p60==0))||((i2.i1.u19.p78==0)||(i8.u53.p206==0)))||(i8.u53.p219==0))" | G(FG!"((((i8.u53.p58!=1)||(i...481
Reverse transition relation is NOT exact ! Due to transitions t213, t617, t628, i0.t208, i0.t207, i0.t191, i0.i0.t199, i0.i0.t204, i0.i0.u4.t580, i0.i1.t17...742
Computing Next relation with stutter on 2 deadlock states
6 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
80 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.860188,56792,1,0,71104,2280,4376,138811,1380,12132,122249
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudDeployment-PT-6a-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudDeployment-PT-6a-LTLFireability-12 finished in 77289 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 3 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 5 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2024-05-21 03:45:13] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 03:45:13] [INFO ] Invariant cache hit.
[2024-05-21 03:45:13] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-21 03:45:13] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 03:45:13] [INFO ] Invariant cache hit.
[2024-05-21 03:45:13] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-21 03:45:13] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2024-05-21 03:45:13] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 03:45:13] [INFO ] Invariant cache hit.
[2024-05-21 03:45:14] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 643 ms. Remains : 199/199 places, 709/709 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (EQ s54 0) (EQ s132 0)), p0:(EQ s13 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-6a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLFireability-13 finished in 782 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p1)||p0)))'
Support contains 9 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 235 edges and 199 vertex of which 60 / 199 are part of one of the 18 SCC in 0 ms
Free SCC test removed 42 places
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 151 transition count 541
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 151 transition count 541
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 49 place count 133 transition count 607
Drop transitions removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 0 with 108 rules applied. Total rules applied 157 place count 133 transition count 499
Applied a total of 157 rules in 24 ms. Remains 133 /199 variables (removed 66) and now considering 499/709 (removed 210) transitions.
[2024-05-21 03:45:14] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
// Phase 1: matrix 200 rows 133 cols
[2024-05-21 03:45:14] [INFO ] Computed 24 invariants in 6 ms
[2024-05-21 03:45:14] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 03:45:14] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2024-05-21 03:45:14] [INFO ] Invariant cache hit.
[2024-05-21 03:45:14] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-05-21 03:45:14] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2024-05-21 03:45:14] [INFO ] Redundant transitions in 253 ms returned []
[2024-05-21 03:45:14] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2024-05-21 03:45:14] [INFO ] Invariant cache hit.
[2024-05-21 03:45:14] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/199 places, 499/709 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 709 ms. Remains : 133/199 places, 499/709 transitions.
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(OR (NEQ s16 1) (NEQ s17 1) (NEQ s30 1) (NEQ s119 1)), p0:(OR (NEQ s61 1) (NEQ s62 1) (NEQ s65 1) (NEQ s118 1) (NEQ s131 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 108 ms.
Product exploration explored 100000 steps with 0 reset in 99 ms.
Computed a total of 79 stabilizing places and 391 stable transitions
Graph (complete) has 1607 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 79 stabilizing places and 391 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 9 factoid took 152 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 155 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2024-05-21 03:45:15] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2024-05-21 03:45:15] [INFO ] Invariant cache hit.
[2024-05-21 03:45:15] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned sat
[2024-05-21 03:45:15] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F (NOT p1)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 10 factoid took 252 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 9 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 499/499 transitions.
Applied a total of 0 rules in 9 ms. Remains 133 /133 variables (removed 0) and now considering 499/499 (removed 0) transitions.
[2024-05-21 03:45:16] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2024-05-21 03:45:16] [INFO ] Invariant cache hit.
[2024-05-21 03:45:16] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 03:45:16] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2024-05-21 03:45:16] [INFO ] Invariant cache hit.
[2024-05-21 03:45:16] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-05-21 03:45:16] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2024-05-21 03:45:16] [INFO ] Redundant transitions in 280 ms returned []
[2024-05-21 03:45:16] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2024-05-21 03:45:16] [INFO ] Invariant cache hit.
[2024-05-21 03:45:16] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 728 ms. Remains : 133/133 places, 499/499 transitions.
Computed a total of 79 stabilizing places and 391 stable transitions
Graph (complete) has 1607 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 79 stabilizing places and 391 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 9 factoid took 136 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 163 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2024-05-21 03:45:17] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2024-05-21 03:45:17] [INFO ] Invariant cache hit.
[2024-05-21 03:45:17] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned sat
[2024-05-21 03:45:17] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F (NOT p1)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 10 factoid took 223 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 62 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 103 ms.
Product exploration explored 100000 steps with 0 reset in 110 ms.
Built C files in :
/tmp/ltsmin10333856026985913347
[2024-05-21 03:45:17] [INFO ] Computing symmetric may disable matrix : 499 transitions.
[2024-05-21 03:45:17] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:45:17] [INFO ] Computing symmetric may enable matrix : 499 transitions.
[2024-05-21 03:45:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:45:17] [INFO ] Computing Do-Not-Accords matrix : 499 transitions.
[2024-05-21 03:45:17] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:45:17] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10333856026985913347
Running compilation step : cd /tmp/ltsmin10333856026985913347;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1316 ms.
Running link step : cd /tmp/ltsmin10333856026985913347;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin10333856026985913347;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16713160399745356702.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 9 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 499/499 transitions.
Applied a total of 0 rules in 13 ms. Remains 133 /133 variables (removed 0) and now considering 499/499 (removed 0) transitions.
[2024-05-21 03:45:32] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2024-05-21 03:45:32] [INFO ] Invariant cache hit.
[2024-05-21 03:45:33] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 03:45:33] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2024-05-21 03:45:33] [INFO ] Invariant cache hit.
[2024-05-21 03:45:33] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-05-21 03:45:33] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2024-05-21 03:45:33] [INFO ] Redundant transitions in 246 ms returned []
[2024-05-21 03:45:33] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2024-05-21 03:45:33] [INFO ] Invariant cache hit.
[2024-05-21 03:45:33] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 694 ms. Remains : 133/133 places, 499/499 transitions.
Built C files in :
/tmp/ltsmin1607164383660975329
[2024-05-21 03:45:33] [INFO ] Computing symmetric may disable matrix : 499 transitions.
[2024-05-21 03:45:33] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:45:33] [INFO ] Computing symmetric may enable matrix : 499 transitions.
[2024-05-21 03:45:33] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:45:33] [INFO ] Computing Do-Not-Accords matrix : 499 transitions.
[2024-05-21 03:45:33] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:45:33] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1607164383660975329
Running compilation step : cd /tmp/ltsmin1607164383660975329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1239 ms.
Running link step : cd /tmp/ltsmin1607164383660975329;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin1607164383660975329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased287170718930545333.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 03:45:48] [INFO ] Flatten gal took : 17 ms
[2024-05-21 03:45:48] [INFO ] Flatten gal took : 16 ms
[2024-05-21 03:45:48] [INFO ] Time to serialize gal into /tmp/LTL11478997345413235625.gal : 4 ms
[2024-05-21 03:45:48] [INFO ] Time to serialize properties into /tmp/LTL11183470137735557193.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11478997345413235625.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3592867785651711746.hoa' '-atoms' '/tmp/LTL11183470137735557193.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11183470137735557193.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3592867785651711746.hoa
Reverse transition relation is NOT exact ! Due to transitions t2, t24, t29, t32, t59, t64, t67, t94, t99, t102, t129, t134, t137, t164, t169, t172, t199, t...344
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2024-05-21 03:46:03] [INFO ] Flatten gal took : 19 ms
[2024-05-21 03:46:03] [INFO ] Flatten gal took : 16 ms
[2024-05-21 03:46:03] [INFO ] Time to serialize gal into /tmp/LTL17597178672651231197.gal : 3 ms
[2024-05-21 03:46:03] [INFO ] Time to serialize properties into /tmp/LTL11060683752561001985.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17597178672651231197.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11060683752561001985.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(("(((p114!=1)||(p116!=1))||((p120!=1)||(p206!=1)))")||(("(p219!=1)")||(G("(((p30!=1)||(p32!=1))||((p56!=1)||(p207!=1)))"))))))
Formula 0 simplified : F(!"(((p114!=1)||(p116!=1))||((p120!=1)||(p206!=1)))" & !"(p219!=1)" & F!"(((p30!=1)||(p32!=1))||((p56!=1)||(p207!=1)))")
Reverse transition relation is NOT exact ! Due to transitions t2, t24, t29, t32, t59, t64, t67, t94, t99, t102, t129, t134, t137, t164, t169, t172, t199, t...344
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2024-05-21 03:46:18] [INFO ] Flatten gal took : 17 ms
[2024-05-21 03:46:18] [INFO ] Applying decomposition
[2024-05-21 03:46:18] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12263320280573645987.txt' '-o' '/tmp/graph12263320280573645987.bin' '-w' '/tmp/graph12263320280573645987.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12263320280573645987.bin' '-l' '-1' '-v' '-w' '/tmp/graph12263320280573645987.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:46:18] [INFO ] Decomposing Gal with order
[2024-05-21 03:46:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:46:19] [INFO ] Removed a total of 799 redundant transitions.
[2024-05-21 03:46:19] [INFO ] Flatten gal took : 38 ms
[2024-05-21 03:46:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 118 labels/synchronizations in 5 ms.
[2024-05-21 03:46:19] [INFO ] Time to serialize gal into /tmp/LTL1339610157285827790.gal : 3 ms
[2024-05-21 03:46:19] [INFO ] Time to serialize properties into /tmp/LTL2254543926408498196.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1339610157285827790.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2254543926408498196.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(("(((i4.u28.p114!=1)||(u47.p116!=1))||((i4.u24.p120!=1)||(u47.p206!=1)))")||(("(u47.p219!=1)")||(G("(((u47.p30!=1)||(u47.p32!=1))...200
Formula 0 simplified : F(!"(((i4.u28.p114!=1)||(u47.p116!=1))||((i4.u24.p120!=1)||(u47.p206!=1)))" & !"(u47.p219!=1)" & F!"(((u47.p30!=1)||(u47.p32!=1))||(...192
Reverse transition relation is NOT exact ! Due to transitions t213, t617, t628, u47.t2, i0.t207, i0.t204, i0.u2.t199, i0.u3.t183.t208, i1.t172, i1.t169, i1...460
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
0 strongly connected components in search stack
5 transitions explored
2 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.474866,36844,1,0,42458,880,3323,76373,1080,2992,106718
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CloudDeployment-PT-6a-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudDeployment-PT-6a-LTLFireability-14 finished in 65362 ms.
All properties solved by simple procedures.
Total runtime 236239 ms.

BK_STOP 1716263180632

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is CloudDeployment-PT-6a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r087-tall-171620522100378"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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