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-165252095200092.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-7b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-smll-165252095200092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 7.5K Apr 30 10:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 30 10:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 30 10:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 30 10:50 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.6K May 9 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:17 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 20M 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-7b-LTLFireability-00
FORMULA_NAME CloudDeployment-PT-7b-LTLFireability-01
FORMULA_NAME CloudDeployment-PT-7b-LTLFireability-02
FORMULA_NAME CloudDeployment-PT-7b-LTLFireability-03
FORMULA_NAME CloudDeployment-PT-7b-LTLFireability-04
FORMULA_NAME CloudDeployment-PT-7b-LTLFireability-05
FORMULA_NAME CloudDeployment-PT-7b-LTLFireability-06
FORMULA_NAME CloudDeployment-PT-7b-LTLFireability-07
FORMULA_NAME CloudDeployment-PT-7b-LTLFireability-08
FORMULA_NAME CloudDeployment-PT-7b-LTLFireability-09
FORMULA_NAME CloudDeployment-PT-7b-LTLFireability-10
FORMULA_NAME CloudDeployment-PT-7b-LTLFireability-11
FORMULA_NAME CloudDeployment-PT-7b-LTLFireability-12
FORMULA_NAME CloudDeployment-PT-7b-LTLFireability-13
FORMULA_NAME CloudDeployment-PT-7b-LTLFireability-14
FORMULA_NAME CloudDeployment-PT-7b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652568942457

Running Version 202205111006
[2022-05-14 22:55:44] [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 22:55:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 22:55:46] [INFO ] Load time of PNML (sax parser for PT used): 1754 ms
[2022-05-14 22:55:46] [INFO ] Transformed 2271 places.
[2022-05-14 22:55:47] [INFO ] Transformed 19752 transitions.
[2022-05-14 22:55:47] [INFO ] Found NUPN structural information;
[2022-05-14 22:55:47] [INFO ] Parsed PT model containing 2271 places and 19752 transitions in 2217 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CloudDeployment-PT-7b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 2271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2271/2271 places, 19752/19752 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 2264 transition count 19752
Discarding 649 places :
Symmetric choice reduction at 1 with 649 rule applications. Total rules 656 place count 1615 transition count 19103
Iterating global reduction 1 with 649 rules applied. Total rules applied 1305 place count 1615 transition count 19103
Discarding 264 places :
Symmetric choice reduction at 1 with 264 rule applications. Total rules 1569 place count 1351 transition count 18839
Iterating global reduction 1 with 264 rules applied. Total rules applied 1833 place count 1351 transition count 18839
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 1875 place count 1351 transition count 18797
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 1899 place count 1327 transition count 18773
Iterating global reduction 2 with 24 rules applied. Total rules applied 1923 place count 1327 transition count 18773
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1926 place count 1324 transition count 18770
Iterating global reduction 2 with 3 rules applied. Total rules applied 1929 place count 1324 transition count 18770
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1931 place count 1322 transition count 18768
Iterating global reduction 2 with 2 rules applied. Total rules applied 1933 place count 1322 transition count 18768
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1934 place count 1321 transition count 18767
Iterating global reduction 2 with 1 rules applied. Total rules applied 1935 place count 1321 transition count 18767
Applied a total of 1935 rules in 2155 ms. Remains 1321 /2271 variables (removed 950) and now considering 18767/19752 (removed 985) transitions.
// Phase 1: matrix 18767 rows 1321 cols
[2022-05-14 22:55:50] [INFO ] Computed 22 place invariants in 507 ms
[2022-05-14 22:55:51] [INFO ] Implicit Places using invariants in 1407 ms returned []
Implicit Place search using SMT only with invariants took 1453 ms to find 0 implicit places.
// Phase 1: matrix 18767 rows 1321 cols
[2022-05-14 22:55:51] [INFO ] Computed 22 place invariants in 327 ms
[2022-05-14 22:56:12] [INFO ] Dead Transitions using invariants and state equation in 20912 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1321/2271 places, 18767/19752 transitions.
Finished structural reductions, in 1 iterations. Remains : 1321/2271 places, 18767/19752 transitions.
Support contains 50 out of 1321 places after structural reductions.
[2022-05-14 22:56:19] [INFO ] Flatten gal took : 6093 ms
[2022-05-14 22:56:24] [INFO ] Flatten gal took : 5509 ms
[2022-05-14 22:56:32] [INFO ] Input system was already deterministic with 18767 transitions.
Incomplete random walk after 10000 steps, including 43 resets, run finished after 1229 ms. (steps per millisecond=8 ) properties (out of 33) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Running SMT prover for 28 properties.
// Phase 1: matrix 18767 rows 1321 cols
[2022-05-14 22:56:35] [INFO ] Computed 22 place invariants in 382 ms
[2022-05-14 22:56:38] [INFO ] [Real]Absence check using 0 positive and 22 generalized place invariants in 21 ms returned sat
[2022-05-14 22:57:01] [INFO ] After 22623ms SMT Verify possible using state equation in real domain returned unsat :17 sat :1 real:9
[2022-05-14 22:57:01] [INFO ] After 22701ms SMT Verify possible using trap constraints in real domain returned unsat :17 sat :1 real:9
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-14 22:57:01] [INFO ] After 25140ms SMT Verify possible using all constraints in real domain returned unsat :17 sat :1 real:9
[2022-05-14 22:57:02] [INFO ] [Nat]Absence check using 0 positive and 22 generalized place invariants in 21 ms returned sat
[2022-05-14 22:57:23] [INFO ] After 20553ms SMT Verify possible using state equation in natural domain returned unsat :25 sat :3
[2022-05-14 22:57:26] [INFO ] After 24085ms SMT Verify possible using trap constraints in natural domain returned unsat :25 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-14 22:57:26] [INFO ] After 25151ms SMT Verify possible using all constraints in natural domain returned unsat :25 sat :3
Fused 28 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 183 ms.
Support contains 5 out of 1321 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1321/1321 places, 18767/18767 transitions.
Graph (trivial) has 1350 edges and 1321 vertex of which 489 / 1321 are part of one of the 55 SCC in 21 ms
Free SCC test removed 434 places
Drop transitions removed 16936 transitions
Reduce isomorphic transitions removed 16936 transitions.
Graph (complete) has 3950 edges and 887 vertex of which 849 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.25 ms
Discarding 38 places :
Also discarding 0 output transitions
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions removed 355 transitions
Trivial Post-agglo rules discarded 355 transitions
Performed 355 trivial Post agglomeration. Transition count delta: 355
Iterating post reduction 0 with 381 rules applied. Total rules applied 383 place count 849 transition count 1450
Reduce places removed 355 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 358 rules applied. Total rules applied 741 place count 494 transition count 1447
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 743 place count 492 transition count 1447
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 743 place count 492 transition count 1369
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 899 place count 414 transition count 1369
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 906 place count 407 transition count 1362
Iterating global reduction 3 with 7 rules applied. Total rules applied 913 place count 407 transition count 1362
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 913 place count 407 transition count 1355
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 927 place count 400 transition count 1355
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 2 ms
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 230 rules applied. Total rules applied 1157 place count 285 transition count 1240
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -314
Deduced a syphon composed of 41 places in 7 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 1239 place count 244 transition count 1554
Drop transitions removed 18 transitions
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 3 with 53 rules applied. Total rules applied 1292 place count 244 transition count 1501
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 1306 place count 237 transition count 1585
Drop transitions removed 252 transitions
Redundant transition composition rules discarded 252 transitions
Iterating global reduction 4 with 252 rules applied. Total rules applied 1558 place count 237 transition count 1333
Free-agglomeration rule applied 65 times with reduction of 30 identical transitions.
Iterating global reduction 4 with 65 rules applied. Total rules applied 1623 place count 237 transition count 1238
Reduce places removed 65 places and 0 transitions.
Drop transitions removed 138 transitions
Ensure Unique test removed 110 transitions
Reduce isomorphic transitions removed 248 transitions.
Iterating post reduction 4 with 313 rules applied. Total rules applied 1936 place count 172 transition count 990
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1945 place count 163 transition count 909
Iterating global reduction 5 with 9 rules applied. Total rules applied 1954 place count 163 transition count 909
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1956 place count 163 transition count 907
Drop transitions removed 127 transitions
Redundant transition composition rules discarded 127 transitions
Iterating global reduction 6 with 127 rules applied. Total rules applied 2083 place count 163 transition count 780
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2084 place count 163 transition count 780
Applied a total of 2084 rules in 696 ms. Remains 163 /1321 variables (removed 1158) and now considering 780/18767 (removed 17987) transitions.
Finished structural reductions, in 1 iterations. Remains : 163/1321 places, 780/18767 transitions.
Incomplete random walk after 10000 steps, including 128 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 417484 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :{}
Probabilistic random walk after 417484 steps, saw 55891 distinct states, run finished after 3004 ms. (steps per millisecond=138 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-14 22:57:30] [INFO ] Flow matrix only has 386 transitions (discarded 394 similar events)
// Phase 1: matrix 386 rows 163 cols
[2022-05-14 22:57:30] [INFO ] Computed 26 place invariants in 2 ms
[2022-05-14 22:57:30] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2022-05-14 22:57:30] [INFO ] [Real]Absence check using 7 positive and 19 generalized place invariants in 8 ms returned sat
[2022-05-14 22:57:31] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-14 22:57:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2022-05-14 22:57:31] [INFO ] [Nat]Absence check using 7 positive and 19 generalized place invariants in 8 ms returned sat
[2022-05-14 22:57:31] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-14 22:57:31] [INFO ] State equation strengthened by 266 read => feed constraints.
[2022-05-14 22:57:31] [INFO ] After 126ms SMT Verify possible using 266 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-14 22:57:31] [INFO ] After 202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2022-05-14 22:57:31] [INFO ] After 518ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 163/163 places, 780/780 transitions.
Applied a total of 0 rules in 21 ms. Remains 163 /163 variables (removed 0) and now considering 780/780 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 780/780 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 163/163 places, 780/780 transitions.
Applied a total of 0 rules in 21 ms. Remains 163 /163 variables (removed 0) and now considering 780/780 (removed 0) transitions.
[2022-05-14 22:57:31] [INFO ] Flow matrix only has 386 transitions (discarded 394 similar events)
// Phase 1: matrix 386 rows 163 cols
[2022-05-14 22:57:31] [INFO ] Computed 26 place invariants in 2 ms
[2022-05-14 22:57:31] [INFO ] Implicit Places using invariants in 200 ms returned []
[2022-05-14 22:57:31] [INFO ] Flow matrix only has 386 transitions (discarded 394 similar events)
// Phase 1: matrix 386 rows 163 cols
[2022-05-14 22:57:31] [INFO ] Computed 26 place invariants in 2 ms
[2022-05-14 22:57:32] [INFO ] State equation strengthened by 266 read => feed constraints.
[2022-05-14 22:57:32] [INFO ] Implicit Places using invariants and state equation in 752 ms returned []
Implicit Place search using SMT with State Equation took 955 ms to find 0 implicit places.
[2022-05-14 22:57:33] [INFO ] Redundant transitions in 432 ms returned []
[2022-05-14 22:57:33] [INFO ] Flow matrix only has 386 transitions (discarded 394 similar events)
// Phase 1: matrix 386 rows 163 cols
[2022-05-14 22:57:33] [INFO ] Computed 26 place invariants in 2 ms
[2022-05-14 22:57:33] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 780/780 transitions.
Graph (trivial) has 158 edges and 163 vertex of which 48 / 163 are part of one of the 6 SCC in 0 ms
Free SCC test removed 42 places
Drop transitions removed 66 transitions
Ensure Unique test removed 394 transitions
Reduce isomorphic transitions removed 460 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 110 transition count 304
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 45 place count 94 transition count 303
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 47 place count 93 transition count 302
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 47 place count 93 transition count 288
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 75 place count 79 transition count 288
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 79 place count 75 transition count 284
Iterating global reduction 3 with 4 rules applied. Total rules applied 83 place count 75 transition count 284
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 87 place count 71 transition count 266
Iterating global reduction 3 with 4 rules applied. Total rules applied 91 place count 71 transition count 266
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 119 place count 71 transition count 238
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 121 place count 69 transition count 222
Iterating global reduction 4 with 2 rules applied. Total rules applied 123 place count 69 transition count 222
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 151 place count 69 transition count 194
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 169 place count 60 transition count 185
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 181 place count 60 transition count 173
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 182 place count 59 transition count 172
Iterating global reduction 6 with 1 rules applied. Total rules applied 183 place count 59 transition count 172
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 184 place count 58 transition count 164
Iterating global reduction 6 with 1 rules applied. Total rules applied 185 place count 58 transition count 164
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 199 place count 58 transition count 150
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 211 place count 52 transition count 192
Drop transitions removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 7 with 71 rules applied. Total rules applied 282 place count 52 transition count 121
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 283 place count 51 transition count 118
Iterating global reduction 7 with 1 rules applied. Total rules applied 284 place count 51 transition count 118
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 296 place count 45 transition count 112
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 301 place count 40 transition count 67
Iterating global reduction 7 with 5 rules applied. Total rules applied 306 place count 40 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 308 place count 39 transition count 77
Applied a total of 308 rules in 69 ms. Remains 39 /163 variables (removed 124) and now considering 77/780 (removed 703) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 77 rows 39 cols
[2022-05-14 22:57:33] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-14 22:57:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-14 22:57:33] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-14 22:57:33] [INFO ] After 46ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-14 22:57:33] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-14 22:57:33] [INFO ] After 15ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-14 22:57:33] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-14 22:57:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-14 22:57:33] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-14 22:57:33] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-14 22:57:33] [INFO ] After 7ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-14 22:57:33] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-05-14 22:57:33] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-14 22:57:33] [INFO ] Flatten gal took : 6 ms
[2022-05-14 22:57:33] [INFO ] Flatten gal took : 5 ms
[2022-05-14 22:57:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9929720356203890194.gal : 23 ms
[2022-05-14 22:57:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11088810621052107147.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms12327976239643985965;'/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/ReachabilityCardinality9929720356203890194.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11088810621052107147.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...320
Loading property file /tmp/ReachabilityCardinality11088810621052107147.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 25
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :25 after 173
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :173 after 409
Reachability property AtomicPropp23 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,31211,0.045345,4500,2,213,12,1620,6,0,231,1064,0
Total reachable state count : 31211

Verifying 1 reachability properties.
Reachability property AtomicPropp23 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
AtomicPropp23,1,0.04605,4924,2,40,12,1620,7,0,243,1064,0
Successfully simplified 25 atomic propositions for a total of 15 simplifications.
FORMULA CloudDeployment-PT-7b-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 206 stabilizing places and 17246 stable transitions
Graph (complete) has 4687 edges and 1321 vertex of which 1283 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.170 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(X(!(false U !p0)))))))'
Support contains 2 out of 1321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1321/1321 places, 18767/18767 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1320 transition count 18767
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 1304 transition count 2382
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 1304 transition count 2382
Applied a total of 33 rules in 4386 ms. Remains 1304 /1321 variables (removed 17) and now considering 2382/18767 (removed 16385) transitions.
// Phase 1: matrix 2382 rows 1304 cols
[2022-05-14 22:57:38] [INFO ] Computed 21 place invariants in 20 ms
[2022-05-14 22:57:39] [INFO ] Implicit Places using invariants in 482 ms returned []
// Phase 1: matrix 2382 rows 1304 cols
[2022-05-14 22:57:39] [INFO ] Computed 21 place invariants in 16 ms
[2022-05-14 22:57:40] [INFO ] Implicit Places using invariants and state equation in 1096 ms returned []
Implicit Place search using SMT with State Equation took 1586 ms to find 0 implicit places.
// Phase 1: matrix 2382 rows 1304 cols
[2022-05-14 22:57:40] [INFO ] Computed 21 place invariants in 14 ms
[2022-05-14 22:57:42] [INFO ] Dead Transitions using invariants and state equation in 1934 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1304/1321 places, 2382/18767 transitions.
Finished structural reductions, in 1 iterations. Remains : 1304/1321 places, 2382/18767 transitions.
Stuttering acceptance computed with spot in 331 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-7b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (EQ s537 1) (EQ s710 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]]
Stuttering criterion allowed to conclude after 242 steps with 0 reset in 6 ms.
FORMULA CloudDeployment-PT-7b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7b-LTLFireability-00 finished in 8421 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((false U false)))'
Support contains 0 out of 1321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1321/1321 places, 18767/18767 transitions.
Graph (trivial) has 1359 edges and 1321 vertex of which 498 / 1321 are part of one of the 56 SCC in 8 ms
Free SCC test removed 442 places
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Graph (complete) has 4091 edges and 879 vertex of which 841 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.52 ms
Discarding 38 places :
Also discarding 16385 output transitions
Drop transitions removed 16385 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 346 transitions
Trivial Post-agglo rules discarded 346 transitions
Performed 346 trivial Post agglomeration. Transition count delta: 346
Iterating post reduction 0 with 346 rules applied. Total rules applied 348 place count 840 transition count 1530
Reduce places removed 346 places and 0 transitions.
Iterating post reduction 1 with 346 rules applied. Total rules applied 694 place count 494 transition count 1530
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 71 Pre rules applied. Total rules applied 694 place count 494 transition count 1459
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 836 place count 423 transition count 1459
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 1 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 266 rules applied. Total rules applied 1102 place count 290 transition count 1326
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 1158 place count 262 transition count 1396
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1165 place count 262 transition count 1389
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1179 place count 255 transition count 1473
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 3 with 56 rules applied. Total rules applied 1235 place count 255 transition count 1417
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1236 place count 254 transition count 1416
Applied a total of 1236 rules in 693 ms. Remains 254 /1321 variables (removed 1067) and now considering 1416/18767 (removed 17351) transitions.
[2022-05-14 22:57:43] [INFO ] Flow matrix only has 1116 transitions (discarded 300 similar events)
// Phase 1: matrix 1116 rows 254 cols
[2022-05-14 22:57:43] [INFO ] Computed 7 place invariants in 20 ms
[2022-05-14 22:57:43] [INFO ] Implicit Places using invariants in 238 ms returned []
[2022-05-14 22:57:43] [INFO ] Flow matrix only has 1116 transitions (discarded 300 similar events)
// Phase 1: matrix 1116 rows 254 cols
[2022-05-14 22:57:43] [INFO ] Computed 7 place invariants in 8 ms
[2022-05-14 22:57:44] [INFO ] State equation strengthened by 56 read => feed constraints.
[2022-05-14 22:57:44] [INFO ] Implicit Places using invariants and state equation in 958 ms returned []
Implicit Place search using SMT with State Equation took 1200 ms to find 0 implicit places.
[2022-05-14 22:57:46] [INFO ] Redundant transitions in 1665 ms returned []
[2022-05-14 22:57:46] [INFO ] Flow matrix only has 1116 transitions (discarded 300 similar events)
// Phase 1: matrix 1116 rows 254 cols
[2022-05-14 22:57:46] [INFO ] Computed 7 place invariants in 4 ms
[2022-05-14 22:57:47] [INFO ] Dead Transitions using invariants and state equation in 719 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 254/1321 places, 1416/18767 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/1321 places, 1416/18767 transitions.
Stuttering acceptance computed with spot in 12 ms :[true]
Running random walk in product with property : CloudDeployment-PT-7b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}]], initial=0, aps=[], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-7b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7b-LTLFireability-03 finished in 4319 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1321/1321 places, 18767/18767 transitions.
Graph (trivial) has 1357 edges and 1321 vertex of which 498 / 1321 are part of one of the 56 SCC in 3 ms
Free SCC test removed 442 places
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Graph (complete) has 4091 edges and 879 vertex of which 841 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.11 ms
Discarding 38 places :
Also discarding 16385 output transitions
Drop transitions removed 16385 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 345 transitions
Trivial Post-agglo rules discarded 345 transitions
Performed 345 trivial Post agglomeration. Transition count delta: 345
Iterating post reduction 0 with 345 rules applied. Total rules applied 347 place count 840 transition count 1531
Reduce places removed 345 places and 0 transitions.
Iterating post reduction 1 with 345 rules applied. Total rules applied 692 place count 495 transition count 1531
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 70 Pre rules applied. Total rules applied 692 place count 495 transition count 1461
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 832 place count 425 transition count 1461
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 1 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 266 rules applied. Total rules applied 1098 place count 292 transition count 1328
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -70
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 1154 place count 264 transition count 1398
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1161 place count 264 transition count 1391
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1175 place count 257 transition count 1475
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 3 with 56 rules applied. Total rules applied 1231 place count 257 transition count 1419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1232 place count 256 transition count 1418
Applied a total of 1232 rules in 425 ms. Remains 256 /1321 variables (removed 1065) and now considering 1418/18767 (removed 17349) transitions.
[2022-05-14 22:57:47] [INFO ] Flow matrix only has 1118 transitions (discarded 300 similar events)
// Phase 1: matrix 1118 rows 256 cols
[2022-05-14 22:57:47] [INFO ] Computed 7 place invariants in 12 ms
[2022-05-14 22:57:47] [INFO ] Implicit Places using invariants in 210 ms returned []
[2022-05-14 22:57:47] [INFO ] Flow matrix only has 1118 transitions (discarded 300 similar events)
// Phase 1: matrix 1118 rows 256 cols
[2022-05-14 22:57:47] [INFO ] Computed 7 place invariants in 3 ms
[2022-05-14 22:57:48] [INFO ] State equation strengthened by 56 read => feed constraints.
[2022-05-14 22:57:48] [INFO ] Implicit Places using invariants and state equation in 777 ms returned []
Implicit Place search using SMT with State Equation took 991 ms to find 0 implicit places.
[2022-05-14 22:57:50] [INFO ] Redundant transitions in 1597 ms returned []
[2022-05-14 22:57:50] [INFO ] Flow matrix only has 1118 transitions (discarded 300 similar events)
// Phase 1: matrix 1118 rows 256 cols
[2022-05-14 22:57:50] [INFO ] Computed 7 place invariants in 8 ms
[2022-05-14 22:57:50] [INFO ] Dead Transitions using invariants and state equation in 760 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 256/1321 places, 1418/18767 transitions.
Finished structural reductions, in 1 iterations. Remains : 256/1321 places, 1418/18767 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-7b-LTLFireability-04 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 s204 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-7b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7b-LTLFireability-04 finished in 3860 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(false U false) U X(p0))))'
Support contains 24 out of 1321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1321/1321 places, 18767/18767 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1320 transition count 18766
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1320 transition count 18766
Applied a total of 2 rules in 295 ms. Remains 1320 /1321 variables (removed 1) and now considering 18766/18767 (removed 1) transitions.
// Phase 1: matrix 18766 rows 1320 cols
[2022-05-14 22:57:51] [INFO ] Computed 22 place invariants in 216 ms
[2022-05-14 22:58:02] [INFO ] Implicit Places using invariants in 10719 ms returned []
Implicit Place search using SMT only with invariants took 10727 ms to find 0 implicit places.
// Phase 1: matrix 18766 rows 1320 cols
[2022-05-14 22:58:02] [INFO ] Computed 22 place invariants in 228 ms
[2022-05-14 22:58:19] [INFO ] Dead Transitions using invariants and state equation in 16963 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1320/1321 places, 18766/18767 transitions.
Finished structural reductions, in 1 iterations. Remains : 1320/1321 places, 18766/18767 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-7b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s722 1) (AND (EQ s13 1) (EQ s24 1) (EQ s44 1) (EQ s191 1) (EQ s200 1) (EQ s220 1) (EQ s366 1) (EQ s375 1) (EQ s395 1) (EQ s541 1) (EQ s548 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 561 steps with 3 reset in 13 ms.
FORMULA CloudDeployment-PT-7b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7b-LTLFireability-05 finished in 28200 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p0)) U (p1 U !p2))))'
Support contains 7 out of 1321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1321/1321 places, 18767/18767 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1320 transition count 18767
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 1305 transition count 2383
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 1305 transition count 2383
Applied a total of 31 rules in 4736 ms. Remains 1305 /1321 variables (removed 16) and now considering 2383/18767 (removed 16384) transitions.
// Phase 1: matrix 2383 rows 1305 cols
[2022-05-14 22:58:23] [INFO ] Computed 21 place invariants in 9 ms
[2022-05-14 22:58:24] [INFO ] Implicit Places using invariants in 509 ms returned []
// Phase 1: matrix 2383 rows 1305 cols
[2022-05-14 22:58:24] [INFO ] Computed 21 place invariants in 14 ms
[2022-05-14 22:58:25] [INFO ] Implicit Places using invariants and state equation in 1157 ms returned []
Implicit Place search using SMT with State Equation took 1667 ms to find 0 implicit places.
// Phase 1: matrix 2383 rows 1305 cols
[2022-05-14 22:58:25] [INFO ] Computed 21 place invariants in 9 ms
[2022-05-14 22:58:27] [INFO ] Dead Transitions using invariants and state equation in 2106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1305/1321 places, 2383/18767 transitions.
Finished structural reductions, in 1 iterations. Remains : 1305/1321 places, 2383/18767 transitions.
Stuttering acceptance computed with spot in 358 ms :[p2, (NOT p0), p2, (AND (NOT p0) p2), (NOT p0), true, (AND (NOT p0) p2), p2]
Running random walk in product with property : CloudDeployment-PT-7b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(AND p2 p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p2, acceptance={0} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 p1), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=7 dest: 5}, { cond=(AND p2 p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(AND (EQ s537 1) (EQ s554 1) (EQ s583 1) (EQ s1278 1) (EQ s1301 1)), p1:(EQ s152 1), p0:(EQ s1158 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 437 reset in 769 ms.
Product exploration explored 100000 steps with 451 reset in 439 ms.
Computed a total of 190 stabilizing places and 862 stable transitions
Graph (complete) has 4649 edges and 1305 vertex of which 1282 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.8 ms
Computed a total of 190 stabilizing places and 862 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (X (NOT p2))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 566 ms. Reduced automaton from 8 states, 16 edges and 3 AP to 8 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 317 ms :[p2, (NOT p0), p2, (AND (NOT p0) p2), (NOT p0), true, (AND (NOT p0) p2), p2]
Incomplete random walk after 10000 steps, including 46 resets, run finished after 534 ms. (steps per millisecond=18 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2383 rows 1305 cols
[2022-05-14 22:58:30] [INFO ] Computed 21 place invariants in 9 ms
[2022-05-14 22:58:31] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 16 ms returned sat
[2022-05-14 22:58:33] [INFO ] After 2447ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-14 22:58:33] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 20 ms returned sat
[2022-05-14 22:58:36] [INFO ] After 2785ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-14 22:58:38] [INFO ] After 4671ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1841 ms.
[2022-05-14 22:58:40] [INFO ] After 7120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 167 ms.
Support contains 7 out of 1305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1305/1305 places, 2383/2383 transitions.
Graph (trivial) has 1344 edges and 1305 vertex of which 488 / 1305 are part of one of the 55 SCC in 1 ms
Free SCC test removed 433 places
Drop transitions removed 551 transitions
Reduce isomorphic transitions removed 551 transitions.
Graph (complete) has 3914 edges and 872 vertex of which 849 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.3 ms
Discarding 23 places :
Also discarding 0 output transitions
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions removed 354 transitions
Trivial Post-agglo rules discarded 354 transitions
Performed 354 trivial Post agglomeration. Transition count delta: 354
Iterating post reduction 0 with 380 rules applied. Total rules applied 382 place count 849 transition count 1452
Reduce places removed 354 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 358 rules applied. Total rules applied 740 place count 495 transition count 1448
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 743 place count 492 transition count 1448
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 743 place count 492 transition count 1371
Deduced a syphon composed of 77 places in 2 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 897 place count 415 transition count 1371
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 904 place count 408 transition count 1364
Iterating global reduction 3 with 7 rules applied. Total rules applied 911 place count 408 transition count 1364
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 911 place count 408 transition count 1357
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 925 place count 401 transition count 1357
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 228 rules applied. Total rules applied 1153 place count 287 transition count 1243
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -311
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 1233 place count 247 transition count 1554
Drop transitions removed 18 transitions
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 3 with 51 rules applied. Total rules applied 1284 place count 247 transition count 1503
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 1298 place count 240 transition count 1587
Drop transitions removed 250 transitions
Redundant transition composition rules discarded 250 transitions
Iterating global reduction 4 with 250 rules applied. Total rules applied 1548 place count 240 transition count 1337
Free-agglomeration rule applied 66 times with reduction of 30 identical transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 1614 place count 240 transition count 1241
Reduce places removed 66 places and 0 transitions.
Drop transitions removed 138 transitions
Ensure Unique test removed 110 transitions
Reduce isomorphic transitions removed 248 transitions.
Iterating post reduction 4 with 314 rules applied. Total rules applied 1928 place count 174 transition count 993
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1936 place count 166 transition count 920
Iterating global reduction 5 with 8 rules applied. Total rules applied 1944 place count 166 transition count 920
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1946 place count 166 transition count 918
Drop transitions removed 127 transitions
Redundant transition composition rules discarded 127 transitions
Iterating global reduction 6 with 127 rules applied. Total rules applied 2073 place count 166 transition count 791
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2074 place count 166 transition count 791
Applied a total of 2074 rules in 405 ms. Remains 166 /1305 variables (removed 1139) and now considering 791/2383 (removed 1592) transitions.
Finished structural reductions, in 1 iterations. Remains : 166/1305 places, 791/2383 transitions.
Incomplete random walk after 10000 steps, including 125 resets, run finished after 579 ms. (steps per millisecond=17 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 230307 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 230307 steps, saw 33520 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 5 properties.
[2022-05-14 22:58:45] [INFO ] Flow matrix only has 390 transitions (discarded 401 similar events)
// Phase 1: matrix 390 rows 166 cols
[2022-05-14 22:58:45] [INFO ] Computed 26 place invariants in 2 ms
[2022-05-14 22:58:45] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2022-05-14 22:58:45] [INFO ] [Real]Absence check using 7 positive and 19 generalized place invariants in 11 ms returned sat
[2022-05-14 22:58:45] [INFO ] After 341ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-14 22:58:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2022-05-14 22:58:45] [INFO ] [Nat]Absence check using 7 positive and 19 generalized place invariants in 11 ms returned sat
[2022-05-14 22:58:45] [INFO ] After 342ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-14 22:58:45] [INFO ] State equation strengthened by 266 read => feed constraints.
[2022-05-14 22:58:46] [INFO ] After 273ms SMT Verify possible using 266 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-14 22:58:46] [INFO ] After 554ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 189 ms.
[2022-05-14 22:58:46] [INFO ] After 1242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 26 ms.
Support contains 7 out of 166 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 166/166 places, 791/791 transitions.
Applied a total of 0 rules in 17 ms. Remains 166 /166 variables (removed 0) and now considering 791/791 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 166/166 places, 791/791 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 166/166 places, 791/791 transitions.
Applied a total of 0 rules in 17 ms. Remains 166 /166 variables (removed 0) and now considering 791/791 (removed 0) transitions.
[2022-05-14 22:58:46] [INFO ] Flow matrix only has 390 transitions (discarded 401 similar events)
// Phase 1: matrix 390 rows 166 cols
[2022-05-14 22:58:46] [INFO ] Computed 26 place invariants in 2 ms
[2022-05-14 22:58:47] [INFO ] Implicit Places using invariants in 252 ms returned []
[2022-05-14 22:58:47] [INFO ] Flow matrix only has 390 transitions (discarded 401 similar events)
// Phase 1: matrix 390 rows 166 cols
[2022-05-14 22:58:47] [INFO ] Computed 26 place invariants in 3 ms
[2022-05-14 22:58:47] [INFO ] State equation strengthened by 266 read => feed constraints.
[2022-05-14 22:58:48] [INFO ] Implicit Places using invariants and state equation in 1039 ms returned []
Implicit Place search using SMT with State Equation took 1299 ms to find 0 implicit places.
[2022-05-14 22:58:48] [INFO ] Redundant transitions in 357 ms returned []
[2022-05-14 22:58:48] [INFO ] Flow matrix only has 390 transitions (discarded 401 similar events)
// Phase 1: matrix 390 rows 166 cols
[2022-05-14 22:58:48] [INFO ] Computed 26 place invariants in 2 ms
[2022-05-14 22:58:49] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 166/166 places, 791/791 transitions.
Graph (trivial) has 156 edges and 166 vertex of which 48 / 166 are part of one of the 6 SCC in 0 ms
Free SCC test removed 42 places
Drop transitions removed 66 transitions
Ensure Unique test removed 401 transitions
Reduce isomorphic transitions removed 467 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 113 transition count 308
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 45 place count 97 transition count 307
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 47 place count 96 transition count 306
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 47 place count 96 transition count 292
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 75 place count 82 transition count 292
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 79 place count 78 transition count 288
Iterating global reduction 3 with 4 rules applied. Total rules applied 83 place count 78 transition count 288
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 87 place count 74 transition count 270
Iterating global reduction 3 with 4 rules applied. Total rules applied 91 place count 74 transition count 270
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 119 place count 74 transition count 242
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 121 place count 72 transition count 226
Iterating global reduction 4 with 2 rules applied. Total rules applied 123 place count 72 transition count 226
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 151 place count 72 transition count 198
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 169 place count 63 transition count 189
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 181 place count 63 transition count 177
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 182 place count 62 transition count 176
Iterating global reduction 6 with 1 rules applied. Total rules applied 183 place count 62 transition count 176
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 184 place count 61 transition count 168
Iterating global reduction 6 with 1 rules applied. Total rules applied 185 place count 61 transition count 168
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 199 place count 61 transition count 154
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 209 place count 56 transition count 189
Drop transitions removed 54 transitions
Redundant transition composition rules discarded 54 transitions
Iterating global reduction 7 with 54 rules applied. Total rules applied 263 place count 56 transition count 135
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 264 place count 56 transition count 134
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 266 place count 55 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 267 place count 54 transition count 133
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 268 place count 53 transition count 130
Iterating global reduction 10 with 1 rules applied. Total rules applied 269 place count 53 transition count 130
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 10 with 8 rules applied. Total rules applied 277 place count 49 transition count 126
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 280 place count 46 transition count 99
Iterating global reduction 10 with 3 rules applied. Total rules applied 283 place count 46 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 285 place count 45 transition count 109
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 10 with 9 rules applied. Total rules applied 294 place count 45 transition count 100
Applied a total of 294 rules in 69 ms. Remains 45 /166 variables (removed 121) and now considering 100/791 (removed 691) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 100 rows 45 cols
[2022-05-14 22:58:49] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-14 22:58:49] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-14 22:58:49] [INFO ] [Real]Absence check using 4 positive and 8 generalized place invariants in 4 ms returned sat
[2022-05-14 22:58:49] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-14 22:58:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-14 22:58:49] [INFO ] [Nat]Absence check using 4 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-14 22:58:49] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-14 22:58:49] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-14 22:58:49] [INFO ] After 61ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-14 22:58:49] [INFO ] After 141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 62 ms.
[2022-05-14 22:58:49] [INFO ] After 364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2022-05-14 22:58:49] [INFO ] Flatten gal took : 11 ms
[2022-05-14 22:58:49] [INFO ] Flatten gal took : 10 ms
[2022-05-14 22:58:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1653214583727953729.gal : 4 ms
[2022-05-14 22:58:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8518349305932801207.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms17885246965626427331;'/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/ReachabilityCardinality1653214583727953729.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8518349305932801207.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/ReachabilityCardinality8518349305932801207.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 13
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :13 after 25
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :25 after 197
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :197 after 289
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :289 after 1321
Reachability property apf5 is true.
Reachability property apf4 is true.
Reachability property apf2 is true.
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 129 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,170317,0.767655,5464,2,376,15,3858,6,0,278,2377,0
Total reachable state count : 170317

Verifying 5 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.769051,5464,2,46,15,3858,7,0,296,2377,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.76974,5464,2,46,15,3858,8,0,300,2377,0
Reachability property apf2 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
apf2,1,0.770464,5464,2,46,15,3858,9,0,307,2377,0
Reachability property apf4 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
apf4,4,0.980578,5464,2,48,15,3858,10,0,310,2377,0
Reachability property apf5 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
apf5,2,1.15005,5464,2,47,15,3858,11,0,311,2377,0
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (X (NOT p2))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 11 factoid took 780 ms. Reduced automaton from 8 states, 16 edges and 3 AP to 8 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 353 ms :[p2, (NOT p0), p2, (AND (NOT p0) p2), (NOT p0), true, (AND (NOT p0) p2), p2]
Stuttering acceptance computed with spot in 383 ms :[p2, (NOT p0), p2, (AND (NOT p0) p2), (NOT p0), true, (AND (NOT p0) p2), p2]
Support contains 7 out of 1305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1305/1305 places, 2383/2383 transitions.
Applied a total of 0 rules in 88 ms. Remains 1305 /1305 variables (removed 0) and now considering 2383/2383 (removed 0) transitions.
// Phase 1: matrix 2383 rows 1305 cols
[2022-05-14 22:58:52] [INFO ] Computed 21 place invariants in 15 ms
[2022-05-14 22:58:53] [INFO ] Implicit Places using invariants in 705 ms returned []
// Phase 1: matrix 2383 rows 1305 cols
[2022-05-14 22:58:53] [INFO ] Computed 21 place invariants in 9 ms
[2022-05-14 22:58:54] [INFO ] Implicit Places using invariants and state equation in 1080 ms returned []
Implicit Place search using SMT with State Equation took 1792 ms to find 0 implicit places.
// Phase 1: matrix 2383 rows 1305 cols
[2022-05-14 22:58:54] [INFO ] Computed 21 place invariants in 9 ms
[2022-05-14 22:58:56] [INFO ] Dead Transitions using invariants and state equation in 2337 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1305/1305 places, 2383/2383 transitions.
Computed a total of 190 stabilizing places and 862 stable transitions
Graph (complete) has 4649 edges and 1305 vertex of which 1282 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.7 ms
Computed a total of 190 stabilizing places and 862 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 727 ms. Reduced automaton from 8 states, 16 edges and 3 AP to 8 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 312 ms :[p2, (NOT p0), p2, (AND (NOT p0) p2), (NOT p0), true, (AND (NOT p0) p2), p2]
Incomplete random walk after 10000 steps, including 43 resets, run finished after 668 ms. (steps per millisecond=14 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 92577 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{3=1}
Probabilistic random walk after 92577 steps, saw 24677 distinct states, run finished after 3005 ms. (steps per millisecond=30 ) properties seen :1
Running SMT prover for 5 properties.
// Phase 1: matrix 2383 rows 1305 cols
[2022-05-14 22:59:01] [INFO ] Computed 21 place invariants in 10 ms
[2022-05-14 22:59:02] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 15 ms returned sat
[2022-05-14 22:59:04] [INFO ] After 2509ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-14 22:59:04] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 14 ms returned sat
[2022-05-14 22:59:06] [INFO ] After 2041ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-14 22:59:08] [INFO ] After 3666ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1692 ms.
[2022-05-14 22:59:09] [INFO ] After 5792ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 96 ms.
Support contains 7 out of 1305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1305/1305 places, 2383/2383 transitions.
Graph (trivial) has 1344 edges and 1305 vertex of which 488 / 1305 are part of one of the 55 SCC in 1 ms
Free SCC test removed 433 places
Drop transitions removed 551 transitions
Reduce isomorphic transitions removed 551 transitions.
Graph (complete) has 3914 edges and 872 vertex of which 849 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.2 ms
Discarding 23 places :
Also discarding 0 output transitions
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions removed 354 transitions
Trivial Post-agglo rules discarded 354 transitions
Performed 354 trivial Post agglomeration. Transition count delta: 354
Iterating post reduction 0 with 380 rules applied. Total rules applied 382 place count 849 transition count 1452
Reduce places removed 354 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 358 rules applied. Total rules applied 740 place count 495 transition count 1448
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 743 place count 492 transition count 1448
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 743 place count 492 transition count 1371
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 897 place count 415 transition count 1371
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 904 place count 408 transition count 1364
Iterating global reduction 3 with 7 rules applied. Total rules applied 911 place count 408 transition count 1364
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 911 place count 408 transition count 1357
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 925 place count 401 transition count 1357
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 228 rules applied. Total rules applied 1153 place count 287 transition count 1243
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -311
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 1233 place count 247 transition count 1554
Drop transitions removed 18 transitions
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 3 with 51 rules applied. Total rules applied 1284 place count 247 transition count 1503
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 1298 place count 240 transition count 1587
Drop transitions removed 250 transitions
Redundant transition composition rules discarded 250 transitions
Iterating global reduction 4 with 250 rules applied. Total rules applied 1548 place count 240 transition count 1337
Free-agglomeration rule applied 66 times with reduction of 30 identical transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 1614 place count 240 transition count 1241
Reduce places removed 66 places and 0 transitions.
Drop transitions removed 138 transitions
Ensure Unique test removed 110 transitions
Reduce isomorphic transitions removed 248 transitions.
Iterating post reduction 4 with 314 rules applied. Total rules applied 1928 place count 174 transition count 993
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1936 place count 166 transition count 920
Iterating global reduction 5 with 8 rules applied. Total rules applied 1944 place count 166 transition count 920
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1946 place count 166 transition count 918
Drop transitions removed 127 transitions
Redundant transition composition rules discarded 127 transitions
Iterating global reduction 6 with 127 rules applied. Total rules applied 2073 place count 166 transition count 791
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2074 place count 166 transition count 791
Applied a total of 2074 rules in 244 ms. Remains 166 /1305 variables (removed 1139) and now considering 791/2383 (removed 1592) transitions.
Finished structural reductions, in 1 iterations. Remains : 166/1305 places, 791/2383 transitions.
Incomplete random walk after 10000 steps, including 119 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 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 5 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 259095 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 259095 steps, saw 37699 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 5 properties.
[2022-05-14 22:59:13] [INFO ] Flow matrix only has 390 transitions (discarded 401 similar events)
// Phase 1: matrix 390 rows 166 cols
[2022-05-14 22:59:13] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-14 22:59:13] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2022-05-14 22:59:13] [INFO ] [Real]Absence check using 7 positive and 19 generalized place invariants in 10 ms returned sat
[2022-05-14 22:59:14] [INFO ] After 361ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-14 22:59:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2022-05-14 22:59:14] [INFO ] [Nat]Absence check using 7 positive and 19 generalized place invariants in 11 ms returned sat
[2022-05-14 22:59:14] [INFO ] After 413ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-14 22:59:14] [INFO ] State equation strengthened by 266 read => feed constraints.
[2022-05-14 22:59:15] [INFO ] After 356ms SMT Verify possible using 266 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-14 22:59:15] [INFO ] After 597ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 185 ms.
[2022-05-14 22:59:15] [INFO ] After 1345ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 24 ms.
Support contains 7 out of 166 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 166/166 places, 791/791 transitions.
Applied a total of 0 rules in 17 ms. Remains 166 /166 variables (removed 0) and now considering 791/791 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 166/166 places, 791/791 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 166/166 places, 791/791 transitions.
Applied a total of 0 rules in 16 ms. Remains 166 /166 variables (removed 0) and now considering 791/791 (removed 0) transitions.
[2022-05-14 22:59:15] [INFO ] Flow matrix only has 390 transitions (discarded 401 similar events)
// Phase 1: matrix 390 rows 166 cols
[2022-05-14 22:59:15] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-14 22:59:15] [INFO ] Implicit Places using invariants in 169 ms returned []
[2022-05-14 22:59:15] [INFO ] Flow matrix only has 390 transitions (discarded 401 similar events)
// Phase 1: matrix 390 rows 166 cols
[2022-05-14 22:59:15] [INFO ] Computed 26 place invariants in 2 ms
[2022-05-14 22:59:15] [INFO ] State equation strengthened by 266 read => feed constraints.
[2022-05-14 22:59:16] [INFO ] Implicit Places using invariants and state equation in 655 ms returned []
Implicit Place search using SMT with State Equation took 837 ms to find 0 implicit places.
[2022-05-14 22:59:16] [INFO ] Redundant transitions in 298 ms returned []
[2022-05-14 22:59:16] [INFO ] Flow matrix only has 390 transitions (discarded 401 similar events)
// Phase 1: matrix 390 rows 166 cols
[2022-05-14 22:59:16] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-14 22:59:17] [INFO ] Dead Transitions using invariants and state equation in 429 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 166/166 places, 791/791 transitions.
Graph (trivial) has 156 edges and 166 vertex of which 48 / 166 are part of one of the 6 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions removed 66 transitions
Ensure Unique test removed 401 transitions
Reduce isomorphic transitions removed 467 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 113 transition count 308
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 45 place count 97 transition count 307
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 47 place count 96 transition count 306
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 47 place count 96 transition count 292
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 75 place count 82 transition count 292
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 79 place count 78 transition count 288
Iterating global reduction 3 with 4 rules applied. Total rules applied 83 place count 78 transition count 288
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 87 place count 74 transition count 270
Iterating global reduction 3 with 4 rules applied. Total rules applied 91 place count 74 transition count 270
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 119 place count 74 transition count 242
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 121 place count 72 transition count 226
Iterating global reduction 4 with 2 rules applied. Total rules applied 123 place count 72 transition count 226
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 151 place count 72 transition count 198
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 169 place count 63 transition count 189
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 181 place count 63 transition count 177
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 182 place count 62 transition count 176
Iterating global reduction 6 with 1 rules applied. Total rules applied 183 place count 62 transition count 176
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 184 place count 61 transition count 168
Iterating global reduction 6 with 1 rules applied. Total rules applied 185 place count 61 transition count 168
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 199 place count 61 transition count 154
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 209 place count 56 transition count 189
Drop transitions removed 54 transitions
Redundant transition composition rules discarded 54 transitions
Iterating global reduction 7 with 54 rules applied. Total rules applied 263 place count 56 transition count 135
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 264 place count 56 transition count 134
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 266 place count 55 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 267 place count 54 transition count 133
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 268 place count 53 transition count 130
Iterating global reduction 10 with 1 rules applied. Total rules applied 269 place count 53 transition count 130
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 10 with 8 rules applied. Total rules applied 277 place count 49 transition count 126
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 280 place count 46 transition count 99
Iterating global reduction 10 with 3 rules applied. Total rules applied 283 place count 46 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 285 place count 45 transition count 109
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 10 with 9 rules applied. Total rules applied 294 place count 45 transition count 100
Applied a total of 294 rules in 29 ms. Remains 45 /166 variables (removed 121) and now considering 100/791 (removed 691) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 100 rows 45 cols
[2022-05-14 22:59:17] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-14 22:59:17] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 22:59:17] [INFO ] [Real]Absence check using 4 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-14 22:59:17] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-14 22:59:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 22:59:17] [INFO ] [Nat]Absence check using 4 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-14 22:59:17] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-14 22:59:17] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-14 22:59:17] [INFO ] After 39ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-14 22:59:17] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 38 ms.
[2022-05-14 22:59:17] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2022-05-14 22:59:17] [INFO ] Flatten gal took : 6 ms
[2022-05-14 22:59:17] [INFO ] Flatten gal took : 6 ms
[2022-05-14 22:59:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13379935340946220776.gal : 2 ms
[2022-05-14 22:59:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9110541839596776437.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms4424769144131070612;'/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/ReachabilityCardinality13379935340946220776.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9110541839596776437.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...320
Loading property file /tmp/ReachabilityCardinality9110541839596776437.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 13
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :13 after 25
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :25 after 197
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :197 after 289
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :289 after 1321
Reachability property apf5 is true.
Reachability property apf4 is true.
Reachability property apf2 is true.
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 129 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,170317,0.474048,5464,2,376,15,3788,6,0,278,2377,0
Total reachable state count : 170317

Verifying 5 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.475458,5464,2,46,15,3788,7,0,296,2377,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.476213,5464,2,46,15,3788,8,0,300,2377,0
Reachability property apf2 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
apf2,1,0.477292,5464,2,46,15,3788,9,0,307,2377,0
Reachability property apf4 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
apf4,4,0.675824,5464,2,48,15,3788,10,0,310,2377,0
Reachability property apf5 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
apf5,2,0.833392,5464,2,47,15,3788,11,0,311,2377,0
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 11 factoid took 734 ms. Reduced automaton from 8 states, 16 edges and 3 AP to 8 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 316 ms :[p2, (NOT p0), p2, (AND (NOT p0) p2), (NOT p0), true, (AND (NOT p0) p2), p2]
Stuttering acceptance computed with spot in 309 ms :[p2, (NOT p0), p2, (AND (NOT p0) p2), (NOT p0), true, (AND (NOT p0) p2), p2]
Stuttering acceptance computed with spot in 322 ms :[p2, (NOT p0), p2, (AND (NOT p0) p2), (NOT p0), true, (AND (NOT p0) p2), p2]
Product exploration explored 100000 steps with 441 reset in 353 ms.
Product exploration explored 100000 steps with 440 reset in 372 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 339 ms :[p2, (NOT p0), p2, (AND (NOT p0) p2), (NOT p0), true, (AND (NOT p0) p2), p2]
Support contains 7 out of 1305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1305/1305 places, 2383/2383 transitions.
Graph (trivial) has 1344 edges and 1305 vertex of which 488 / 1305 are part of one of the 55 SCC in 1 ms
Free SCC test removed 433 places
Ensure Unique test removed 494 transitions
Reduce isomorphic transitions removed 494 transitions.
Graph (complete) has 4071 edges and 872 vertex of which 849 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.3 ms
Discarding 23 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 350 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 350 rules applied. Total rules applied 352 place count 849 transition count 1887
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 353 place count 849 transition count 1886
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 353 place count 849 transition count 1928
Deduced a syphon composed of 399 places in 1 ms
Iterating global reduction 2 with 49 rules applied. Total rules applied 402 place count 849 transition count 1928
Discarding 186 places :
Symmetric choice reduction at 2 with 186 rule applications. Total rules 588 place count 663 transition count 1742
Deduced a syphon composed of 213 places in 1 ms
Iterating global reduction 2 with 186 rules applied. Total rules applied 774 place count 663 transition count 1742
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 354 places in 1 ms
Iterating global reduction 2 with 141 rules applied. Total rules applied 915 place count 663 transition count 1742
Discarding 107 places :
Symmetric choice reduction at 2 with 107 rule applications. Total rules 1022 place count 556 transition count 1635
Deduced a syphon composed of 247 places in 1 ms
Iterating global reduction 2 with 107 rules applied. Total rules applied 1129 place count 556 transition count 1635
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: -293
Deduced a syphon composed of 289 places in 1 ms
Iterating global reduction 2 with 42 rules applied. Total rules applied 1171 place count 556 transition count 1928
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1178 place count 556 transition count 1921
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 1227 place count 507 transition count 1763
Deduced a syphon composed of 240 places in 1 ms
Iterating global reduction 3 with 49 rules applied. Total rules applied 1276 place count 507 transition count 1763
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 247 places in 1 ms
Iterating global reduction 3 with 7 rules applied. Total rules applied 1283 place count 507 transition count 1861
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1290 place count 500 transition count 1847
Deduced a syphon composed of 240 places in 1 ms
Iterating global reduction 3 with 7 rules applied. Total rules applied 1297 place count 500 transition count 1847
Deduced a syphon composed of 240 places in 1 ms
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 3 with 99 rules applied. Total rules applied 1396 place count 500 transition count 1748
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1409 place count 487 transition count 1735
Deduced a syphon composed of 227 places in 1 ms
Iterating global reduction 3 with 13 rules applied. Total rules applied 1422 place count 487 transition count 1735
Deduced a syphon composed of 227 places in 1 ms
Applied a total of 1422 rules in 339 ms. Remains 487 /1305 variables (removed 818) and now considering 1735/2383 (removed 648) transitions.
[2022-05-14 22:59:23] [INFO ] Redundant transitions in 1526 ms returned []
[2022-05-14 22:59:23] [INFO ] Flow matrix only has 1436 transitions (discarded 299 similar events)
// Phase 1: matrix 1436 rows 487 cols
[2022-05-14 22:59:23] [INFO ] Computed 7 place invariants in 3 ms
[2022-05-14 22:59:24] [INFO ] Dead Transitions using invariants and state equation in 1036 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 487/1305 places, 1735/2383 transitions.
Finished structural reductions, in 1 iterations. Remains : 487/1305 places, 1735/2383 transitions.
Product exploration explored 100000 steps with 440 reset in 337 ms.
Product exploration explored 100000 steps with 436 reset in 375 ms.
Built C files in :
/tmp/ltsmin4958699711255182355
[2022-05-14 22:59:25] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4958699711255182355
Running compilation step : cd /tmp/ltsmin4958699711255182355;'/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/ltsmin4958699711255182355;'/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/ltsmin4958699711255182355;'/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 7 out of 1305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1305/1305 places, 2383/2383 transitions.
Applied a total of 0 rules in 47 ms. Remains 1305 /1305 variables (removed 0) and now considering 2383/2383 (removed 0) transitions.
// Phase 1: matrix 2383 rows 1305 cols
[2022-05-14 22:59:28] [INFO ] Computed 21 place invariants in 9 ms
[2022-05-14 22:59:28] [INFO ] Implicit Places using invariants in 635 ms returned []
// Phase 1: matrix 2383 rows 1305 cols
[2022-05-14 22:59:28] [INFO ] Computed 21 place invariants in 9 ms
[2022-05-14 22:59:30] [INFO ] Implicit Places using invariants and state equation in 2108 ms returned [13, 21, 187, 195, 360, 368, 533, 541, 706, 714, 879, 887, 1052, 1060]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 2768 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1291/1305 places, 2383/2383 transitions.
Applied a total of 0 rules in 59 ms. Remains 1291 /1291 variables (removed 0) and now considering 2383/2383 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1291/1305 places, 2383/2383 transitions.
Built C files in :
/tmp/ltsmin17234504711231474842
[2022-05-14 22:59:31] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17234504711231474842
Running compilation step : cd /tmp/ltsmin17234504711231474842;'/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/ltsmin17234504711231474842;'/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/ltsmin17234504711231474842;'/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 22:59:37] [INFO ] Flatten gal took : 114 ms
[2022-05-14 22:59:38] [INFO ] Flatten gal took : 118 ms
[2022-05-14 22:59:38] [INFO ] Time to serialize gal into /tmp/LTL15887017984184251985.gal : 19 ms
[2022-05-14 22:59:38] [INFO ] Time to serialize properties into /tmp/LTL10671348209030157846.ltl : 2 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/LTL15887017984184251985.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10671348209030157846.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/LTL1588701...268
Read 1 LTL properties
Checking formula 0 : !((G((X(X("(p2078==1)")))U(("(p274==1)")U(!("((((p987==1)&&(p1031==1))&&((p1074==1)&&(p2243==1)))&&(p2267==1))"))))))
Formula 0 simplified : !G(XX"(p2078==1)" U ("(p274==1)" U !"((((p987==1)&&(p1031==1))&&((p1074==1)&&(p2243==1)))&&(p2267==1))"))
Detected timeout of ITS tools.
[2022-05-14 22:59:53] [INFO ] Flatten gal took : 108 ms
[2022-05-14 22:59:53] [INFO ] Applying decomposition
[2022-05-14 22:59:53] [INFO ] Flatten gal took : 108 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/graph12939201452752266208.txt' '-o' '/tmp/graph12939201452752266208.bin' '-w' '/tmp/graph12939201452752266208.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12939201452752266208.bin' '-l' '-1' '-v' '-w' '/tmp/graph12939201452752266208.weights' '-q' '0' '-e' '0.001'
[2022-05-14 22:59:53] [INFO ] Decomposing Gal with order
[2022-05-14 22:59:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 22:59:54] [INFO ] Removed a total of 3644 redundant transitions.
[2022-05-14 22:59:54] [INFO ] Flatten gal took : 428 ms
[2022-05-14 22:59:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 136 labels/synchronizations in 96 ms.
[2022-05-14 22:59:54] [INFO ] Time to serialize gal into /tmp/LTL11657873286225282131.gal : 26 ms
[2022-05-14 22:59:54] [INFO ] Time to serialize properties into /tmp/LTL17551291051458917124.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/LTL11657873286225282131.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17551291051458917124.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/LTL1165787...247
Read 1 LTL properties
Checking formula 0 : !((G((X(X("(i23.u434.p2078==1)")))U(("(i3.i1.i3.u11.p274==1)")U(!("((((i25.u198.p987==1)&&(i25.u203.p1031==1))&&((i11.u214.p1074==1)&&...205
Formula 0 simplified : !G(XX"(i23.u434.p2078==1)" U ("(i3.i1.i3.u11.p274==1)" U !"((((i25.u198.p987==1)&&(i25.u203.p1031==1))&&((i11.u214.p1074==1)&&(i25.u...195
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13433072497260389406
[2022-05-14 23:00:09] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13433072497260389406
Running compilation step : cd /tmp/ltsmin13433072497260389406;'/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/ltsmin13433072497260389406;'/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/ltsmin13433072497260389406;'/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-7b-LTLFireability-11 finished in 113808 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((false U false)))'
Support contains 0 out of 1321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1321/1321 places, 18767/18767 transitions.
Graph (trivial) has 1359 edges and 1321 vertex of which 498 / 1321 are part of one of the 56 SCC in 2 ms
Free SCC test removed 442 places
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Graph (complete) has 4091 edges and 879 vertex of which 841 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.9 ms
Discarding 38 places :
Also discarding 16385 output transitions
Drop transitions removed 16385 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 346 transitions
Trivial Post-agglo rules discarded 346 transitions
Performed 346 trivial Post agglomeration. Transition count delta: 346
Iterating post reduction 0 with 346 rules applied. Total rules applied 348 place count 840 transition count 1530
Reduce places removed 346 places and 0 transitions.
Iterating post reduction 1 with 346 rules applied. Total rules applied 694 place count 494 transition count 1530
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 71 Pre rules applied. Total rules applied 694 place count 494 transition count 1459
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 836 place count 423 transition count 1459
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 0 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 266 rules applied. Total rules applied 1102 place count 290 transition count 1326
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -70
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 1158 place count 262 transition count 1396
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1165 place count 262 transition count 1389
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1179 place count 255 transition count 1473
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 3 with 56 rules applied. Total rules applied 1235 place count 255 transition count 1417
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1236 place count 254 transition count 1416
Applied a total of 1236 rules in 319 ms. Remains 254 /1321 variables (removed 1067) and now considering 1416/18767 (removed 17351) transitions.
[2022-05-14 23:00:13] [INFO ] Flow matrix only has 1116 transitions (discarded 300 similar events)
// Phase 1: matrix 1116 rows 254 cols
[2022-05-14 23:00:13] [INFO ] Computed 7 place invariants in 5 ms
[2022-05-14 23:00:13] [INFO ] Implicit Places using invariants in 342 ms returned []
[2022-05-14 23:00:13] [INFO ] Flow matrix only has 1116 transitions (discarded 300 similar events)
// Phase 1: matrix 1116 rows 254 cols
[2022-05-14 23:00:13] [INFO ] Computed 7 place invariants in 12 ms
[2022-05-14 23:00:14] [INFO ] State equation strengthened by 56 read => feed constraints.
[2022-05-14 23:00:14] [INFO ] Implicit Places using invariants and state equation in 989 ms returned []
Implicit Place search using SMT with State Equation took 1337 ms to find 0 implicit places.
[2022-05-14 23:00:16] [INFO ] Redundant transitions in 1582 ms returned []
[2022-05-14 23:00:16] [INFO ] Flow matrix only has 1116 transitions (discarded 300 similar events)
// Phase 1: matrix 1116 rows 254 cols
[2022-05-14 23:00:16] [INFO ] Computed 7 place invariants in 5 ms
[2022-05-14 23:00:17] [INFO ] Dead Transitions using invariants and state equation in 734 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 254/1321 places, 1416/18767 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/1321 places, 1416/18767 transitions.
Stuttering acceptance computed with spot in 13 ms :[true]
Running random walk in product with property : CloudDeployment-PT-7b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}]], initial=0, aps=[], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-7b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7b-LTLFireability-12 finished in 4025 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p0)) U (p1 U !p2))))'
[2022-05-14 23:00:22] [INFO ] Flatten gal took : 5106 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16328652634379549113
[2022-05-14 23:00:25] [INFO ] Too many transitions (18767) to apply POR reductions. Disabling POR matrices.
[2022-05-14 23:00:26] [INFO ] Built C files in 917ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16328652634379549113
Running compilation step : cd /tmp/ltsmin16328652634379549113;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
[2022-05-14 23:00:28] [INFO ] Applying decomposition
[2022-05-14 23:00:33] [INFO ] Flatten gal took : 5150 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/graph5193244156562904666.txt' '-o' '/tmp/graph5193244156562904666.bin' '-w' '/tmp/graph5193244156562904666.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5193244156562904666.bin' '-l' '-1' '-v' '-w' '/tmp/graph5193244156562904666.weights' '-q' '0' '-e' '0.001'
[2022-05-14 23:00:39] [INFO ] Decomposing Gal with order
[2022-05-14 23:00:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 23:02:11] [INFO ] Removed a total of 191666 redundant transitions.
[2022-05-14 23:02:21] [INFO ] Flatten gal took : 97912 ms
[2022-05-14 23:02:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 32934 labels/synchronizations in 18816 ms.
[2022-05-14 23:02:59] [INFO ] Time to serialize gal into /tmp/LTLFireability7595480557739019132.gal : 332 ms
[2022-05-14 23:02:59] [INFO ] Time to serialize properties into /tmp/LTLFireability1405968944965054486.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/LTLFireability7595480557739019132.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1405968944965054486.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/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !((G((X(X("(i25.u436.p2078==1)")))U(("(i2.i0.i2.u53.p274==1)")U(!("((((i13.i0.i0.u198.p987==1)&&(i13.i0.i0.u204.p1031==1))&&((i11.u215...217
Formula 0 simplified : !G(XX"(i25.u436.p2078==1)" U ("(i2.i0.i2.u53.p274==1)" U !"((((i13.i0.i0.u198.p987==1)&&(i13.i0.i0.u204.p1031==1))&&((i11.u215.p1074...207
Compilation finished in 402968 ms.
Running link step : cd /tmp/ltsmin16328652634379549113;'gcc' '-shared' '-o' 'gal.so' 'model.o'
gcc: error: model.o: No such file or directory
gcc: fatal error: no input files
compilation terminated.
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Could not link executable .cd /tmp/ltsmin16328652634379549113;'gcc' '-shared' '-o' 'gal.so' 'model.o'
java.lang.RuntimeException: Could not link executable .cd /tmp/ltsmin16328652634379549113;'gcc' '-shared' '-o' 'gal.so' 'model.o'
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.linkPINS(LTSminRunner.java:342)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:829)
ITS-tools command line returned an error code 137
[2022-05-14 23:13:06] [INFO ] Applying decomposition
[2022-05-14 23:13:18] [INFO ] Flatten gal took : 12150 ms
[2022-05-14 23:13:23] [INFO ] Decomposing Gal with order
[2022-05-14 23:13:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 23:13:38] [INFO ] Removed a total of 380473 redundant transitions.
[2022-05-14 23:13:39] [INFO ] Flatten gal took : 10954 ms
[2022-05-14 23:13:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 985 labels/synchronizations in 4238 ms.
[2022-05-14 23:13:44] [INFO ] Time to serialize gal into /tmp/LTLFireability382591412698117866.gal : 52 ms
[2022-05-14 23:13:44] [INFO ] Time to serialize properties into /tmp/LTLFireability508349806458137440.ltl : 17 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/LTLFireability382591412698117866.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability508349806458137440.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/LTLFireabi...265
Read 1 LTL properties
Checking formula 0 : !((G((X(X("(i0.i0.i1.u42.p2078==1)")))U(("(i0.i0.i0.i0.i0.i0.i0.i0.u12.p274==1)")U(!("((((i0.i0.i0.i0.i0.i1.i0.u25.p987==1)&&(i0.i0.i0...265
Formula 0 simplified : !G(XX"(i0.i0.i1.u42.p2078==1)" U ("(i0.i0.i0.i0.i0.i0.i0.i0.u12.p274==1)" U !"((((i0.i0.i0.i0.i0.i1.i0.u25.p987==1)&&(i0.i0.i0.i0.i0...255
Reverse transition relation is NOT exact ! Due to transitions t6284, t18160, t18180, t18187, t18202, t18217, t18220, t18234, u56.t2, u56.t3, i0.t18710, i0....3871
Computing Next relation with stutter on 4.74872e+16 deadlock states
80 unique states visited
80 strongly connected components in search stack
81 transitions explored
80 items max in DFS search stack
4500 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,45.2238,955244,1,0,1.34097e+06,663915,33769,2.94081e+06,9270,4.04457e+06,3450587
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudDeployment-PT-7b-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 1133079 ms.

BK_STOP 1652570079520

--------------------
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-7b"
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-7b, 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-165252095200092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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