Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 6.5K Apr 30 10:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 30 10:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 10:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 30 10:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 591K May 10 09:33 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-4b-LTLFireability-00
FORMULA_NAME CloudDeployment-PT-4b-LTLFireability-01
FORMULA_NAME CloudDeployment-PT-4b-LTLFireability-02
FORMULA_NAME CloudDeployment-PT-4b-LTLFireability-03
FORMULA_NAME CloudDeployment-PT-4b-LTLFireability-04
FORMULA_NAME CloudDeployment-PT-4b-LTLFireability-05
FORMULA_NAME CloudDeployment-PT-4b-LTLFireability-06
FORMULA_NAME CloudDeployment-PT-4b-LTLFireability-07
FORMULA_NAME CloudDeployment-PT-4b-LTLFireability-08
FORMULA_NAME CloudDeployment-PT-4b-LTLFireability-09
FORMULA_NAME CloudDeployment-PT-4b-LTLFireability-10
FORMULA_NAME CloudDeployment-PT-4b-LTLFireability-11
FORMULA_NAME CloudDeployment-PT-4b-LTLFireability-12
FORMULA_NAME CloudDeployment-PT-4b-LTLFireability-13
FORMULA_NAME CloudDeployment-PT-4b-LTLFireability-14
FORMULA_NAME CloudDeployment-PT-4b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652548491107

Running Version 202205111006
[2022-05-14 17:14:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-14 17:14:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 17:14:53] [INFO ] Load time of PNML (sax parser for PT used): 350 ms
[2022-05-14 17:14:53] [INFO ] Transformed 1182 places.
[2022-05-14 17:14:53] [INFO ] Transformed 1824 transitions.
[2022-05-14 17:14:53] [INFO ] Found NUPN structural information;
[2022-05-14 17:14:53] [INFO ] Parsed PT model containing 1182 places and 1824 transitions in 552 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CloudDeployment-PT-4b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1824/1824 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1178 transition count 1824
Discarding 291 places :
Symmetric choice reduction at 1 with 291 rule applications. Total rules 295 place count 887 transition count 1533
Iterating global reduction 1 with 291 rules applied. Total rules applied 586 place count 887 transition count 1533
Discarding 111 places :
Symmetric choice reduction at 1 with 111 rule applications. Total rules 697 place count 776 transition count 1422
Iterating global reduction 1 with 111 rules applied. Total rules applied 808 place count 776 transition count 1422
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 819 place count 776 transition count 1411
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 831 place count 764 transition count 1399
Iterating global reduction 2 with 12 rules applied. Total rules applied 843 place count 764 transition count 1399
Applied a total of 843 rules in 343 ms. Remains 764 /1182 variables (removed 418) and now considering 1399/1824 (removed 425) transitions.
// Phase 1: matrix 1399 rows 764 cols
[2022-05-14 17:14:54] [INFO ] Computed 13 place invariants in 46 ms
[2022-05-14 17:14:54] [INFO ] Implicit Places using invariants in 519 ms returned []
// Phase 1: matrix 1399 rows 764 cols
[2022-05-14 17:14:54] [INFO ] Computed 13 place invariants in 14 ms
[2022-05-14 17:14:55] [INFO ] Implicit Places using invariants and state equation in 1030 ms returned []
Implicit Place search using SMT with State Equation took 1593 ms to find 0 implicit places.
// Phase 1: matrix 1399 rows 764 cols
[2022-05-14 17:14:55] [INFO ] Computed 13 place invariants in 12 ms
[2022-05-14 17:14:56] [INFO ] Dead Transitions using invariants and state equation in 956 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 764/1182 places, 1399/1824 transitions.
Finished structural reductions, in 1 iterations. Remains : 764/1182 places, 1399/1824 transitions.
Support contains 55 out of 764 places after structural reductions.
[2022-05-14 17:14:57] [INFO ] Flatten gal took : 303 ms
[2022-05-14 17:14:57] [INFO ] Flatten gal took : 174 ms
[2022-05-14 17:14:57] [INFO ] Input system was already deterministic with 1399 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 818 ms. (steps per millisecond=12 ) properties (out of 28) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 1399 rows 764 cols
[2022-05-14 17:14:58] [INFO ] Computed 13 place invariants in 10 ms
[2022-05-14 17:14:59] [INFO ] After 626ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2022-05-14 17:15:00] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 8 ms returned sat
[2022-05-14 17:15:02] [INFO ] After 2138ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :17
[2022-05-14 17:15:04] [INFO ] After 4501ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :17
Attempting to minimize the solution found.
Minimization took 1342 ms.
[2022-05-14 17:15:06] [INFO ] After 6625ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :17
Fused 20 Parikh solutions to 17 different solutions.
Parikh walk visited 14 properties in 467 ms.
Support contains 3 out of 764 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 764/764 places, 1399/1399 transitions.
Graph (trivial) has 784 edges and 764 vertex of which 287 / 764 are part of one of the 32 SCC in 21 ms
Free SCC test removed 255 places
Drop transitions removed 580 transitions
Reduce isomorphic transitions removed 580 transitions.
Graph (complete) has 1720 edges and 509 vertex of which 486 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.11 ms
Discarding 23 places :
Also discarding 0 output transitions
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 223 rules applied. Total rules applied 225 place count 486 transition count 596
Reduce places removed 207 places and 0 transitions.
Iterating post reduction 1 with 207 rules applied. Total rules applied 432 place count 279 transition count 596
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 432 place count 279 transition count 552
Deduced a syphon composed of 44 places in 4 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 520 place count 235 transition count 552
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 526 place count 229 transition count 546
Iterating global reduction 2 with 6 rules applied. Total rules applied 532 place count 229 transition count 546
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 533 place count 229 transition count 545
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 533 place count 229 transition count 540
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 543 place count 224 transition count 540
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 3 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 665 place count 163 transition count 479
Performed 28 Post agglomeration using F-continuation condition with reduction of 32 identical transitions.
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 721 place count 135 transition count 615
Drop transitions removed 12 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 749 place count 135 transition count 587
Drop transitions removed 104 transitions
Redundant transition composition rules discarded 104 transitions
Iterating global reduction 4 with 104 rules applied. Total rules applied 853 place count 135 transition count 483
Free-agglomeration rule applied 40 times with reduction of 12 identical transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 893 place count 135 transition count 431
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 60 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 80 transitions.
Graph (complete) has 642 edges and 95 vertex of which 94 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 121 rules applied. Total rules applied 1014 place count 94 transition count 351
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1015 place count 94 transition count 350
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1016 place count 93 transition count 345
Iterating global reduction 6 with 1 rules applied. Total rules applied 1017 place count 93 transition count 345
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 6 with 48 rules applied. Total rules applied 1065 place count 93 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1066 place count 92 transition count 296
Applied a total of 1066 rules in 391 ms. Remains 92 /764 variables (removed 672) and now considering 296/1399 (removed 1103) transitions.
Finished structural reductions, in 1 iterations. Remains : 92/764 places, 296/1399 transitions.
Finished random walk after 5395 steps, including 101 resets, run visited all 3 properties in 97 ms. (steps per millisecond=55 )
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA CloudDeployment-PT-4b-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 122 stabilizing places and 584 stable transitions
Graph (complete) has 2161 edges and 764 vertex of which 741 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.29 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(p1))))'
Support contains 6 out of 764 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 764/764 places, 1399/1399 transitions.
Graph (trivial) has 777 edges and 764 vertex of which 266 / 764 are part of one of the 30 SCC in 4 ms
Free SCC test removed 236 places
Ensure Unique test removed 269 transitions
Reduce isomorphic transitions removed 269 transitions.
Graph (complete) has 1851 edges and 528 vertex of which 505 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.8 ms
Discarding 23 places :
Also discarding 257 output transitions
Drop transitions removed 257 transitions
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 212 place count 505 transition count 663
Reduce places removed 210 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 213 rules applied. Total rules applied 425 place count 295 transition count 660
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 427 place count 293 transition count 660
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 427 place count 293 transition count 617
Deduced a syphon composed of 43 places in 3 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 513 place count 250 transition count 617
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 516 place count 247 transition count 614
Iterating global reduction 3 with 3 rules applied. Total rules applied 519 place count 247 transition count 614
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 520 place count 247 transition count 613
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 156 rules applied. Total rules applied 676 place count 169 transition count 535
Performed 26 Post agglomeration using F-continuation condition with reduction of 37 identical transitions.
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 728 place count 143 transition count 657
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 752 place count 143 transition count 633
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 5 with 61 rules applied. Total rules applied 813 place count 143 transition count 572
Applied a total of 813 rules in 217 ms. Remains 143 /764 variables (removed 621) and now considering 572/1399 (removed 827) transitions.
[2022-05-14 17:15:07] [INFO ] Flow matrix only has 451 transitions (discarded 121 similar events)
// Phase 1: matrix 451 rows 143 cols
[2022-05-14 17:15:07] [INFO ] Computed 4 place invariants in 5 ms
[2022-05-14 17:15:07] [INFO ] Implicit Places using invariants in 161 ms returned []
[2022-05-14 17:15:07] [INFO ] Flow matrix only has 451 transitions (discarded 121 similar events)
// Phase 1: matrix 451 rows 143 cols
[2022-05-14 17:15:07] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-14 17:15:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-14 17:15:08] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
[2022-05-14 17:15:09] [INFO ] Redundant transitions in 868 ms returned []
[2022-05-14 17:15:09] [INFO ] Flow matrix only has 451 transitions (discarded 121 similar events)
// Phase 1: matrix 451 rows 143 cols
[2022-05-14 17:15:09] [INFO ] Computed 4 place invariants in 8 ms
[2022-05-14 17:15:09] [INFO ] Dead Transitions using invariants and state equation in 461 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/764 places, 572/1399 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/764 places, 572/1399 transitions.
Stuttering acceptance computed with spot in 429 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : CloudDeployment-PT-4b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s4 0) (EQ s10 0) (EQ s26 0) (EQ s132 0) (EQ s141 0)), p1:(EQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3697 reset in 756 ms.
Product exploration explored 100000 steps with 3734 reset in 509 ms.
Computed a total of 42 stabilizing places and 342 stable transitions
Computed a total of 42 stabilizing places and 342 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 370 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 394 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 564455 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :{}
Probabilistic random walk after 564455 steps, saw 75725 distinct states, run finished after 3004 ms. (steps per millisecond=187 ) properties seen :0
Running SMT prover for 3 properties.
[2022-05-14 17:15:15] [INFO ] Flow matrix only has 451 transitions (discarded 121 similar events)
// Phase 1: matrix 451 rows 143 cols
[2022-05-14 17:15:15] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 17:15:15] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-14 17:15:15] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-14 17:15:15] [INFO ] After 210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-14 17:15:15] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-14 17:15:16] [INFO ] After 126ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-14 17:15:16] [INFO ] After 240ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 105 ms.
[2022-05-14 17:15:16] [INFO ] After 623ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 143 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 143/143 places, 572/572 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 143 transition count 528
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -74
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 62 place count 134 transition count 602
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 68 place count 134 transition count 596
Drop transitions removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 2 with 50 rules applied. Total rules applied 118 place count 134 transition count 546
Free-agglomeration rule applied 34 times with reduction of 6 identical transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 152 place count 134 transition count 506
Reduce places removed 34 places and 0 transitions.
Drop transitions removed 33 transitions
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 67 transitions.
Iterating post reduction 2 with 101 rules applied. Total rules applied 253 place count 100 transition count 439
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 258 place count 95 transition count 412
Iterating global reduction 3 with 5 rules applied. Total rules applied 263 place count 95 transition count 412
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 265 place count 95 transition count 410
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 4 with 37 rules applied. Total rules applied 302 place count 95 transition count 373
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 306 place count 95 transition count 373
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 309 place count 95 transition count 370
Applied a total of 309 rules in 105 ms. Remains 95 /143 variables (removed 48) and now considering 370/572 (removed 202) transitions.
Finished structural reductions, in 1 iterations. Remains : 95/143 places, 370/572 transitions.
Incomplete random walk after 10000 steps, including 236 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-14 17:15:16] [INFO ] Flow matrix only has 235 transitions (discarded 135 similar events)
// Phase 1: matrix 235 rows 95 cols
[2022-05-14 17:15:16] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-14 17:15:16] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-14 17:15:16] [INFO ] [Nat]Absence check using 0 positive and 10 generalized place invariants in 5 ms returned sat
[2022-05-14 17:15:16] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-14 17:15:16] [INFO ] State equation strengthened by 114 read => feed constraints.
[2022-05-14 17:15:17] [INFO ] After 116ms SMT Verify possible using 114 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-14 17:15:17] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 58 ms.
[2022-05-14 17:15:17] [INFO ] After 486ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 95 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 95/95 places, 370/370 transitions.
Applied a total of 0 rules in 9 ms. Remains 95 /95 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 95/95 places, 370/370 transitions.
Incomplete random walk after 10000 steps, including 234 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 691226 steps, run timeout after 3001 ms. (steps per millisecond=230 ) properties seen :{}
Probabilistic random walk after 691226 steps, saw 95976 distinct states, run finished after 3001 ms. (steps per millisecond=230 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-14 17:15:20] [INFO ] Flow matrix only has 235 transitions (discarded 135 similar events)
// Phase 1: matrix 235 rows 95 cols
[2022-05-14 17:15:20] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-14 17:15:20] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-14 17:15:20] [INFO ] [Nat]Absence check using 0 positive and 10 generalized place invariants in 4 ms returned sat
[2022-05-14 17:15:20] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-14 17:15:20] [INFO ] State equation strengthened by 114 read => feed constraints.
[2022-05-14 17:15:20] [INFO ] After 112ms SMT Verify possible using 114 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-14 17:15:20] [INFO ] After 210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 55 ms.
[2022-05-14 17:15:20] [INFO ] After 476ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 6 out of 95 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 95/95 places, 370/370 transitions.
Applied a total of 0 rules in 8 ms. Remains 95 /95 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 95/95 places, 370/370 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 95/95 places, 370/370 transitions.
Applied a total of 0 rules in 7 ms. Remains 95 /95 variables (removed 0) and now considering 370/370 (removed 0) transitions.
[2022-05-14 17:15:20] [INFO ] Flow matrix only has 235 transitions (discarded 135 similar events)
// Phase 1: matrix 235 rows 95 cols
[2022-05-14 17:15:20] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-14 17:15:21] [INFO ] Implicit Places using invariants in 99 ms returned []
[2022-05-14 17:15:21] [INFO ] Flow matrix only has 235 transitions (discarded 135 similar events)
// Phase 1: matrix 235 rows 95 cols
[2022-05-14 17:15:21] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-14 17:15:21] [INFO ] State equation strengthened by 114 read => feed constraints.
[2022-05-14 17:15:21] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
[2022-05-14 17:15:21] [INFO ] Redundant transitions in 337 ms returned []
[2022-05-14 17:15:21] [INFO ] Flow matrix only has 235 transitions (discarded 135 similar events)
// Phase 1: matrix 235 rows 95 cols
[2022-05-14 17:15:21] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-14 17:15:22] [INFO ] Dead Transitions using invariants and state equation in 315 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 95/95 places, 370/370 transitions.
Graph (trivial) has 74 edges and 95 vertex of which 24 / 95 are part of one of the 3 SCC in 0 ms
Free SCC test removed 21 places
Drop transitions removed 39 transitions
Ensure Unique test removed 135 transitions
Reduce isomorphic transitions removed 174 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 69 transition count 190
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 19 place count 63 transition count 189
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21 place count 62 transition count 188
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 21 place count 62 transition count 182
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 33 place count 56 transition count 182
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 36 place count 53 transition count 179
Iterating global reduction 3 with 3 rules applied. Total rules applied 39 place count 53 transition count 179
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 41 place count 51 transition count 169
Iterating global reduction 3 with 2 rules applied. Total rules applied 43 place count 51 transition count 169
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 81 place count 51 transition count 131
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 89 place count 47 transition count 127
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 95 place count 47 transition count 121
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 103 place count 43 transition count 140
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 5 with 24 rules applied. Total rules applied 127 place count 43 transition count 116
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 133 place count 40 transition count 113
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 135 place count 38 transition count 101
Iterating global reduction 5 with 2 rules applied. Total rules applied 137 place count 38 transition count 101
Applied a total of 137 rules in 18 ms. Remains 38 /95 variables (removed 57) and now considering 101/370 (removed 269) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 101 rows 38 cols
[2022-05-14 17:15:22] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-14 17:15:22] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-14 17:15:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-14 17:15:22] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-14 17:15:22] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-14 17:15:22] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 17:15:22] [INFO ] After 28ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-14 17:15:22] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-05-14 17:15:22] [INFO ] After 179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-14 17:15:22] [INFO ] Flatten gal took : 10 ms
[2022-05-14 17:15:22] [INFO ] Flatten gal took : 11 ms
[2022-05-14 17:15:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8714474451987062393.gal : 9 ms
[2022-05-14 17:15:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4465561801228165722.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12327300769312520417;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8714474451987062393.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4465561801228165722.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality4465561801228165722.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 145
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :145 after 245
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :245 after 637
Reachability property apf1 is true.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6737,0.054675,5312,2,212,12,1401,6,0,251,1013,0
Total reachable state count : 6737

Verifying 2 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,0.055465,5312,2,39,12,1401,7,0,266,1013,0
Reachability property apf1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,1,0.056827,5312,2,39,12,1401,8,0,273,1013,0
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 8 factoid took 341 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 6 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 572/572 transitions.
Applied a total of 0 rules in 26 ms. Remains 143 /143 variables (removed 0) and now considering 572/572 (removed 0) transitions.
[2022-05-14 17:15:23] [INFO ] Flow matrix only has 451 transitions (discarded 121 similar events)
// Phase 1: matrix 451 rows 143 cols
[2022-05-14 17:15:23] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-14 17:15:23] [INFO ] Implicit Places using invariants in 154 ms returned []
[2022-05-14 17:15:23] [INFO ] Flow matrix only has 451 transitions (discarded 121 similar events)
// Phase 1: matrix 451 rows 143 cols
[2022-05-14 17:15:23] [INFO ] Computed 4 place invariants in 6 ms
[2022-05-14 17:15:23] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-14 17:15:23] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
[2022-05-14 17:15:24] [INFO ] Redundant transitions in 663 ms returned []
[2022-05-14 17:15:24] [INFO ] Flow matrix only has 451 transitions (discarded 121 similar events)
// Phase 1: matrix 451 rows 143 cols
[2022-05-14 17:15:24] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-14 17:15:24] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 572/572 transitions.
Computed a total of 42 stabilizing places and 342 stable transitions
Computed a total of 42 stabilizing places and 342 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 326 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 383 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 539056 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :{}
Probabilistic random walk after 539056 steps, saw 72316 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
Running SMT prover for 3 properties.
[2022-05-14 17:15:28] [INFO ] Flow matrix only has 451 transitions (discarded 121 similar events)
// Phase 1: matrix 451 rows 143 cols
[2022-05-14 17:15:28] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 17:15:28] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-14 17:15:28] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-14 17:15:28] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-14 17:15:28] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-14 17:15:29] [INFO ] After 122ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-14 17:15:29] [INFO ] After 229ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 81 ms.
[2022-05-14 17:15:29] [INFO ] After 593ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 143 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 143/143 places, 572/572 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 143 transition count 528
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -74
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 62 place count 134 transition count 602
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 68 place count 134 transition count 596
Drop transitions removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 2 with 50 rules applied. Total rules applied 118 place count 134 transition count 546
Free-agglomeration rule applied 34 times with reduction of 6 identical transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 152 place count 134 transition count 506
Reduce places removed 34 places and 0 transitions.
Drop transitions removed 33 transitions
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 67 transitions.
Iterating post reduction 2 with 101 rules applied. Total rules applied 253 place count 100 transition count 439
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 258 place count 95 transition count 412
Iterating global reduction 3 with 5 rules applied. Total rules applied 263 place count 95 transition count 412
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 265 place count 95 transition count 410
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 4 with 37 rules applied. Total rules applied 302 place count 95 transition count 373
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 306 place count 95 transition count 373
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 309 place count 95 transition count 370
Applied a total of 309 rules in 86 ms. Remains 95 /143 variables (removed 48) and now considering 370/572 (removed 202) transitions.
Finished structural reductions, in 1 iterations. Remains : 95/143 places, 370/572 transitions.
Incomplete random walk after 10000 steps, including 240 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-14 17:15:29] [INFO ] Flow matrix only has 235 transitions (discarded 135 similar events)
// Phase 1: matrix 235 rows 95 cols
[2022-05-14 17:15:29] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-14 17:15:29] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-14 17:15:29] [INFO ] [Nat]Absence check using 0 positive and 10 generalized place invariants in 4 ms returned sat
[2022-05-14 17:15:29] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-14 17:15:29] [INFO ] State equation strengthened by 114 read => feed constraints.
[2022-05-14 17:15:29] [INFO ] After 86ms SMT Verify possible using 114 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-14 17:15:29] [INFO ] After 155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 57 ms.
[2022-05-14 17:15:30] [INFO ] After 378ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 95 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 95/95 places, 370/370 transitions.
Applied a total of 0 rules in 7 ms. Remains 95 /95 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 95/95 places, 370/370 transitions.
Incomplete random walk after 10000 steps, including 242 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 698890 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :{}
Probabilistic random walk after 698890 steps, saw 96837 distinct states, run finished after 3001 ms. (steps per millisecond=232 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-14 17:15:33] [INFO ] Flow matrix only has 235 transitions (discarded 135 similar events)
// Phase 1: matrix 235 rows 95 cols
[2022-05-14 17:15:33] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-14 17:15:33] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-14 17:15:33] [INFO ] [Nat]Absence check using 0 positive and 10 generalized place invariants in 3 ms returned sat
[2022-05-14 17:15:33] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-14 17:15:33] [INFO ] State equation strengthened by 114 read => feed constraints.
[2022-05-14 17:15:33] [INFO ] After 75ms SMT Verify possible using 114 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-14 17:15:33] [INFO ] After 141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 58 ms.
[2022-05-14 17:15:33] [INFO ] After 366ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 95 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 95/95 places, 370/370 transitions.
Applied a total of 0 rules in 8 ms. Remains 95 /95 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 95/95 places, 370/370 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 95/95 places, 370/370 transitions.
Applied a total of 0 rules in 8 ms. Remains 95 /95 variables (removed 0) and now considering 370/370 (removed 0) transitions.
[2022-05-14 17:15:33] [INFO ] Flow matrix only has 235 transitions (discarded 135 similar events)
// Phase 1: matrix 235 rows 95 cols
[2022-05-14 17:15:33] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-14 17:15:33] [INFO ] Implicit Places using invariants in 140 ms returned []
[2022-05-14 17:15:33] [INFO ] Flow matrix only has 235 transitions (discarded 135 similar events)
// Phase 1: matrix 235 rows 95 cols
[2022-05-14 17:15:33] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-14 17:15:33] [INFO ] State equation strengthened by 114 read => feed constraints.
[2022-05-14 17:15:34] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2022-05-14 17:15:34] [INFO ] Redundant transitions in 295 ms returned []
[2022-05-14 17:15:34] [INFO ] Flow matrix only has 235 transitions (discarded 135 similar events)
// Phase 1: matrix 235 rows 95 cols
[2022-05-14 17:15:34] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-14 17:15:34] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 95/95 places, 370/370 transitions.
Graph (trivial) has 74 edges and 95 vertex of which 24 / 95 are part of one of the 3 SCC in 1 ms
Free SCC test removed 21 places
Drop transitions removed 39 transitions
Ensure Unique test removed 135 transitions
Reduce isomorphic transitions removed 174 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 69 transition count 190
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 19 place count 63 transition count 189
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21 place count 62 transition count 188
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 21 place count 62 transition count 182
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 33 place count 56 transition count 182
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 36 place count 53 transition count 179
Iterating global reduction 3 with 3 rules applied. Total rules applied 39 place count 53 transition count 179
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 41 place count 51 transition count 169
Iterating global reduction 3 with 2 rules applied. Total rules applied 43 place count 51 transition count 169
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 81 place count 51 transition count 131
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 89 place count 47 transition count 127
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 95 place count 47 transition count 121
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 103 place count 43 transition count 140
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 5 with 24 rules applied. Total rules applied 127 place count 43 transition count 116
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 133 place count 40 transition count 113
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 135 place count 38 transition count 101
Iterating global reduction 5 with 2 rules applied. Total rules applied 137 place count 38 transition count 101
Applied a total of 137 rules in 20 ms. Remains 38 /95 variables (removed 57) and now considering 101/370 (removed 269) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 101 rows 38 cols
[2022-05-14 17:15:34] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-14 17:15:34] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-14 17:15:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-14 17:15:34] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 3 ms returned sat
[2022-05-14 17:15:34] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-14 17:15:34] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 17:15:34] [INFO ] After 36ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-14 17:15:34] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2022-05-14 17:15:35] [INFO ] After 209ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-14 17:15:35] [INFO ] Flatten gal took : 8 ms
[2022-05-14 17:15:35] [INFO ] Flatten gal took : 7 ms
[2022-05-14 17:15:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality156164202520730014.gal : 3 ms
[2022-05-14 17:15:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15011639558762382845.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms2883998947882838104;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality156164202520730014.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15011639558762382845.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality15011639558762382845.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 145
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :145 after 245
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :245 after 637
Reachability property apf1 is true.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6737,0.040247,5444,2,212,12,1424,6,0,251,1017,0
Total reachable state count : 6737

Verifying 2 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,0.041347,5444,2,39,12,1424,7,0,266,1017,0
Reachability property apf1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,1,0.04244,5444,2,39,12,1424,8,0,273,1017,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 8 factoid took 351 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 3723 reset in 659 ms.
Product exploration explored 100000 steps with 3704 reset in 420 ms.
Built C files in :
/tmp/ltsmin3322479620460359701
[2022-05-14 17:15:36] [INFO ] Computing symmetric may disable matrix : 572 transitions.
[2022-05-14 17:15:36] [INFO ] Computation of Complete disable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 17:15:36] [INFO ] Computing symmetric may enable matrix : 572 transitions.
[2022-05-14 17:15:36] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 17:15:37] [INFO ] Computing Do-Not-Accords matrix : 572 transitions.
[2022-05-14 17:15:37] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 17:15:37] [INFO ] Built C files in 158ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3322479620460359701
Running compilation step : cd /tmp/ltsmin3322479620460359701;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2697 ms.
Running link step : cd /tmp/ltsmin3322479620460359701;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin3322479620460359701;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9255024872874812324.hoa' '--buchi-type=spotba'
LTSmin run took 10285 ms.
FORMULA CloudDeployment-PT-4b-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-4b-LTLFireability-00 finished in 42643 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 764 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 764/764 places, 1399/1399 transitions.
Graph (trivial) has 788 edges and 764 vertex of which 287 / 764 are part of one of the 32 SCC in 2 ms
Free SCC test removed 255 places
Ensure Unique test removed 291 transitions
Reduce isomorphic transitions removed 291 transitions.
Graph (complete) has 1820 edges and 509 vertex of which 486 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.3 ms
Discarding 23 places :
Also discarding 257 output transitions
Drop transitions removed 257 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 205 transitions
Trivial Post-agglo rules discarded 205 transitions
Performed 205 trivial Post agglomeration. Transition count delta: 205
Iterating post reduction 0 with 205 rules applied. Total rules applied 207 place count 485 transition count 645
Reduce places removed 205 places and 0 transitions.
Iterating post reduction 1 with 205 rules applied. Total rules applied 412 place count 280 transition count 645
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 412 place count 280 transition count 604
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 494 place count 239 transition count 604
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 497 place count 236 transition count 601
Iterating global reduction 2 with 3 rules applied. Total rules applied 500 place count 236 transition count 601
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 501 place count 236 transition count 600
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 647 place count 163 transition count 527
Performed 24 Post agglomeration using F-continuation condition with reduction of 32 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 695 place count 139 transition count 643
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 719 place count 139 transition count 619
Drop transitions removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 4 with 72 rules applied. Total rules applied 791 place count 139 transition count 547
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 792 place count 138 transition count 546
Applied a total of 792 rules in 85 ms. Remains 138 /764 variables (removed 626) and now considering 546/1399 (removed 853) transitions.
[2022-05-14 17:15:50] [INFO ] Flow matrix only has 423 transitions (discarded 123 similar events)
// Phase 1: matrix 423 rows 138 cols
[2022-05-14 17:15:50] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 17:15:50] [INFO ] Implicit Places using invariants in 109 ms returned []
[2022-05-14 17:15:50] [INFO ] Flow matrix only has 423 transitions (discarded 123 similar events)
// Phase 1: matrix 423 rows 138 cols
[2022-05-14 17:15:50] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 17:15:50] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-14 17:15:50] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2022-05-14 17:15:51] [INFO ] Redundant transitions in 572 ms returned []
[2022-05-14 17:15:51] [INFO ] Flow matrix only has 423 transitions (discarded 123 similar events)
// Phase 1: matrix 423 rows 138 cols
[2022-05-14 17:15:51] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 17:15:51] [INFO ] Dead Transitions using invariants and state equation in 380 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 138/764 places, 546/1399 transitions.
Finished structural reductions, in 1 iterations. Remains : 138/764 places, 546/1399 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-4b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s20 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-4b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-4b-LTLFireability-01 finished in 1519 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U (G((X(p0)||p0))&&X(p1)))))'
Support contains 2 out of 764 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 764/764 places, 1399/1399 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 763 transition count 1399
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 746 transition count 1135
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 746 transition count 1135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 746 transition count 1134
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 744 transition count 1132
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 744 transition count 1132
Applied a total of 40 rules in 89 ms. Remains 744 /764 variables (removed 20) and now considering 1132/1399 (removed 267) transitions.
// Phase 1: matrix 1132 rows 744 cols
[2022-05-14 17:15:51] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-14 17:15:52] [INFO ] Implicit Places using invariants in 547 ms returned []
// Phase 1: matrix 1132 rows 744 cols
[2022-05-14 17:15:52] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-14 17:15:53] [INFO ] Implicit Places using invariants and state equation in 1061 ms returned [10, 18, 184, 192, 357, 365, 530, 538]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 1617 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 736/764 places, 1132/1399 transitions.
Applied a total of 0 rules in 29 ms. Remains 736 /736 variables (removed 0) and now considering 1132/1132 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 736/764 places, 1132/1399 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : CloudDeployment-PT-4b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s699 1), p1:(EQ s625 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 77 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-4b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-4b-LTLFireability-04 finished in 2031 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((X((G(F(p1)) U G(!p0)))||p1))))'
Support contains 2 out of 764 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 764/764 places, 1399/1399 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 763 transition count 1399
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 747 transition count 1136
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 747 transition count 1136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 747 transition count 1135
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 745 transition count 1133
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 745 transition count 1133
Applied a total of 38 rules in 83 ms. Remains 745 /764 variables (removed 19) and now considering 1133/1399 (removed 266) transitions.
// Phase 1: matrix 1133 rows 745 cols
[2022-05-14 17:15:53] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-14 17:15:54] [INFO ] Implicit Places using invariants in 282 ms returned []
// Phase 1: matrix 1133 rows 745 cols
[2022-05-14 17:15:54] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-14 17:15:55] [INFO ] Implicit Places using invariants and state equation in 1249 ms returned [10, 18, 185, 193, 358, 366, 531, 539]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 1535 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 737/764 places, 1133/1399 transitions.
Applied a total of 0 rules in 16 ms. Remains 737 /737 variables (removed 0) and now considering 1133/1133 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 737/764 places, 1133/1399 transitions.
Stuttering acceptance computed with spot in 291 ms :[(AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND p0 (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-4b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 1}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(NEQ s587 1), p1:(EQ s114 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]]
Stuttering criterion allowed to conclude after 199 steps with 0 reset in 2 ms.
FORMULA CloudDeployment-PT-4b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-4b-LTLFireability-05 finished in 1959 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(G(X(X(p0)))))))'
Support contains 1 out of 764 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 764/764 places, 1399/1399 transitions.
Graph (trivial) has 788 edges and 764 vertex of which 282 / 764 are part of one of the 31 SCC in 3 ms
Free SCC test removed 251 places
Ensure Unique test removed 287 transitions
Reduce isomorphic transitions removed 287 transitions.
Graph (complete) has 1824 edges and 513 vertex of which 490 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.3 ms
Discarding 23 places :
Also discarding 257 output transitions
Drop transitions removed 257 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 208 place count 489 transition count 648
Reduce places removed 206 places and 0 transitions.
Iterating post reduction 1 with 206 rules applied. Total rules applied 414 place count 283 transition count 648
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 414 place count 283 transition count 606
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 498 place count 241 transition count 606
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 501 place count 238 transition count 603
Iterating global reduction 2 with 3 rules applied. Total rules applied 504 place count 238 transition count 603
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 505 place count 238 transition count 602
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 653 place count 164 transition count 528
Performed 24 Post agglomeration using F-continuation condition with reduction of 32 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 701 place count 140 transition count 644
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 725 place count 140 transition count 620
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 727 place count 139 transition count 639
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 731 place count 139 transition count 635
Drop transitions removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 5 with 80 rules applied. Total rules applied 811 place count 139 transition count 555
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 812 place count 138 transition count 554
Applied a total of 812 rules in 127 ms. Remains 138 /764 variables (removed 626) and now considering 554/1399 (removed 845) transitions.
[2022-05-14 17:15:55] [INFO ] Flow matrix only has 432 transitions (discarded 122 similar events)
// Phase 1: matrix 432 rows 138 cols
[2022-05-14 17:15:55] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 17:15:55] [INFO ] Implicit Places using invariants in 152 ms returned []
[2022-05-14 17:15:55] [INFO ] Flow matrix only has 432 transitions (discarded 122 similar events)
// Phase 1: matrix 432 rows 138 cols
[2022-05-14 17:15:55] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 17:15:56] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-14 17:15:56] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
[2022-05-14 17:15:56] [INFO ] Redundant transitions in 623 ms returned []
[2022-05-14 17:15:56] [INFO ] Flow matrix only has 432 transitions (discarded 122 similar events)
// Phase 1: matrix 432 rows 138 cols
[2022-05-14 17:15:56] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 17:15:57] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 138/764 places, 554/1399 transitions.
Finished structural reductions, in 1 iterations. Remains : 138/764 places, 554/1399 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-4b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s54 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-4b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-4b-LTLFireability-06 finished in 1721 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((false U G((p0 U !p1))))'
Support contains 17 out of 764 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 764/764 places, 1399/1399 transitions.
Graph (trivial) has 776 edges and 764 vertex of which 278 / 764 are part of one of the 32 SCC in 1 ms
Free SCC test removed 246 places
Ensure Unique test removed 280 transitions
Reduce isomorphic transitions removed 280 transitions.
Graph (complete) has 1833 edges and 518 vertex of which 517 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 207 rules applied. Total rules applied 209 place count 516 transition count 910
Reduce places removed 207 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 208 rules applied. Total rules applied 417 place count 309 transition count 909
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 418 place count 308 transition count 909
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 418 place count 308 transition count 867
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 502 place count 266 transition count 867
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 505 place count 263 transition count 864
Iterating global reduction 3 with 3 rules applied. Total rules applied 508 place count 263 transition count 864
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 509 place count 263 transition count 863
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 659 place count 188 transition count 788
Performed 22 Post agglomeration using F-continuation condition with reduction of 37 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 703 place count 166 transition count 878
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 719 place count 166 transition count 862
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 5 with 61 rules applied. Total rules applied 780 place count 166 transition count 801
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 781 place count 165 transition count 800
Applied a total of 781 rules in 137 ms. Remains 165 /764 variables (removed 599) and now considering 800/1399 (removed 599) transitions.
[2022-05-14 17:15:57] [INFO ] Flow matrix only has 673 transitions (discarded 127 similar events)
// Phase 1: matrix 673 rows 165 cols
[2022-05-14 17:15:57] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-14 17:15:57] [INFO ] Implicit Places using invariants in 241 ms returned []
[2022-05-14 17:15:57] [INFO ] Flow matrix only has 673 transitions (discarded 127 similar events)
// Phase 1: matrix 673 rows 165 cols
[2022-05-14 17:15:57] [INFO ] Computed 13 place invariants in 4 ms
[2022-05-14 17:15:58] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-14 17:15:58] [INFO ] Implicit Places using invariants and state equation in 648 ms returned []
Implicit Place search using SMT with State Equation took 896 ms to find 0 implicit places.
[2022-05-14 17:15:58] [INFO ] Redundant transitions in 522 ms returned []
[2022-05-14 17:15:58] [INFO ] Flow matrix only has 673 transitions (discarded 127 similar events)
// Phase 1: matrix 673 rows 165 cols
[2022-05-14 17:15:58] [INFO ] Computed 13 place invariants in 7 ms
[2022-05-14 17:15:59] [INFO ] Dead Transitions using invariants and state equation in 684 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/764 places, 800/1399 transitions.
Finished structural reductions, in 1 iterations. Remains : 165/764 places, 800/1399 transitions.
Stuttering acceptance computed with spot in 117 ms :[p1, true, p1]
Running random walk in product with property : CloudDeployment-PT-4b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s30 1) (AND (EQ s2 1) (EQ s8 1) (EQ s15 1) (EQ s38 1) (EQ s44 1) (EQ s51 1) (EQ s72 1) (EQ s78 1) (EQ s85 1) (EQ s106 1) (EQ s112 1) (EQ s120 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 517 steps with 20 reset in 5 ms.
FORMULA CloudDeployment-PT-4b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-4b-LTLFireability-07 finished in 2392 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U (G(p1) U p2))))'
Support contains 9 out of 764 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 764/764 places, 1399/1399 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 763 transition count 1399
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 745 transition count 1134
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 745 transition count 1134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 745 transition count 1133
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 743 transition count 1131
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 743 transition count 1131
Applied a total of 42 rules in 51 ms. Remains 743 /764 variables (removed 21) and now considering 1131/1399 (removed 268) transitions.
// Phase 1: matrix 1131 rows 743 cols
[2022-05-14 17:15:59] [INFO ] Computed 12 place invariants in 6 ms
[2022-05-14 17:16:00] [INFO ] Implicit Places using invariants in 239 ms returned []
// Phase 1: matrix 1131 rows 743 cols
[2022-05-14 17:16:00] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-14 17:16:01] [INFO ] Implicit Places using invariants and state equation in 1123 ms returned [10, 18, 184, 192, 357, 365, 530, 538]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 1365 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 735/764 places, 1131/1399 transitions.
Applied a total of 0 rules in 26 ms. Remains 735 /735 variables (removed 0) and now considering 1131/1131 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 735/764 places, 1131/1399 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, p1, p2, (AND p1 p2), p2]
Running random walk in product with property : CloudDeployment-PT-4b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (EQ s527 1) (EQ s543 1) (EQ s620 1) (EQ s717 1) (EQ s731 1)), p2:(EQ s147 1), p0:(AND (EQ s356 1) (EQ s372 1) (EQ s401 1) (EQ s717 1) (EQ s731 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1279 ms.
Product exploration explored 100000 steps with 50000 reset in 1105 ms.
Computed a total of 106 stabilizing places and 322 stable transitions
Graph (complete) has 2013 edges and 735 vertex of which 729 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Computed a total of 106 stabilizing places and 322 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) (NOT p2) (NOT p0))
Knowledge based reduction with 10 factoid took 359 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA CloudDeployment-PT-4b-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-4b-LTLFireability-08 finished in 4391 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||!(F(p1) U (p2 U p3)))))'
Support contains 4 out of 764 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 764/764 places, 1399/1399 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 763 transition count 1399
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 746 transition count 1135
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 746 transition count 1135
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 744 transition count 1133
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 744 transition count 1133
Applied a total of 39 rules in 56 ms. Remains 744 /764 variables (removed 20) and now considering 1133/1399 (removed 266) transitions.
// Phase 1: matrix 1133 rows 744 cols
[2022-05-14 17:16:04] [INFO ] Computed 12 place invariants in 7 ms
[2022-05-14 17:16:04] [INFO ] Implicit Places using invariants in 290 ms returned []
// Phase 1: matrix 1133 rows 744 cols
[2022-05-14 17:16:04] [INFO ] Computed 12 place invariants in 12 ms
[2022-05-14 17:16:05] [INFO ] Implicit Places using invariants and state equation in 933 ms returned [10, 18, 184, 192, 357, 366, 531, 539]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 1226 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 736/764 places, 1133/1399 transitions.
Applied a total of 0 rules in 16 ms. Remains 736 /736 variables (removed 0) and now considering 1133/1133 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 736/764 places, 1133/1399 transitions.
Stuttering acceptance computed with spot in 430 ms :[(AND (NOT p0) p3), (NOT p0), (AND (NOT p0) p1 p3), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) p3), true, p1, p3, (AND p0 p3), (AND p0 p1 p3)]
Running random walk in product with property : CloudDeployment-PT-4b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p3, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 p3 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p3 (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 9}], [{ cond=(AND (NOT p1) p3 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=(AND p3 (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=4 dest: 9}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 5}, { cond=(NOT p1), acceptance={} source=6 dest: 6}], [{ cond=p3, acceptance={} source=7 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={} source=7 dest: 7}], [{ cond=(AND p3 p0), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={} source=8 dest: 7}, { cond=(AND p1 (NOT p3) p0), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=8 dest: 9}], [{ cond=(AND p1 p3 p0), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p1) p3 p0), acceptance={} source=9 dest: 6}, { cond=(AND p1 (NOT p3) p0), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=9 dest: 9}]], initial=0, aps=[p3:(AND (EQ s185 1) (EQ s367 1) (EQ s261 1)), p1:(EQ s356 1), p2:(EQ s261 1), p0:(EQ s356 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33289 reset in 698 ms.
Product exploration explored 100000 steps with 33388 reset in 718 ms.
Computed a total of 106 stabilizing places and 322 stable transitions
Graph (complete) has 2016 edges and 736 vertex of which 730 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Computed a total of 106 stabilizing places and 322 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) p3 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0)))), (X p0), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (NOT (AND p1 p3 (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p0)))), true, (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (AND (NOT p1) (NOT p3) p0))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 1095 ms. Reduced automaton from 10 states, 29 edges and 4 AP to 10 states, 29 edges and 4 AP.
Stuttering acceptance computed with spot in 406 ms :[(AND (NOT p0) p3), (NOT p0), (AND (NOT p0) p1 p3), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) p3), true, p1, p3, (AND p0 p3), (AND p0 p1 p3)]
Incomplete random walk after 10000 steps, including 80 resets, run finished after 448 ms. (steps per millisecond=22 ) properties (out of 20) seen :6
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 1133 rows 736 cols
[2022-05-14 17:16:10] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-14 17:16:10] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2022-05-14 17:16:11] [INFO ] After 1188ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:12
[2022-05-14 17:16:12] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2022-05-14 17:16:13] [INFO ] After 1042ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :9
[2022-05-14 17:16:14] [INFO ] After 1772ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :9
Attempting to minimize the solution found.
Minimization took 464 ms.
[2022-05-14 17:16:14] [INFO ] After 2661ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :9
Fused 14 Parikh solutions to 9 different solutions.
Parikh walk visited 6 properties in 125 ms.
Support contains 4 out of 736 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 736/736 places, 1133/1133 transitions.
Graph (trivial) has 764 edges and 736 vertex of which 273 / 736 are part of one of the 32 SCC in 1 ms
Free SCC test removed 241 places
Drop transitions removed 314 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 315 transitions.
Graph (complete) has 1592 edges and 495 vertex of which 489 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 0 with 212 rules applied. Total rules applied 214 place count 489 transition count 606
Reduce places removed 204 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 205 rules applied. Total rules applied 419 place count 285 transition count 605
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 420 place count 284 transition count 605
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 420 place count 284 transition count 558
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 514 place count 237 transition count 558
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 518 place count 233 transition count 554
Iterating global reduction 3 with 4 rules applied. Total rules applied 522 place count 233 transition count 554
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 522 place count 233 transition count 550
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 530 place count 229 transition count 550
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 660 place count 164 transition count 485
Performed 31 Post agglomeration using F-continuation condition with reduction of 32 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 722 place count 133 transition count 647
Drop transitions removed 13 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 3 with 40 rules applied. Total rules applied 762 place count 133 transition count 607
Drop transitions removed 123 transitions
Redundant transition composition rules discarded 123 transitions
Iterating global reduction 4 with 123 rules applied. Total rules applied 885 place count 133 transition count 484
Free-agglomeration rule applied 37 times with reduction of 8 identical transitions.
Iterating global reduction 4 with 37 rules applied. Total rules applied 922 place count 133 transition count 439
Reduce places removed 37 places and 0 transitions.
Drop transitions removed 43 transitions
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 4 with 113 rules applied. Total rules applied 1035 place count 96 transition count 363
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1038 place count 93 transition count 348
Iterating global reduction 5 with 3 rules applied. Total rules applied 1041 place count 93 transition count 348
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 5 with 36 rules applied. Total rules applied 1077 place count 93 transition count 312
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1079 place count 93 transition count 312
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1080 place count 92 transition count 311
Applied a total of 1080 rules in 101 ms. Remains 92 /736 variables (removed 644) and now considering 311/1133 (removed 822) transitions.
Finished structural reductions, in 1 iterations. Remains : 92/736 places, 311/1133 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Finished probabilistic random walk after 10270 steps, run visited all 3 properties in 72 ms. (steps per millisecond=142 )
Probabilistic random walk after 10270 steps, saw 2198 distinct states, run finished after 72 ms. (steps per millisecond=142 ) properties seen :3
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) p3 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0)))), (X p0), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (NOT (AND p1 p3 (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p0)))), true, (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (AND (NOT p1) (NOT p3) p0))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) p0)))), (X (X (NOT p1))), (G (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (G (NOT (AND p3 (NOT p1) (NOT p0)))), (G (NOT (AND p3 p1 p0))), (G (NOT (AND (NOT p3) p1 p0))), (G (NOT (AND (NOT p3) p2 (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p3) p1 (NOT p0))), (F (AND (NOT p3) p2 (NOT p0))), (F (NOT p0)), (F (AND (NOT p3) p2 (NOT p1) p0)), (F (AND (NOT p3) p1)), (F (AND p3 p0)), (F (AND (NOT p3) p2)), (F p1), (F (AND p3 p1 (NOT p0))), (F (AND p3 (NOT p1) p0)), (F p3), (F (NOT (AND (NOT p3) (NOT p1) p0))), (F (AND (NOT p3) p2 (NOT p1))), (F (NOT (AND (NOT p3) (NOT p1)))), (F (AND p3 (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 24 factoid took 1473 ms. Reduced automaton from 10 states, 29 edges and 4 AP to 6 states, 17 edges and 4 AP.
Stuttering acceptance computed with spot in 226 ms :[(OR (AND p1 (NOT p0)) (AND (NOT p1) p0)), (OR (AND (NOT p0) p1 p3) (AND p0 (NOT p1) p3)), (AND p1 (NOT p0)), (AND (NOT p0) p1), (AND (NOT p0) p1 p3), (AND (NOT p0) p1 p3)]
Stuttering acceptance computed with spot in 235 ms :[(OR (AND p1 (NOT p0)) (AND (NOT p1) p0)), (OR (AND (NOT p0) p1 p3) (AND p0 (NOT p1) p3)), (AND p1 (NOT p0)), (AND (NOT p0) p1), (AND (NOT p0) p1 p3), (AND (NOT p0) p1 p3)]
Support contains 4 out of 736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 736/736 places, 1133/1133 transitions.
Applied a total of 0 rules in 15 ms. Remains 736 /736 variables (removed 0) and now considering 1133/1133 (removed 0) transitions.
// Phase 1: matrix 1133 rows 736 cols
[2022-05-14 17:16:17] [INFO ] Computed 4 place invariants in 6 ms
[2022-05-14 17:16:17] [INFO ] Implicit Places using invariants in 224 ms returned []
// Phase 1: matrix 1133 rows 736 cols
[2022-05-14 17:16:17] [INFO ] Computed 4 place invariants in 6 ms
[2022-05-14 17:16:18] [INFO ] Implicit Places using invariants and state equation in 1014 ms returned []
Implicit Place search using SMT with State Equation took 1241 ms to find 0 implicit places.
// Phase 1: matrix 1133 rows 736 cols
[2022-05-14 17:16:18] [INFO ] Computed 4 place invariants in 5 ms
[2022-05-14 17:16:19] [INFO ] Dead Transitions using invariants and state equation in 843 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 736/736 places, 1133/1133 transitions.
Computed a total of 106 stabilizing places and 322 stable transitions
Graph (complete) has 2016 edges and 736 vertex of which 730 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Computed a total of 106 stabilizing places and 322 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p3) (NOT p2)), (X (OR (AND (NOT p1) p0) (AND p1 (NOT p0)))), (X (NOT p3)), (X (NOT (AND (NOT p0) p3))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p3))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND p0 (NOT p2) (NOT p3))), (X (X (OR (AND (NOT p1) p0) (AND p1 (NOT p0))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3)))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND p0 (NOT p2) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 923 ms. Reduced automaton from 6 states, 17 edges and 4 AP to 6 states, 17 edges and 4 AP.
Stuttering acceptance computed with spot in 305 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p0) p1)), (OR (AND p0 (NOT p1) p3) (AND (NOT p0) p1 p3)), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 p3), (AND (NOT p0) p1 p3)]
Incomplete random walk after 10000 steps, including 83 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 12) seen :7
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1133 rows 736 cols
[2022-05-14 17:16:21] [INFO ] Computed 4 place invariants in 6 ms
[2022-05-14 17:16:21] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2022-05-14 17:16:22] [INFO ] After 724ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-14 17:16:22] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2022-05-14 17:16:23] [INFO ] After 694ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2022-05-14 17:16:23] [INFO ] After 1037ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 214 ms.
[2022-05-14 17:16:23] [INFO ] After 1490ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 3 properties in 12 ms.
Support contains 4 out of 736 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 736/736 places, 1133/1133 transitions.
Graph (trivial) has 764 edges and 736 vertex of which 273 / 736 are part of one of the 32 SCC in 1 ms
Free SCC test removed 241 places
Drop transitions removed 314 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 315 transitions.
Graph (complete) has 1592 edges and 495 vertex of which 489 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 0 with 212 rules applied. Total rules applied 214 place count 489 transition count 606
Reduce places removed 204 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 205 rules applied. Total rules applied 419 place count 285 transition count 605
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 420 place count 284 transition count 605
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 420 place count 284 transition count 558
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 514 place count 237 transition count 558
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 518 place count 233 transition count 554
Iterating global reduction 3 with 4 rules applied. Total rules applied 522 place count 233 transition count 554
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 522 place count 233 transition count 550
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 530 place count 229 transition count 550
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 660 place count 164 transition count 485
Performed 31 Post agglomeration using F-continuation condition with reduction of 32 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 722 place count 133 transition count 647
Drop transitions removed 13 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 3 with 40 rules applied. Total rules applied 762 place count 133 transition count 607
Drop transitions removed 123 transitions
Redundant transition composition rules discarded 123 transitions
Iterating global reduction 4 with 123 rules applied. Total rules applied 885 place count 133 transition count 484
Free-agglomeration rule applied 37 times with reduction of 8 identical transitions.
Iterating global reduction 4 with 37 rules applied. Total rules applied 922 place count 133 transition count 439
Reduce places removed 37 places and 0 transitions.
Drop transitions removed 43 transitions
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 4 with 113 rules applied. Total rules applied 1035 place count 96 transition count 363
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1038 place count 93 transition count 348
Iterating global reduction 5 with 3 rules applied. Total rules applied 1041 place count 93 transition count 348
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 5 with 36 rules applied. Total rules applied 1077 place count 93 transition count 312
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1079 place count 93 transition count 312
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1080 place count 92 transition count 311
Applied a total of 1080 rules in 116 ms. Remains 92 /736 variables (removed 644) and now considering 311/1133 (removed 822) transitions.
Finished structural reductions, in 1 iterations. Remains : 92/736 places, 311/1133 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished probabilistic random walk after 10270 steps, run visited all 1 properties in 49 ms. (steps per millisecond=209 )
Probabilistic random walk after 10270 steps, saw 2198 distinct states, run finished after 50 ms. (steps per millisecond=205 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p3) (NOT p2)), (X (OR (AND (NOT p1) p0) (AND p1 (NOT p0)))), (X (NOT p3)), (X (NOT (AND (NOT p0) p3))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p3))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND p0 (NOT p2) (NOT p3))), (X (X (OR (AND (NOT p1) p0) (AND p1 (NOT p0))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3)))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND p0 (NOT p2) (NOT p3)))), (G (OR (AND (NOT p0) p1) (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p3)), (F (NOT (AND (NOT p3) (NOT p1)))), (F (AND (NOT p0) (NOT p3))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F (AND p3 (NOT p1))), (F (NOT (AND p0 (NOT p1)))), (F (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3)))), (F p3), (F (NOT (AND p0 (NOT p3)))), (F (AND p0 p3))]
Knowledge based reduction with 22 factoid took 1661 ms. Reduced automaton from 6 states, 17 edges and 4 AP to 6 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 240 ms :[true, p3, p1, p1, (AND p1 p3), (AND p1 p3)]
Stuttering acceptance computed with spot in 189 ms :[true, p3, p1, p1, (AND p1 p3), (AND p1 p3)]
Stuttering acceptance computed with spot in 190 ms :[true, p3, p1, p1, (AND p1 p3), (AND p1 p3)]
Product exploration explored 100000 steps with 783 reset in 359 ms.
Product exploration explored 100000 steps with 776 reset in 395 ms.
Built C files in :
/tmp/ltsmin7000969207813364937
[2022-05-14 17:16:26] [INFO ] Computing symmetric may disable matrix : 1133 transitions.
[2022-05-14 17:16:26] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 17:16:26] [INFO ] Computing symmetric may enable matrix : 1133 transitions.
[2022-05-14 17:16:26] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 17:16:27] [INFO ] Computing Do-Not-Accords matrix : 1133 transitions.
[2022-05-14 17:16:27] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 17:16:27] [INFO ] Built C files in 203ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7000969207813364937
Running compilation step : cd /tmp/ltsmin7000969207813364937;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7000969207813364937;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7000969207813364937;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 736/736 places, 1133/1133 transitions.
Graph (trivial) has 764 edges and 736 vertex of which 273 / 736 are part of one of the 32 SCC in 0 ms
Free SCC test removed 241 places
Ensure Unique test removed 274 transitions
Reduce isomorphic transitions removed 274 transitions.
Graph (complete) has 1692 edges and 495 vertex of which 489 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 202 place count 488 transition count 656
Reduce places removed 200 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 201 rules applied. Total rules applied 403 place count 288 transition count 655
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 404 place count 287 transition count 655
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 404 place count 287 transition count 612
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 490 place count 244 transition count 612
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 642 place count 168 transition count 536
Performed 26 Post agglomeration using F-continuation condition with reduction of 32 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 694 place count 142 transition count 663
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 723 place count 142 transition count 634
Drop transitions removed 82 transitions
Redundant transition composition rules discarded 82 transitions
Iterating global reduction 4 with 82 rules applied. Total rules applied 805 place count 142 transition count 552
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 806 place count 141 transition count 551
Applied a total of 806 rules in 104 ms. Remains 141 /736 variables (removed 595) and now considering 551/1133 (removed 582) transitions.
[2022-05-14 17:16:30] [INFO ] Flow matrix only has 424 transitions (discarded 127 similar events)
// Phase 1: matrix 424 rows 141 cols
[2022-05-14 17:16:30] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 17:16:30] [INFO ] Implicit Places using invariants in 294 ms returned []
[2022-05-14 17:16:30] [INFO ] Flow matrix only has 424 transitions (discarded 127 similar events)
// Phase 1: matrix 424 rows 141 cols
[2022-05-14 17:16:30] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 17:16:31] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-14 17:16:31] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 1000 ms to find 0 implicit places.
[2022-05-14 17:16:33] [INFO ] Redundant transitions in 2013 ms returned []
[2022-05-14 17:16:33] [INFO ] Flow matrix only has 424 transitions (discarded 127 similar events)
// Phase 1: matrix 424 rows 141 cols
[2022-05-14 17:16:33] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 17:16:33] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/736 places, 551/1133 transitions.
Finished structural reductions, in 1 iterations. Remains : 141/736 places, 551/1133 transitions.
Built C files in :
/tmp/ltsmin10804883088955581832
[2022-05-14 17:16:33] [INFO ] Computing symmetric may disable matrix : 551 transitions.
[2022-05-14 17:16:33] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 17:16:33] [INFO ] Computing symmetric may enable matrix : 551 transitions.
[2022-05-14 17:16:33] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 17:16:33] [INFO ] Computing Do-Not-Accords matrix : 551 transitions.
[2022-05-14 17:16:33] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 17:16:33] [INFO ] Built C files in 167ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10804883088955581832
Running compilation step : cd /tmp/ltsmin10804883088955581832;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2389 ms.
Running link step : cd /tmp/ltsmin10804883088955581832;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin10804883088955581832;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1023947891608123863.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-14 17:16:48] [INFO ] Flatten gal took : 59 ms
[2022-05-14 17:16:48] [INFO ] Flatten gal took : 58 ms
[2022-05-14 17:16:48] [INFO ] Time to serialize gal into /tmp/LTL13554615873032701702.gal : 17 ms
[2022-05-14 17:16:48] [INFO ] Time to serialize properties into /tmp/LTL9342756062449945935.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13554615873032701702.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9342756062449945935.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1355461...267
Read 1 LTL properties
Checking formula 0 : !((G((X("(p599==0)"))||(!((F("(p599==1)"))U(("(p443==1)")U("(((p323==1)&&(p631==1))&&(p443==1))")))))))
Formula 0 simplified : !G(X"(p599==0)" | !(F"(p599==1)" U ("(p443==1)" U "(((p323==1)&&(p631==1))&&(p443==1))")))
Detected timeout of ITS tools.
[2022-05-14 17:17:04] [INFO ] Flatten gal took : 64 ms
[2022-05-14 17:17:04] [INFO ] Applying decomposition
[2022-05-14 17:17:04] [INFO ] Flatten gal took : 58 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3223208357983468999.txt' '-o' '/tmp/graph3223208357983468999.bin' '-w' '/tmp/graph3223208357983468999.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3223208357983468999.bin' '-l' '-1' '-v' '-w' '/tmp/graph3223208357983468999.weights' '-q' '0' '-e' '0.001'
[2022-05-14 17:17:04] [INFO ] Decomposing Gal with order
[2022-05-14 17:17:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 17:17:04] [INFO ] Removed a total of 1065 redundant transitions.
[2022-05-14 17:17:04] [INFO ] Flatten gal took : 198 ms
[2022-05-14 17:17:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 34 ms.
[2022-05-14 17:17:04] [INFO ] Time to serialize gal into /tmp/LTL12919350131668971607.gal : 18 ms
[2022-05-14 17:17:04] [INFO ] Time to serialize properties into /tmp/LTL15601529934612853067.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12919350131668971607.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15601529934612853067.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1291935...247
Read 1 LTL properties
Checking formula 0 : !((G((X("(i11.i0.i0.u130.p599==0)"))||(!((F("(i11.i0.i0.u130.p599==1)"))U(("(i7.u95.p443==1)")U("(((i21.u69.p323==1)&&(i11.i0.i1.u133....191
Formula 0 simplified : !G(X"(i11.i0.i0.u130.p599==0)" | !(F"(i11.i0.i0.u130.p599==1)" U ("(i7.u95.p443==1)" U "(((i21.u69.p323==1)&&(i11.i0.i1.u133.p631==1...180
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6376724611500959996
[2022-05-14 17:17:19] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6376724611500959996
Running compilation step : cd /tmp/ltsmin6376724611500959996;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6376724611500959996;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6376724611500959996;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CloudDeployment-PT-4b-LTLFireability-10 finished in 78789 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(!p0) U p1))||G(p0)))'
Support contains 6 out of 764 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 764/764 places, 1399/1399 transitions.
Graph (trivial) has 781 edges and 764 vertex of which 278 / 764 are part of one of the 31 SCC in 1 ms
Free SCC test removed 247 places
Ensure Unique test removed 282 transitions
Reduce isomorphic transitions removed 282 transitions.
Graph (complete) has 1836 edges and 517 vertex of which 494 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.2 ms
Discarding 23 places :
Also discarding 257 output transitions
Drop transitions removed 257 transitions
Drop transitions removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 207 rules applied. Total rules applied 209 place count 494 transition count 653
Reduce places removed 207 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 210 rules applied. Total rules applied 419 place count 287 transition count 650
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 421 place count 285 transition count 650
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 421 place count 285 transition count 609
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 503 place count 244 transition count 609
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 506 place count 241 transition count 606
Iterating global reduction 3 with 3 rules applied. Total rules applied 509 place count 241 transition count 606
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 510 place count 241 transition count 605
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 660 place count 166 transition count 530
Performed 24 Post agglomeration using F-continuation condition with reduction of 32 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 708 place count 142 transition count 646
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 732 place count 142 transition count 622
Drop transitions removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 5 with 60 rules applied. Total rules applied 792 place count 142 transition count 562
Applied a total of 792 rules in 86 ms. Remains 142 /764 variables (removed 622) and now considering 562/1399 (removed 837) transitions.
[2022-05-14 17:17:23] [INFO ] Flow matrix only has 436 transitions (discarded 126 similar events)
// Phase 1: matrix 436 rows 142 cols
[2022-05-14 17:17:23] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 17:17:23] [INFO ] Implicit Places using invariants in 117 ms returned []
[2022-05-14 17:17:23] [INFO ] Flow matrix only has 436 transitions (discarded 126 similar events)
// Phase 1: matrix 436 rows 142 cols
[2022-05-14 17:17:23] [INFO ] Computed 4 place invariants in 7 ms
[2022-05-14 17:17:23] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-14 17:17:23] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
[2022-05-14 17:17:24] [INFO ] Redundant transitions in 538 ms returned []
[2022-05-14 17:17:24] [INFO ] Flow matrix only has 436 transitions (discarded 126 similar events)
// Phase 1: matrix 436 rows 142 cols
[2022-05-14 17:17:24] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 17:17:24] [INFO ] Dead Transitions using invariants and state equation in 541 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/764 places, 562/1399 transitions.
Finished structural reductions, in 1 iterations. Remains : 142/764 places, 562/1399 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudDeployment-PT-4b-LTLFireability-11 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:(EQ s2 1), p0:(AND (EQ s90 1) (EQ s96 1) (EQ s101 1) (EQ s131 1) (EQ s140 1))], 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 28579 reset in 265 ms.
Product exploration explored 100000 steps with 28591 reset in 414 ms.
Computed a total of 44 stabilizing places and 336 stable transitions
Computed a total of 44 stabilizing places and 336 stable transitions
Detected a total of 44/142 stabilizing places and 336/562 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 6 factoid took 357 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 6 factoid took 455 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p1)]
[2022-05-14 17:17:26] [INFO ] Flow matrix only has 436 transitions (discarded 126 similar events)
// Phase 1: matrix 436 rows 142 cols
[2022-05-14 17:17:26] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 17:17:26] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-14 17:17:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 17:17:26] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2022-05-14 17:17:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 17:17:27] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-14 17:17:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 17:17:27] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2022-05-14 17:17:27] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-14 17:17:27] [INFO ] [Nat]Added 120 Read/Feed constraints in 44 ms returned sat
[2022-05-14 17:17:27] [INFO ] Computed and/alt/rep : 226/928/226 causal constraints (skipped 209 transitions) in 108 ms.
[2022-05-14 17:17:27] [INFO ] Added : 27 causal constraints over 6 iterations in 405 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 142 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 : 142/142 places, 562/562 transitions.
Applied a total of 0 rules in 11 ms. Remains 142 /142 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2022-05-14 17:17:27] [INFO ] Flow matrix only has 436 transitions (discarded 126 similar events)
// Phase 1: matrix 436 rows 142 cols
[2022-05-14 17:17:27] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 17:17:27] [INFO ] Implicit Places using invariants in 125 ms returned []
[2022-05-14 17:17:27] [INFO ] Flow matrix only has 436 transitions (discarded 126 similar events)
// Phase 1: matrix 436 rows 142 cols
[2022-05-14 17:17:27] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 17:17:28] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-14 17:17:28] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
[2022-05-14 17:17:29] [INFO ] Redundant transitions in 594 ms returned []
[2022-05-14 17:17:29] [INFO ] Flow matrix only has 436 transitions (discarded 126 similar events)
// Phase 1: matrix 436 rows 142 cols
[2022-05-14 17:17:29] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 17:17:29] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 142/142 places, 562/562 transitions.
Computed a total of 44 stabilizing places and 336 stable transitions
Computed a total of 44 stabilizing places and 336 stable transitions
Detected a total of 44/142 stabilizing places and 336/562 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
[2022-05-14 17:17:29] [INFO ] Flow matrix only has 436 transitions (discarded 126 similar events)
// Phase 1: matrix 436 rows 142 cols
[2022-05-14 17:17:29] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 17:17:30] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-14 17:17:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 17:17:30] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2022-05-14 17:17:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 17:17:30] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2022-05-14 17:17:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 17:17:30] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2022-05-14 17:17:30] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-14 17:17:30] [INFO ] [Nat]Added 120 Read/Feed constraints in 43 ms returned sat
[2022-05-14 17:17:30] [INFO ] Computed and/alt/rep : 226/928/226 causal constraints (skipped 209 transitions) in 65 ms.
[2022-05-14 17:17:31] [INFO ] Added : 27 causal constraints over 6 iterations in 333 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Product exploration explored 100000 steps with 28579 reset in 453 ms.
Product exploration explored 100000 steps with 28573 reset in 411 ms.
Built C files in :
/tmp/ltsmin13355620992200874455
[2022-05-14 17:17:32] [INFO ] Computing symmetric may disable matrix : 562 transitions.
[2022-05-14 17:17:32] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 17:17:32] [INFO ] Computing symmetric may enable matrix : 562 transitions.
[2022-05-14 17:17:32] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 17:17:32] [INFO ] Computing Do-Not-Accords matrix : 562 transitions.
[2022-05-14 17:17:32] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 17:17:32] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13355620992200874455
Running compilation step : cd /tmp/ltsmin13355620992200874455;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2403 ms.
Running link step : cd /tmp/ltsmin13355620992200874455;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin13355620992200874455;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10058774916506205158.hoa' '--buchi-type=spotba'
LTSmin run took 901 ms.
FORMULA CloudDeployment-PT-4b-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-4b-LTLFireability-11 finished in 12591 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 out of 764 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 764/764 places, 1399/1399 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 763 transition count 1399
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 746 transition count 1135
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 746 transition count 1135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 746 transition count 1134
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 745 transition count 1133
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 745 transition count 1133
Applied a total of 38 rules in 79 ms. Remains 745 /764 variables (removed 19) and now considering 1133/1399 (removed 266) transitions.
// Phase 1: matrix 1133 rows 745 cols
[2022-05-14 17:17:35] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-14 17:17:35] [INFO ] Implicit Places using invariants in 244 ms returned []
// Phase 1: matrix 1133 rows 745 cols
[2022-05-14 17:17:35] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-14 17:17:37] [INFO ] Implicit Places using invariants and state equation in 1935 ms returned [10, 18, 184, 192, 357, 365, 532, 540]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 2201 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 737/764 places, 1133/1399 transitions.
Applied a total of 0 rules in 19 ms. Remains 737 /737 variables (removed 0) and now considering 1133/1133 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 737/764 places, 1133/1399 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-4b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s460 0)], 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]]
Product exploration explored 100000 steps with 793 reset in 248 ms.
Product exploration explored 100000 steps with 787 reset in 266 ms.
Computed a total of 108 stabilizing places and 324 stable transitions
Graph (complete) has 2015 edges and 737 vertex of which 731 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Computed a total of 108 stabilizing places and 324 stable transitions
Detected a total of 108/737 stabilizing places and 324/1133 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 266 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 80 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 423089 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :{}
Probabilistic random walk after 423089 steps, saw 97605 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1133 rows 737 cols
[2022-05-14 17:17:41] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-14 17:17:42] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-14 17:17:42] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2022-05-14 17:17:42] [INFO ] After 493ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-14 17:17:42] [INFO ] After 574ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2022-05-14 17:17:42] [INFO ] After 767ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 1133/1133 transitions.
Graph (trivial) has 770 edges and 737 vertex of which 284 / 737 are part of one of the 32 SCC in 1 ms
Free SCC test removed 252 places
Drop transitions removed 330 transitions
Reduce isomorphic transitions removed 330 transitions.
Graph (complete) has 1577 edges and 485 vertex of which 479 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 203 transitions
Trivial Post-agglo rules discarded 203 transitions
Performed 203 trivial Post agglomeration. Transition count delta: 203
Iterating post reduction 0 with 211 rules applied. Total rules applied 213 place count 479 transition count 592
Reduce places removed 203 places and 0 transitions.
Iterating post reduction 1 with 203 rules applied. Total rules applied 416 place count 276 transition count 592
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 416 place count 276 transition count 547
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 506 place count 231 transition count 547
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 510 place count 227 transition count 543
Iterating global reduction 2 with 4 rules applied. Total rules applied 514 place count 227 transition count 543
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 514 place count 227 transition count 539
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 522 place count 223 transition count 539
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 650 place count 159 transition count 475
Performed 28 Post agglomeration using F-continuation condition with reduction of 32 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 706 place count 131 transition count 611
Drop transitions removed 12 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 734 place count 131 transition count 583
Drop transitions removed 104 transitions
Redundant transition composition rules discarded 104 transitions
Iterating global reduction 3 with 104 rules applied. Total rules applied 838 place count 131 transition count 479
Free-agglomeration rule applied 40 times with reduction of 12 identical transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 878 place count 131 transition count 427
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 60 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 88 transitions.
Graph (complete) has 628 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 129 rules applied. Total rules applied 1007 place count 90 transition count 339
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1008 place count 90 transition count 338
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1011 place count 87 transition count 323
Iterating global reduction 5 with 3 rules applied. Total rules applied 1014 place count 87 transition count 323
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 5 with 48 rules applied. Total rules applied 1062 place count 87 transition count 275
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1063 place count 86 transition count 274
Applied a total of 1063 rules in 103 ms. Remains 86 /737 variables (removed 651) and now considering 274/1133 (removed 859) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/737 places, 274/1133 transitions.
Finished random walk after 290 steps, including 5 resets, run visited all 1 properties in 2 ms. (steps per millisecond=145 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 192 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 737/737 places, 1133/1133 transitions.
Applied a total of 0 rules in 24 ms. Remains 737 /737 variables (removed 0) and now considering 1133/1133 (removed 0) transitions.
// Phase 1: matrix 1133 rows 737 cols
[2022-05-14 17:17:43] [INFO ] Computed 4 place invariants in 7 ms
[2022-05-14 17:17:43] [INFO ] Implicit Places using invariants in 270 ms returned []
// Phase 1: matrix 1133 rows 737 cols
[2022-05-14 17:17:43] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-14 17:17:44] [INFO ] Implicit Places using invariants and state equation in 1011 ms returned []
Implicit Place search using SMT with State Equation took 1283 ms to find 0 implicit places.
// Phase 1: matrix 1133 rows 737 cols
[2022-05-14 17:17:44] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-14 17:17:45] [INFO ] Dead Transitions using invariants and state equation in 868 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 737/737 places, 1133/1133 transitions.
Computed a total of 108 stabilizing places and 324 stable transitions
Graph (complete) has 2015 edges and 737 vertex of which 731 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Computed a total of 108 stabilizing places and 324 stable transitions
Detected a total of 108/737 stabilizing places and 324/1133 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 176 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 77 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 406688 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :{}
Probabilistic random walk after 406688 steps, saw 93284 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1133 rows 737 cols
[2022-05-14 17:17:48] [INFO ] Computed 4 place invariants in 6 ms
[2022-05-14 17:17:49] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-14 17:17:49] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2022-05-14 17:17:49] [INFO ] After 505ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-14 17:17:49] [INFO ] After 595ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2022-05-14 17:17:49] [INFO ] After 782ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 1133/1133 transitions.
Graph (trivial) has 770 edges and 737 vertex of which 284 / 737 are part of one of the 32 SCC in 0 ms
Free SCC test removed 252 places
Drop transitions removed 330 transitions
Reduce isomorphic transitions removed 330 transitions.
Graph (complete) has 1577 edges and 485 vertex of which 479 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 203 transitions
Trivial Post-agglo rules discarded 203 transitions
Performed 203 trivial Post agglomeration. Transition count delta: 203
Iterating post reduction 0 with 211 rules applied. Total rules applied 213 place count 479 transition count 592
Reduce places removed 203 places and 0 transitions.
Iterating post reduction 1 with 203 rules applied. Total rules applied 416 place count 276 transition count 592
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 416 place count 276 transition count 547
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 506 place count 231 transition count 547
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 510 place count 227 transition count 543
Iterating global reduction 2 with 4 rules applied. Total rules applied 514 place count 227 transition count 543
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 514 place count 227 transition count 539
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 522 place count 223 transition count 539
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 650 place count 159 transition count 475
Performed 28 Post agglomeration using F-continuation condition with reduction of 32 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 706 place count 131 transition count 611
Drop transitions removed 12 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 734 place count 131 transition count 583
Drop transitions removed 104 transitions
Redundant transition composition rules discarded 104 transitions
Iterating global reduction 3 with 104 rules applied. Total rules applied 838 place count 131 transition count 479
Free-agglomeration rule applied 40 times with reduction of 12 identical transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 878 place count 131 transition count 427
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 60 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 88 transitions.
Graph (complete) has 628 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 129 rules applied. Total rules applied 1007 place count 90 transition count 339
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1008 place count 90 transition count 338
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1011 place count 87 transition count 323
Iterating global reduction 5 with 3 rules applied. Total rules applied 1014 place count 87 transition count 323
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 5 with 48 rules applied. Total rules applied 1062 place count 87 transition count 275
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1063 place count 86 transition count 274
Applied a total of 1063 rules in 120 ms. Remains 86 /737 variables (removed 651) and now considering 274/1133 (removed 859) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/737 places, 274/1133 transitions.
Finished random walk after 2542 steps, including 43 resets, run visited all 1 properties in 10 ms. (steps per millisecond=254 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 256 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 286 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 791 reset in 339 ms.
Product exploration explored 100000 steps with 792 reset in 231 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 737/737 places, 1133/1133 transitions.
Graph (trivial) has 770 edges and 737 vertex of which 284 / 737 are part of one of the 32 SCC in 5 ms
Free SCC test removed 252 places
Ensure Unique test removed 288 transitions
Reduce isomorphic transitions removed 288 transitions.
Graph (complete) has 1677 edges and 485 vertex of which 479 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 199 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 199 rules applied. Total rules applied 201 place count 479 transition count 843
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 28 Pre rules applied. Total rules applied 201 place count 479 transition count 867
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 229 place count 479 transition count 867
Discarding 106 places :
Symmetric choice reduction at 1 with 106 rule applications. Total rules 335 place count 373 transition count 761
Deduced a syphon composed of 121 places in 1 ms
Iterating global reduction 1 with 106 rules applied. Total rules applied 441 place count 373 transition count 761
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 202 places in 1 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 522 place count 373 transition count 761
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 583 place count 312 transition count 700
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 1 with 61 rules applied. Total rules applied 644 place count 312 transition count 700
Performed 28 Post agglomeration using F-continuation condition with reduction of 32 identical transitions.
Deduced a syphon composed of 169 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 672 place count 312 transition count 892
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 676 place count 312 transition count 888
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 708 place count 280 transition count 788
Deduced a syphon composed of 137 places in 0 ms
Iterating global reduction 2 with 32 rules applied. Total rules applied 740 place count 280 transition count 788
Deduced a syphon composed of 137 places in 0 ms
Drop transitions removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 2 with 60 rules applied. Total rules applied 800 place count 280 transition count 728
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 808 place count 272 transition count 720
Deduced a syphon composed of 129 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 816 place count 272 transition count 720
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 133 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 820 place count 272 transition count 804
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 828 place count 264 transition count 772
Deduced a syphon composed of 125 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 836 place count 264 transition count 772
Deduced a syphon composed of 125 places in 0 ms
Drop transitions removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 2 with 64 rules applied. Total rules applied 900 place count 264 transition count 708
Deduced a syphon composed of 125 places in 0 ms
Applied a total of 900 rules in 161 ms. Remains 264 /737 variables (removed 473) and now considering 708/1133 (removed 425) transitions.
[2022-05-14 17:17:52] [INFO ] Redundant transitions in 657 ms returned []
[2022-05-14 17:17:52] [INFO ] Flow matrix only has 581 transitions (discarded 127 similar events)
// Phase 1: matrix 581 rows 264 cols
[2022-05-14 17:17:52] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 17:17:53] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 264/737 places, 708/1133 transitions.
Finished structural reductions, in 1 iterations. Remains : 264/737 places, 708/1133 transitions.
Product exploration explored 100000 steps with 3773 reset in 569 ms.
Product exploration explored 100000 steps with 3787 reset in 623 ms.
Built C files in :
/tmp/ltsmin2558632889603591575
[2022-05-14 17:17:54] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2558632889603591575
Running compilation step : cd /tmp/ltsmin2558632889603591575;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2558632889603591575;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2558632889603591575;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 737/737 places, 1133/1133 transitions.
Applied a total of 0 rules in 16 ms. Remains 737 /737 variables (removed 0) and now considering 1133/1133 (removed 0) transitions.
// Phase 1: matrix 1133 rows 737 cols
[2022-05-14 17:17:57] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-14 17:17:57] [INFO ] Implicit Places using invariants in 214 ms returned []
// Phase 1: matrix 1133 rows 737 cols
[2022-05-14 17:17:57] [INFO ] Computed 4 place invariants in 9 ms
[2022-05-14 17:17:58] [INFO ] Implicit Places using invariants and state equation in 886 ms returned []
Implicit Place search using SMT with State Equation took 1102 ms to find 0 implicit places.
// Phase 1: matrix 1133 rows 737 cols
[2022-05-14 17:17:58] [INFO ] Computed 4 place invariants in 6 ms
[2022-05-14 17:17:59] [INFO ] Dead Transitions using invariants and state equation in 808 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 737/737 places, 1133/1133 transitions.
Built C files in :
/tmp/ltsmin9465618420610594723
[2022-05-14 17:17:59] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9465618420610594723
Running compilation step : cd /tmp/ltsmin9465618420610594723;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9465618420610594723;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9465618420610594723;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-14 17:18:02] [INFO ] Flatten gal took : 97 ms
[2022-05-14 17:18:02] [INFO ] Flatten gal took : 78 ms
[2022-05-14 17:18:02] [INFO ] Time to serialize gal into /tmp/LTL11742485876944465622.gal : 15 ms
[2022-05-14 17:18:02] [INFO ] Time to serialize properties into /tmp/LTL14160827899593610459.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11742485876944465622.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14160827899593610459.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1174248...268
Read 1 LTL properties
Checking formula 0 : !((G(X("(p765==0)"))))
Formula 0 simplified : !GX"(p765==0)"
Detected timeout of ITS tools.
[2022-05-14 17:18:17] [INFO ] Flatten gal took : 47 ms
[2022-05-14 17:18:17] [INFO ] Applying decomposition
[2022-05-14 17:18:17] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17361895148232473062.txt' '-o' '/tmp/graph17361895148232473062.bin' '-w' '/tmp/graph17361895148232473062.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17361895148232473062.bin' '-l' '-1' '-v' '-w' '/tmp/graph17361895148232473062.weights' '-q' '0' '-e' '0.001'
[2022-05-14 17:18:17] [INFO ] Decomposing Gal with order
[2022-05-14 17:18:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 17:18:18] [INFO ] Removed a total of 1225 redundant transitions.
[2022-05-14 17:18:18] [INFO ] Flatten gal took : 99 ms
[2022-05-14 17:18:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 25 ms.
[2022-05-14 17:18:18] [INFO ] Time to serialize gal into /tmp/LTL13155800400108116463.gal : 12 ms
[2022-05-14 17:18:18] [INFO ] Time to serialize properties into /tmp/LTL9323378847669743071.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13155800400108116463.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9323378847669743071.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1315580...246
Read 1 LTL properties
Checking formula 0 : !((G(X("(i13.u172.p765==0)"))))
Formula 0 simplified : !GX"(i13.u172.p765==0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11981148416082455459
[2022-05-14 17:18:33] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11981148416082455459
Running compilation step : cd /tmp/ltsmin11981148416082455459;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11981148416082455459;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11981148416082455459;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CloudDeployment-PT-4b-LTLFireability-12 finished in 60643 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 3 out of 764 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 764/764 places, 1399/1399 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 763 transition count 1399
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 746 transition count 1135
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 746 transition count 1135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 746 transition count 1134
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 744 transition count 1132
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 744 transition count 1132
Applied a total of 40 rules in 63 ms. Remains 744 /764 variables (removed 20) and now considering 1132/1399 (removed 267) transitions.
// Phase 1: matrix 1132 rows 744 cols
[2022-05-14 17:18:36] [INFO ] Computed 12 place invariants in 6 ms
[2022-05-14 17:18:36] [INFO ] Implicit Places using invariants in 319 ms returned []
// Phase 1: matrix 1132 rows 744 cols
[2022-05-14 17:18:36] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-14 17:18:37] [INFO ] Implicit Places using invariants and state equation in 1176 ms returned [10, 18, 185, 193, 358, 366, 531, 539]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 1499 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 736/764 places, 1132/1399 transitions.
Applied a total of 0 rules in 17 ms. Remains 736 /736 variables (removed 0) and now considering 1132/1132 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 736/764 places, 1132/1399 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-4b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s165 1) (EQ s196 0) (EQ s367 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 998 ms.
Product exploration explored 100000 steps with 50000 reset in 973 ms.
Computed a total of 107 stabilizing places and 323 stable transitions
Graph (complete) has 2014 edges and 736 vertex of which 730 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Computed a total of 107 stabilizing places and 323 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA CloudDeployment-PT-4b-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-4b-LTLFireability-14 finished in 3741 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(p1)))'
Support contains 2 out of 764 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 764/764 places, 1399/1399 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 763 transition count 1399
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 747 transition count 1136
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 747 transition count 1136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 747 transition count 1135
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 746 transition count 1134
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 746 transition count 1134
Applied a total of 36 rules in 54 ms. Remains 746 /764 variables (removed 18) and now considering 1134/1399 (removed 265) transitions.
// Phase 1: matrix 1134 rows 746 cols
[2022-05-14 17:18:40] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-14 17:18:40] [INFO ] Implicit Places using invariants in 301 ms returned []
// Phase 1: matrix 1134 rows 746 cols
[2022-05-14 17:18:40] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-14 17:18:41] [INFO ] Implicit Places using invariants and state equation in 964 ms returned [10, 18, 186, 194, 360, 368, 533, 541]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 1268 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 738/764 places, 1134/1399 transitions.
Applied a total of 0 rules in 15 ms. Remains 738 /738 variables (removed 0) and now considering 1134/1134 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 738/764 places, 1134/1399 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-4b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s163 1), p1:(EQ s267 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 95 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-4b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-4b-LTLFireability-15 finished in 1470 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||!(F(p1) U (p2 U p3)))))'
Found a SL insensitive property : CloudDeployment-PT-4b-LTLFireability-10
Stuttering acceptance computed with spot in 401 ms :[(AND (NOT p0) p3), (NOT p0), (AND (NOT p0) p1 p3), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) p3), true, p1, p3, (AND p0 p3), (AND p0 p1 p3)]
Support contains 4 out of 764 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 764/764 places, 1399/1399 transitions.
Graph (trivial) has 782 edges and 764 vertex of which 275 / 764 are part of one of the 32 SCC in 1 ms
Free SCC test removed 243 places
Ensure Unique test removed 275 transitions
Reduce isomorphic transitions removed 275 transitions.
Graph (complete) has 1838 edges and 521 vertex of which 498 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.4 ms
Discarding 23 places :
Also discarding 257 output transitions
Drop transitions removed 257 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 207 rules applied. Total rules applied 209 place count 497 transition count 659
Reduce places removed 207 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 209 rules applied. Total rules applied 418 place count 290 transition count 657
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 420 place count 289 transition count 656
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 421 place count 288 transition count 656
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 43 Pre rules applied. Total rules applied 421 place count 288 transition count 613
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 507 place count 245 transition count 613
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 509 place count 243 transition count 611
Iterating global reduction 4 with 2 rules applied. Total rules applied 511 place count 243 transition count 611
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 661 place count 168 transition count 536
Performed 26 Post agglomeration using F-continuation condition with reduction of 32 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 713 place count 142 transition count 663
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 742 place count 142 transition count 634
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 747 place count 142 transition count 629
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 748 place count 141 transition count 628
Applied a total of 748 rules in 65 ms. Remains 141 /764 variables (removed 623) and now considering 628/1399 (removed 771) transitions.
[2022-05-14 17:18:42] [INFO ] Flow matrix only has 501 transitions (discarded 127 similar events)
// Phase 1: matrix 501 rows 141 cols
[2022-05-14 17:18:42] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 17:18:42] [INFO ] Implicit Places using invariants in 202 ms returned []
[2022-05-14 17:18:42] [INFO ] Flow matrix only has 501 transitions (discarded 127 similar events)
// Phase 1: matrix 501 rows 141 cols
[2022-05-14 17:18:42] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 17:18:42] [INFO ] State equation strengthened by 24 read => feed constraints.
[2022-05-14 17:18:42] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
[2022-05-14 17:18:42] [INFO ] Flow matrix only has 501 transitions (discarded 127 similar events)
// Phase 1: matrix 501 rows 141 cols
[2022-05-14 17:18:42] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 17:18:42] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 141/764 places, 628/1399 transitions.
Finished structural reductions, in 1 iterations. Remains : 141/764 places, 628/1399 transitions.
Running random walk in product with property : CloudDeployment-PT-4b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p3, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 p3 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p3 (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 9}], [{ cond=(AND (NOT p1) p3 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=(AND p3 (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=4 dest: 9}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 5}, { cond=(NOT p1), acceptance={} source=6 dest: 6}], [{ cond=p3, acceptance={} source=7 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={} source=7 dest: 7}], [{ cond=(AND p3 p0), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={} source=8 dest: 7}, { cond=(AND p1 (NOT p3) p0), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=8 dest: 9}], [{ cond=(AND p1 p3 p0), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p1) p3 p0), acceptance={} source=9 dest: 6}, { cond=(AND p1 (NOT p3) p0), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=9 dest: 9}]], initial=0, aps=[p3:(AND (EQ s31 1) (EQ s67 1) (EQ s50 1)), p1:(EQ s62 1), p2:(EQ s50 1), p0:(EQ s62 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33365 reset in 524 ms.
Product exploration explored 100000 steps with 33378 reset in 575 ms.
Computed a total of 40 stabilizing places and 392 stable transitions
Computed a total of 40 stabilizing places and 392 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) p3 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0)))), (X p0), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (NOT (AND p1 p3 (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p0)))), true, (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (AND (NOT p1) (NOT p3) p0))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 1035 ms. Reduced automaton from 10 states, 29 edges and 4 AP to 10 states, 29 edges and 4 AP.
Stuttering acceptance computed with spot in 370 ms :[(AND (NOT p0) p3), (NOT p0), (AND (NOT p0) p1 p3), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) p3), true, p1, p3, (AND p0 p3), (AND p0 p1 p3)]
Incomplete random walk after 10000 steps, including 441 resets, run finished after 638 ms. (steps per millisecond=15 ) properties (out of 20) seen :6
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2022-05-14 17:18:46] [INFO ] Flow matrix only has 501 transitions (discarded 127 similar events)
// Phase 1: matrix 501 rows 141 cols
[2022-05-14 17:18:46] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 17:18:46] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-14 17:18:47] [INFO ] After 360ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:12
[2022-05-14 17:18:47] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-14 17:18:47] [INFO ] After 341ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :9
[2022-05-14 17:18:47] [INFO ] State equation strengthened by 24 read => feed constraints.
[2022-05-14 17:18:47] [INFO ] After 212ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :5 sat :9
[2022-05-14 17:18:48] [INFO ] After 499ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :9
Attempting to minimize the solution found.
Minimization took 205 ms.
[2022-05-14 17:18:48] [INFO ] After 1180ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :9
Fused 14 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 141/141 places, 628/628 transitions.
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 141 transition count 577
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -62
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 69 place count 132 transition count 639
Drop transitions removed 8 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 78 place count 132 transition count 630
Drop transitions removed 139 transitions
Redundant transition composition rules discarded 139 transitions
Iterating global reduction 2 with 139 rules applied. Total rules applied 217 place count 132 transition count 491
Free-agglomeration rule applied 37 times with reduction of 8 identical transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 254 place count 132 transition count 446
Reduce places removed 37 places and 0 transitions.
Drop transitions removed 43 transitions
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 2 with 113 rules applied. Total rules applied 367 place count 95 transition count 370
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 370 place count 92 transition count 355
Iterating global reduction 3 with 3 rules applied. Total rules applied 373 place count 92 transition count 355
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 3 with 36 rules applied. Total rules applied 409 place count 92 transition count 319
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 411 place count 92 transition count 319
Applied a total of 411 rules in 59 ms. Remains 92 /141 variables (removed 49) and now considering 319/628 (removed 309) transitions.
Finished structural reductions, in 1 iterations. Remains : 92/141 places, 319/628 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 663 ms. (steps per millisecond=15 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 9) seen :0
Finished probabilistic random walk after 16103 steps, run visited all 9 properties in 129 ms. (steps per millisecond=124 )
Probabilistic random walk after 16103 steps, saw 3357 distinct states, run finished after 129 ms. (steps per millisecond=124 ) properties seen :9
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) p3 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0)))), (X p0), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (NOT (AND p1 p3 (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p0)))), true, (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (AND (NOT p1) (NOT p3) p0))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) p0)))), (X (X (NOT p1))), (G (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (G (NOT (AND p3 (NOT p1) (NOT p0)))), (G (NOT (AND p3 p1 p0))), (G (NOT (AND (NOT p3) p1 p0))), (G (NOT (AND (NOT p3) p2 (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p3) p1 (NOT p0))), (F (AND (NOT p3) p2 (NOT p0))), (F (NOT p0)), (F (AND (NOT p3) p2 (NOT p1) p0)), (F (AND (NOT p3) p1)), (F (AND p3 p0)), (F (AND (NOT p3) p2)), (F p1), (F (AND p3 p1 (NOT p0))), (F (AND p3 (NOT p1) p0)), (F p3), (F (NOT (AND (NOT p3) (NOT p1) p0))), (F (AND (NOT p3) p2 (NOT p1))), (F (NOT (AND (NOT p3) (NOT p1)))), (F (AND p3 (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 24 factoid took 1455 ms. Reduced automaton from 10 states, 29 edges and 4 AP to 6 states, 17 edges and 4 AP.
Stuttering acceptance computed with spot in 245 ms :[(OR (AND p1 (NOT p0)) (AND (NOT p1) p0)), (OR (AND (NOT p0) p1 p3) (AND p0 (NOT p1) p3)), (AND p1 (NOT p0)), (AND (NOT p0) p1), (AND (NOT p0) p1 p3), (AND (NOT p0) p1 p3)]
Stuttering acceptance computed with spot in 229 ms :[(OR (AND p1 (NOT p0)) (AND (NOT p1) p0)), (OR (AND (NOT p0) p1 p3) (AND p0 (NOT p1) p3)), (AND p1 (NOT p0)), (AND (NOT p0) p1), (AND (NOT p0) p1 p3), (AND (NOT p0) p1 p3)]
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 628/628 transitions.
Applied a total of 0 rules in 2 ms. Remains 141 /141 variables (removed 0) and now considering 628/628 (removed 0) transitions.
[2022-05-14 17:18:52] [INFO ] Flow matrix only has 501 transitions (discarded 127 similar events)
// Phase 1: matrix 501 rows 141 cols
[2022-05-14 17:18:52] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 17:18:52] [INFO ] Implicit Places using invariants in 129 ms returned []
[2022-05-14 17:18:52] [INFO ] Flow matrix only has 501 transitions (discarded 127 similar events)
// Phase 1: matrix 501 rows 141 cols
[2022-05-14 17:18:52] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 17:18:52] [INFO ] State equation strengthened by 24 read => feed constraints.
[2022-05-14 17:18:52] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2022-05-14 17:18:52] [INFO ] Flow matrix only has 501 transitions (discarded 127 similar events)
// Phase 1: matrix 501 rows 141 cols
[2022-05-14 17:18:52] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 17:18:52] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 141/141 places, 628/628 transitions.
Computed a total of 40 stabilizing places and 392 stable transitions
Computed a total of 40 stabilizing places and 392 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p3) (NOT p2)), (X (OR (AND (NOT p1) p0) (AND p1 (NOT p0)))), (X (NOT p3)), (X (NOT (AND (NOT p0) p3))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p3))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND p0 (NOT p2) (NOT p3))), (X (X (OR (AND (NOT p1) p0) (AND p1 (NOT p0))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3)))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND p0 (NOT p2) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 924 ms. Reduced automaton from 6 states, 17 edges and 4 AP to 6 states, 17 edges and 4 AP.
Stuttering acceptance computed with spot in 226 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p0) p1)), (OR (AND p0 (NOT p1) p3) (AND (NOT p0) p1 p3)), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 p3), (AND (NOT p0) p1 p3)]
Incomplete random walk after 10000 steps, including 441 resets, run finished after 419 ms. (steps per millisecond=23 ) properties (out of 12) seen :7
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-05-14 17:18:54] [INFO ] Flow matrix only has 501 transitions (discarded 127 similar events)
// Phase 1: matrix 501 rows 141 cols
[2022-05-14 17:18:54] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 17:18:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-14 17:18:55] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-14 17:18:55] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-14 17:18:55] [INFO ] After 210ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2022-05-14 17:18:55] [INFO ] State equation strengthened by 24 read => feed constraints.
[2022-05-14 17:18:55] [INFO ] After 93ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2022-05-14 17:18:55] [INFO ] After 221ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 88 ms.
[2022-05-14 17:18:55] [INFO ] After 590ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 141/141 places, 628/628 transitions.
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 141 transition count 577
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -62
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 69 place count 132 transition count 639
Drop transitions removed 8 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 78 place count 132 transition count 630
Drop transitions removed 139 transitions
Redundant transition composition rules discarded 139 transitions
Iterating global reduction 2 with 139 rules applied. Total rules applied 217 place count 132 transition count 491
Free-agglomeration rule applied 37 times with reduction of 8 identical transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 254 place count 132 transition count 446
Reduce places removed 37 places and 0 transitions.
Drop transitions removed 43 transitions
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 2 with 113 rules applied. Total rules applied 367 place count 95 transition count 370
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 370 place count 92 transition count 355
Iterating global reduction 3 with 3 rules applied. Total rules applied 373 place count 92 transition count 355
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 3 with 36 rules applied. Total rules applied 409 place count 92 transition count 319
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 411 place count 92 transition count 319
Applied a total of 411 rules in 53 ms. Remains 92 /141 variables (removed 49) and now considering 319/628 (removed 309) transitions.
Finished structural reductions, in 1 iterations. Remains : 92/141 places, 319/628 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 470 ms. (steps per millisecond=21 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 4) seen :0
Finished probabilistic random walk after 16103 steps, run visited all 4 properties in 128 ms. (steps per millisecond=125 )
Probabilistic random walk after 16103 steps, saw 3357 distinct states, run finished after 128 ms. (steps per millisecond=125 ) properties seen :4
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p3) (NOT p2)), (X (OR (AND (NOT p1) p0) (AND p1 (NOT p0)))), (X (NOT p3)), (X (NOT (AND (NOT p0) p3))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p3))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND p0 (NOT p2) (NOT p3))), (X (X (OR (AND (NOT p1) p0) (AND p1 (NOT p0))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3)))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND p0 (NOT p2) (NOT p3)))), (G (OR (AND (NOT p0) p1) (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p3)), (F (NOT (AND (NOT p3) (NOT p1)))), (F (AND (NOT p0) (NOT p3))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F (AND p3 (NOT p1))), (F (NOT (AND p0 (NOT p1)))), (F (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3)))), (F p3), (F (NOT (AND p0 (NOT p3)))), (F (AND p0 p3))]
Knowledge based reduction with 22 factoid took 1424 ms. Reduced automaton from 6 states, 17 edges and 4 AP to 6 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 299 ms :[true, p3, p1, p1, (AND p1 p3), (AND p1 p3)]
Stuttering acceptance computed with spot in 211 ms :[true, p3, p1, p1, (AND p1 p3), (AND p1 p3)]
Stuttering acceptance computed with spot in 207 ms :[true, p3, p1, p1, (AND p1 p3), (AND p1 p3)]
Product exploration explored 100000 steps with 4091 reset in 386 ms.
Product exploration explored 100000 steps with 4176 reset in 405 ms.
Built C files in :
/tmp/ltsmin1632012671187423686
[2022-05-14 17:18:59] [INFO ] Computing symmetric may disable matrix : 628 transitions.
[2022-05-14 17:18:59] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 17:18:59] [INFO ] Computing symmetric may enable matrix : 628 transitions.
[2022-05-14 17:18:59] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 17:18:59] [INFO ] Computing Do-Not-Accords matrix : 628 transitions.
[2022-05-14 17:18:59] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 17:18:59] [INFO ] Built C files in 98ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1632012671187423686
Running compilation step : cd /tmp/ltsmin1632012671187423686;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2831 ms.
Running link step : cd /tmp/ltsmin1632012671187423686;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin1632012671187423686;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14153581910275478025.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 628/628 transitions.
Drop transitions removed 77 transitions
Redundant transition composition rules discarded 77 transitions
Iterating global reduction 0 with 77 rules applied. Total rules applied 77 place count 141 transition count 551
Applied a total of 77 rules in 20 ms. Remains 141 /141 variables (removed 0) and now considering 551/628 (removed 77) transitions.
[2022-05-14 17:19:14] [INFO ] Flow matrix only has 424 transitions (discarded 127 similar events)
// Phase 1: matrix 424 rows 141 cols
[2022-05-14 17:19:14] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 17:19:14] [INFO ] Implicit Places using invariants in 126 ms returned []
[2022-05-14 17:19:14] [INFO ] Flow matrix only has 424 transitions (discarded 127 similar events)
// Phase 1: matrix 424 rows 141 cols
[2022-05-14 17:19:14] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 17:19:15] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-14 17:19:15] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
[2022-05-14 17:19:15] [INFO ] Redundant transitions in 542 ms returned []
[2022-05-14 17:19:15] [INFO ] Flow matrix only has 424 transitions (discarded 127 similar events)
// Phase 1: matrix 424 rows 141 cols
[2022-05-14 17:19:15] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-14 17:19:16] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/141 places, 551/628 transitions.
Finished structural reductions, in 1 iterations. Remains : 141/141 places, 551/628 transitions.
Built C files in :
/tmp/ltsmin2402545031145422266
[2022-05-14 17:19:16] [INFO ] Computing symmetric may disable matrix : 551 transitions.
[2022-05-14 17:19:16] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 17:19:16] [INFO ] Computing symmetric may enable matrix : 551 transitions.
[2022-05-14 17:19:16] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 17:19:16] [INFO ] Computing Do-Not-Accords matrix : 551 transitions.
[2022-05-14 17:19:16] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 17:19:16] [INFO ] Built C files in 118ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2402545031145422266
Running compilation step : cd /tmp/ltsmin2402545031145422266;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2200 ms.
Running link step : cd /tmp/ltsmin2402545031145422266;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin2402545031145422266;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1261849815577312790.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-14 17:19:31] [INFO ] Flatten gal took : 39 ms
[2022-05-14 17:19:31] [INFO ] Flatten gal took : 29 ms
[2022-05-14 17:19:31] [INFO ] Time to serialize gal into /tmp/LTL7293346546598295299.gal : 6 ms
[2022-05-14 17:19:31] [INFO ] Time to serialize properties into /tmp/LTL13236394775052873018.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7293346546598295299.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13236394775052873018.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7293346...267
Read 1 LTL properties
Checking formula 0 : !((G((X("(p599==0)"))||(!((F("(p599==1)"))U(("(p443==1)")U("(((p323==1)&&(p631==1))&&(p443==1))")))))))
Formula 0 simplified : !G(X"(p599==0)" | !(F"(p599==1)" U ("(p443==1)" U "(((p323==1)&&(p631==1))&&(p443==1))")))
Reverse transition relation is NOT exact ! Due to transitions t3, t169, t204, t211, t359, t394, t402, t549, t584, t591, t742, t778, t785, t1365.t786, t713....2798
Computing Next relation with stutter on 7.71785e+09 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
1396 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,14.1064,321192,1,0,803,1.50582e+06,1258,312,14297,1.56054e+06,1265
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CloudDeployment-PT-4b-LTLFireability-10 finished in 65006 ms.
FORMULA CloudDeployment-PT-4b-LTLFireability-10 FALSE TECHNIQUES SL_INSENSITIVE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Found a SL insensitive property : CloudDeployment-PT-4b-LTLFireability-12
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 764 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 764/764 places, 1399/1399 transitions.
Graph (trivial) has 788 edges and 764 vertex of which 287 / 764 are part of one of the 32 SCC in 1 ms
Free SCC test removed 255 places
Ensure Unique test removed 291 transitions
Reduce isomorphic transitions removed 291 transitions.
Graph (complete) has 1820 edges and 509 vertex of which 486 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.2 ms
Discarding 23 places :
Also discarding 257 output transitions
Drop transitions removed 257 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 205 transitions
Trivial Post-agglo rules discarded 205 transitions
Performed 205 trivial Post agglomeration. Transition count delta: 205
Iterating post reduction 0 with 205 rules applied. Total rules applied 207 place count 485 transition count 645
Reduce places removed 205 places and 0 transitions.
Iterating post reduction 1 with 205 rules applied. Total rules applied 412 place count 280 transition count 645
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 412 place count 280 transition count 604
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 494 place count 239 transition count 604
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 496 place count 237 transition count 602
Iterating global reduction 2 with 2 rules applied. Total rules applied 498 place count 237 transition count 602
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 499 place count 237 transition count 601
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 647 place count 163 transition count 527
Performed 24 Post agglomeration using F-continuation condition with reduction of 32 identical transitions.
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 695 place count 139 transition count 643
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 719 place count 139 transition count 619
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 723 place count 139 transition count 615
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 724 place count 138 transition count 614
Applied a total of 724 rules in 53 ms. Remains 138 /764 variables (removed 626) and now considering 614/1399 (removed 785) transitions.
[2022-05-14 17:19:46] [INFO ] Flow matrix only has 487 transitions (discarded 127 similar events)
// Phase 1: matrix 487 rows 138 cols
[2022-05-14 17:19:46] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 17:19:46] [INFO ] Implicit Places using invariants in 135 ms returned []
[2022-05-14 17:19:46] [INFO ] Flow matrix only has 487 transitions (discarded 127 similar events)
// Phase 1: matrix 487 rows 138 cols
[2022-05-14 17:19:46] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 17:19:46] [INFO ] State equation strengthened by 24 read => feed constraints.
[2022-05-14 17:19:47] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
[2022-05-14 17:19:47] [INFO ] Flow matrix only has 487 transitions (discarded 127 similar events)
// Phase 1: matrix 487 rows 138 cols
[2022-05-14 17:19:47] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 17:19:47] [INFO ] Dead Transitions using invariants and state equation in 564 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 138/764 places, 614/1399 transitions.
Finished structural reductions, in 1 iterations. Remains : 138/764 places, 614/1399 transitions.
Running random walk in product with property : CloudDeployment-PT-4b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s79 0)], 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4201 reset in 350 ms.
Product exploration explored 100000 steps with 4225 reset in 372 ms.
Computed a total of 42 stabilizing places and 386 stable transitions
Computed a total of 42 stabilizing places and 386 stable transitions
Detected a total of 42/138 stabilizing places and 386/614 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 368 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 451 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 973254 steps, run timeout after 3001 ms. (steps per millisecond=324 ) properties seen :{}
Probabilistic random walk after 973254 steps, saw 158414 distinct states, run finished after 3001 ms. (steps per millisecond=324 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-14 17:19:51] [INFO ] Flow matrix only has 487 transitions (discarded 127 similar events)
// Phase 1: matrix 487 rows 138 cols
[2022-05-14 17:19:51] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-14 17:19:52] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-14 17:19:52] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-14 17:19:52] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-14 17:19:52] [INFO ] State equation strengthened by 24 read => feed constraints.
[2022-05-14 17:19:52] [INFO ] After 19ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-14 17:19:52] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-14 17:19:52] [INFO ] After 246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 138/138 places, 614/614 transitions.
Drop transitions removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 138 transition count 562
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 68 place count 130 transition count 614
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 76 place count 130 transition count 606
Drop transitions removed 120 transitions
Redundant transition composition rules discarded 120 transitions
Iterating global reduction 2 with 120 rules applied. Total rules applied 196 place count 130 transition count 486
Free-agglomeration rule applied 40 times with reduction of 12 identical transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 236 place count 130 transition count 434
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 60 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 88 transitions.
Graph (complete) has 611 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 129 rules applied. Total rules applied 365 place count 89 transition count 346
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 366 place count 89 transition count 345
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 369 place count 86 transition count 330
Iterating global reduction 4 with 3 rules applied. Total rules applied 372 place count 86 transition count 330
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 4 with 48 rules applied. Total rules applied 420 place count 86 transition count 282
Applied a total of 420 rules in 46 ms. Remains 86 /138 variables (removed 52) and now considering 282/614 (removed 332) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/138 places, 282/614 transitions.
Finished random walk after 64 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=32 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 360 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 614/614 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 614/614 (removed 0) transitions.
[2022-05-14 17:19:53] [INFO ] Flow matrix only has 487 transitions (discarded 127 similar events)
// Phase 1: matrix 487 rows 138 cols
[2022-05-14 17:19:53] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 17:19:53] [INFO ] Implicit Places using invariants in 180 ms returned []
[2022-05-14 17:19:53] [INFO ] Flow matrix only has 487 transitions (discarded 127 similar events)
// Phase 1: matrix 487 rows 138 cols
[2022-05-14 17:19:53] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 17:19:53] [INFO ] State equation strengthened by 24 read => feed constraints.
[2022-05-14 17:19:53] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
[2022-05-14 17:19:53] [INFO ] Flow matrix only has 487 transitions (discarded 127 similar events)
// Phase 1: matrix 487 rows 138 cols
[2022-05-14 17:19:53] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 17:19:54] [INFO ] Dead Transitions using invariants and state equation in 307 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 138/138 places, 614/614 transitions.
Computed a total of 42 stabilizing places and 386 stable transitions
Computed a total of 42 stabilizing places and 386 stable transitions
Detected a total of 42/138 stabilizing places and 386/614 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 374 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 455 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 965096 steps, run timeout after 3001 ms. (steps per millisecond=321 ) properties seen :{}
Probabilistic random walk after 965096 steps, saw 157364 distinct states, run finished after 3001 ms. (steps per millisecond=321 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-14 17:19:57] [INFO ] Flow matrix only has 487 transitions (discarded 127 similar events)
// Phase 1: matrix 487 rows 138 cols
[2022-05-14 17:19:57] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 17:19:57] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-14 17:19:57] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-14 17:19:57] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-14 17:19:57] [INFO ] State equation strengthened by 24 read => feed constraints.
[2022-05-14 17:19:57] [INFO ] After 24ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-14 17:19:57] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-14 17:19:57] [INFO ] After 269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 138/138 places, 614/614 transitions.
Drop transitions removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 138 transition count 562
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 68 place count 130 transition count 614
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 76 place count 130 transition count 606
Drop transitions removed 120 transitions
Redundant transition composition rules discarded 120 transitions
Iterating global reduction 2 with 120 rules applied. Total rules applied 196 place count 130 transition count 486
Free-agglomeration rule applied 40 times with reduction of 12 identical transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 236 place count 130 transition count 434
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 60 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 88 transitions.
Graph (complete) has 611 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 129 rules applied. Total rules applied 365 place count 89 transition count 346
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 366 place count 89 transition count 345
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 369 place count 86 transition count 330
Iterating global reduction 4 with 3 rules applied. Total rules applied 372 place count 86 transition count 330
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 4 with 48 rules applied. Total rules applied 420 place count 86 transition count 282
Applied a total of 420 rules in 60 ms. Remains 86 /138 variables (removed 52) and now considering 282/614 (removed 332) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/138 places, 282/614 transitions.
Finished random walk after 562 steps, including 14 resets, run visited all 1 properties in 3 ms. (steps per millisecond=187 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 183 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4242 reset in 368 ms.
Product exploration explored 100000 steps with 4196 reset in 382 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 614/614 transitions.
Drop transitions removed 68 transitions
Redundant transition composition rules discarded 68 transitions
Iterating global reduction 0 with 68 rules applied. Total rules applied 68 place count 138 transition count 546
Applied a total of 68 rules in 19 ms. Remains 138 /138 variables (removed 0) and now considering 546/614 (removed 68) transitions.
[2022-05-14 17:19:59] [INFO ] Redundant transitions in 499 ms returned []
[2022-05-14 17:19:59] [INFO ] Flow matrix only has 419 transitions (discarded 127 similar events)
// Phase 1: matrix 419 rows 138 cols
[2022-05-14 17:19:59] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 17:20:00] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 138/138 places, 546/614 transitions.
Finished structural reductions, in 1 iterations. Remains : 138/138 places, 546/614 transitions.
Product exploration explored 100000 steps with 4082 reset in 426 ms.
Product exploration explored 100000 steps with 4129 reset in 454 ms.
Built C files in :
/tmp/ltsmin4821805032888025985
[2022-05-14 17:20:01] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4821805032888025985
Running compilation step : cd /tmp/ltsmin4821805032888025985;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1696 ms.
Running link step : cd /tmp/ltsmin4821805032888025985;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin4821805032888025985;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11399012000242363604.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 614/614 transitions.
Applied a total of 0 rules in 1 ms. Remains 138 /138 variables (removed 0) and now considering 614/614 (removed 0) transitions.
[2022-05-14 17:20:16] [INFO ] Flow matrix only has 487 transitions (discarded 127 similar events)
// Phase 1: matrix 487 rows 138 cols
[2022-05-14 17:20:16] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 17:20:16] [INFO ] Implicit Places using invariants in 124 ms returned []
[2022-05-14 17:20:16] [INFO ] Flow matrix only has 487 transitions (discarded 127 similar events)
// Phase 1: matrix 487 rows 138 cols
[2022-05-14 17:20:16] [INFO ] Computed 4 place invariants in 10 ms
[2022-05-14 17:20:16] [INFO ] State equation strengthened by 24 read => feed constraints.
[2022-05-14 17:20:16] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2022-05-14 17:20:16] [INFO ] Flow matrix only has 487 transitions (discarded 127 similar events)
// Phase 1: matrix 487 rows 138 cols
[2022-05-14 17:20:16] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 17:20:16] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 138/138 places, 614/614 transitions.
Built C files in :
/tmp/ltsmin7972797646329859103
[2022-05-14 17:20:16] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7972797646329859103
Running compilation step : cd /tmp/ltsmin7972797646329859103;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1780 ms.
Running link step : cd /tmp/ltsmin7972797646329859103;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7972797646329859103;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2108717730978172016.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-14 17:20:32] [INFO ] Flatten gal took : 33 ms
[2022-05-14 17:20:32] [INFO ] Flatten gal took : 30 ms
[2022-05-14 17:20:32] [INFO ] Time to serialize gal into /tmp/LTL2735009663127113252.gal : 7 ms
[2022-05-14 17:20:32] [INFO ] Time to serialize properties into /tmp/LTL16782712777696476411.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2735009663127113252.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16782712777696476411.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2735009...267
Read 1 LTL properties
Checking formula 0 : !((G(X("(p765==0)"))))
Formula 0 simplified : !GX"(p765==0)"
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t169, t204, t211, t275, t359, t394, t402, t549, t584, t591, t742, t778, t785, t1365.t...8645
Computing Next relation with stutter on 7.71785e+09 deadlock states
Detected timeout of ITS tools.
[2022-05-14 17:20:47] [INFO ] Flatten gal took : 30 ms
[2022-05-14 17:20:47] [INFO ] Applying decomposition
[2022-05-14 17:20:47] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10849415463862554829.txt' '-o' '/tmp/graph10849415463862554829.bin' '-w' '/tmp/graph10849415463862554829.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10849415463862554829.bin' '-l' '-1' '-v' '-w' '/tmp/graph10849415463862554829.weights' '-q' '0' '-e' '0.001'
[2022-05-14 17:20:47] [INFO ] Decomposing Gal with order
[2022-05-14 17:20:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 17:20:47] [INFO ] Removed a total of 1381 redundant transitions.
[2022-05-14 17:20:47] [INFO ] Flatten gal took : 61 ms
[2022-05-14 17:20:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 150 labels/synchronizations in 16 ms.
[2022-05-14 17:20:47] [INFO ] Time to serialize gal into /tmp/LTL5917218375657590329.gal : 4 ms
[2022-05-14 17:20:47] [INFO ] Time to serialize properties into /tmp/LTL11489390647546822861.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5917218375657590329.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11489390647546822861.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5917218...246
Read 1 LTL properties
Checking formula 0 : !((G(X("(i2.i1.u20.p765==0)"))))
Formula 0 simplified : !GX"(i2.i1.u20.p765==0)"
Reverse transition relation is NOT exact ! Due to transitions t0, t1365_t786, t1358_t592, t23_t1044_t747_t553_t363_t173, t23_t1064_t786_t2, t23_t1063_t786_...2720
Computing Next relation with stutter on 7.71785e+09 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
133 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.41052,56504,1,0,71564,3649,4936,270353,768,17398,56327
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property CloudDeployment-PT-4b-LTLFireability-12 finished in 62803 ms.
FORMULA CloudDeployment-PT-4b-LTLFireability-12 FALSE TECHNIQUES SL_INSENSITIVE
[2022-05-14 17:20:49] [INFO ] Flatten gal took : 82 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 356407 ms.

BK_STOP 1652548849525

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-4b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is CloudDeployment-PT-4b, 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 r042-smll-165252095200044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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