About the Execution of ITS-Tools for CloudReconfiguration-PT-304
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15742.180 | 903087.00 | 1008750.00 | 440.30 | TTFFFFFFFFTFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r051-ebro-158902545600026.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CloudReconfiguration-PT-304, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r051-ebro-158902545600026
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 3.6K Mar 30 01:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 30 01:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 28 16:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 8 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 08:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 27 08:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 26 08:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.5K Mar 26 08:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 660K Mar 24 05:37 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 CloudReconfiguration-PT-304-00
FORMULA_NAME CloudReconfiguration-PT-304-01
FORMULA_NAME CloudReconfiguration-PT-304-02
FORMULA_NAME CloudReconfiguration-PT-304-03
FORMULA_NAME CloudReconfiguration-PT-304-04
FORMULA_NAME CloudReconfiguration-PT-304-05
FORMULA_NAME CloudReconfiguration-PT-304-06
FORMULA_NAME CloudReconfiguration-PT-304-07
FORMULA_NAME CloudReconfiguration-PT-304-08
FORMULA_NAME CloudReconfiguration-PT-304-09
FORMULA_NAME CloudReconfiguration-PT-304-10
FORMULA_NAME CloudReconfiguration-PT-304-11
FORMULA_NAME CloudReconfiguration-PT-304-12
FORMULA_NAME CloudReconfiguration-PT-304-13
FORMULA_NAME CloudReconfiguration-PT-304-14
FORMULA_NAME CloudReconfiguration-PT-304-15
=== Now, execution of the tool begins
BK_START 1589490263955
[2020-05-14 21:04:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-14 21:04:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-14 21:04:27] [INFO ] Load time of PNML (sax parser for PT used): 320 ms
[2020-05-14 21:04:27] [INFO ] Transformed 2584 places.
[2020-05-14 21:04:27] [INFO ] Transformed 3094 transitions.
[2020-05-14 21:04:27] [INFO ] Found NUPN structural information;
[2020-05-14 21:04:27] [INFO ] Parsed PT model containing 2584 places and 3094 transitions in 426 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 132 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 783 resets, run finished after 653 ms. (steps per millisecond=153 ) properties seen :[0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1]
// Phase 1: matrix 3094 rows 2584 cols
[2020-05-14 21:04:28] [INFO ] Computed 4 place invariants in 139 ms
[2020-05-14 21:04:29] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 136 ms returned sat
[2020-05-14 21:04:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 21:04:48] [INFO ] [Real]Absence check using state equation in 19207 ms returned (error "Solver has unexpectedly terminated")
[2020-05-14 21:04:49] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 117 ms returned sat
[2020-05-14 21:04:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 21:05:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 21:05:08] [INFO ] [Real]Absence check using state equation in 19404 ms returned (error "Failed to check-sat")
[2020-05-14 21:05:09] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 117 ms returned sat
[2020-05-14 21:05:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 21:05:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 21:05:28] [INFO ] [Real]Absence check using state equation in 19358 ms returned (error "Failed to check-sat")
[2020-05-14 21:05:29] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-05-14 21:05:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 21:05:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 21:05:48] [INFO ] [Real]Absence check using state equation in 19410 ms returned (error "Failed to check-sat")
[2020-05-14 21:05:49] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-05-14 21:05:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 21:06:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 21:06:08] [INFO ] [Real]Absence check using state equation in 19420 ms returned (error "Failed to check-sat")
[2020-05-14 21:06:09] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-05-14 21:06:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 21:06:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 21:06:28] [INFO ] [Real]Absence check using state equation in 19406 ms returned (error "Failed to check-sat")
[2020-05-14 21:06:29] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 117 ms returned sat
[2020-05-14 21:06:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 21:06:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 21:06:48] [INFO ] [Real]Absence check using state equation in 19354 ms returned (error "Failed to check-sat")
[2020-05-14 21:06:49] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 112 ms returned sat
[2020-05-14 21:06:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 21:07:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 21:07:08] [INFO ] [Real]Absence check using state equation in 19428 ms returned unknown
[2020-05-14 21:07:09] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 120 ms returned sat
[2020-05-14 21:07:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 21:07:13] [INFO ] [Real]Absence check using state equation in 4249 ms returned unsat
[2020-05-14 21:07:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 117 ms returned sat
[2020-05-14 21:07:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 21:07:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 21:07:33] [INFO ] [Real]Absence check using state equation in 19440 ms returned (error "Failed to check-sat")
[2020-05-14 21:07:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 112 ms returned sat
[2020-05-14 21:07:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 21:07:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 21:07:53] [INFO ] [Real]Absence check using state equation in 19395 ms returned (error "Failed to check-sat")
[2020-05-14 21:07:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 112 ms returned sat
[2020-05-14 21:07:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 21:08:13] [INFO ] [Real]Absence check using state equation in 19428 ms returned (error "Solver has unexpectedly terminated")
[2020-05-14 21:08:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 117 ms returned sat
[2020-05-14 21:08:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 21:08:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 21:08:33] [INFO ] [Real]Absence check using state equation in 19436 ms returned (error "Failed to check-sat")
[2020-05-14 21:08:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 116 ms returned sat
[2020-05-14 21:08:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 21:08:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 21:08:53] [INFO ] [Real]Absence check using state equation in 19413 ms returned (error "Failed to check-sat")
[2020-05-14 21:08:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-05-14 21:08:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 21:09:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 21:09:13] [INFO ] [Real]Absence check using state equation in 19404 ms returned (error "Failed to check-sat")
[2020-05-14 21:09:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-05-14 21:09:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 21:09:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 21:09:33] [INFO ] [Real]Absence check using state equation in 19407 ms returned unknown
[2020-05-14 21:09:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-05-14 21:09:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 21:09:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 21:09:53] [INFO ] [Real]Absence check using state equation in 19412 ms returned unknown
[2020-05-14 21:09:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-05-14 21:09:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 21:10:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 21:10:13] [INFO ] [Real]Absence check using state equation in 19421 ms returned (error "Failed to check-sat")
[2020-05-14 21:10:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-05-14 21:10:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 21:10:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 21:10:33] [INFO ] [Real]Absence check using state equation in 19388 ms returned (error "Failed to check-sat")
[2020-05-14 21:10:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 113 ms returned sat
[2020-05-14 21:10:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 21:10:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 21:10:53] [INFO ] [Real]Absence check using state equation in 19422 ms returned unknown
[2020-05-14 21:10:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-05-14 21:10:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 21:11:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 21:11:13] [INFO ] [Real]Absence check using state equation in 19434 ms returned (error "Failed to check-sat")
[2020-05-14 21:11:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 113 ms returned sat
[2020-05-14 21:11:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 21:11:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 21:11:34] [INFO ] [Real]Absence check using state equation in 19424 ms returned (error "Failed to check-sat")
[2020-05-14 21:11:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-05-14 21:11:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 21:11:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 21:11:54] [INFO ] [Real]Absence check using state equation in 19400 ms returned unknown
[2020-05-14 21:11:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 120 ms returned sat
[2020-05-14 21:11:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 21:12:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 21:12:14] [INFO ] [Real]Absence check using state equation in 19423 ms returned (error "Failed to check-sat")
[2020-05-14 21:12:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-05-14 21:12:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 21:12:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 21:12:34] [INFO ] [Real]Absence check using state equation in 19430 ms returned (error "Failed to check-sat")
[2020-05-14 21:12:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 118 ms returned sat
[2020-05-14 21:12:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 21:12:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 21:12:54] [INFO ] [Real]Absence check using state equation in 19420 ms returned (error "Failed to check-sat")
[2020-05-14 21:12:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 112 ms returned sat
[2020-05-14 21:12:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 21:13:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 21:13:14] [INFO ] [Real]Absence check using state equation in 19441 ms returned (error "Failed to check-sat")
[2020-05-14 21:13:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 113 ms returned sat
[2020-05-14 21:13:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 21:13:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 21:13:34] [INFO ] [Real]Absence check using state equation in 19400 ms returned (error "Failed to check-sat")
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-14 21:13:34] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-14 21:13:35] [INFO ] Flatten gal took : 429 ms
FORMULA CloudReconfiguration-PT-304-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-304-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-304-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-304-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-14 21:13:35] [INFO ] Flatten gal took : 225 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-14 21:13:35] [INFO ] Applying decomposition
[2020-05-14 21:13:35] [INFO ] Flatten gal took : 199 ms
[2020-05-14 21:13:36] [INFO ] Input system was already deterministic with 3094 transitions.
[2020-05-14 21:13:36] [INFO ] Too many transitions (3094) to apply POR reductions. Disabling POR matrices.
[2020-05-14 21:13:36] [INFO ] Built C files in 878ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph18200706693474145730.txt, -o, /tmp/graph18200706693474145730.bin, -w, /tmp/graph18200706693474145730.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph18200706693474145730.bin, -l, -1, -v, -w, /tmp/graph18200706693474145730.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-14 21:13:36] [INFO ] Decomposing Gal with order
[2020-05-14 21:13:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-14 21:13:38] [INFO ] Removed a total of 579 redundant transitions.
[2020-05-14 21:13:38] [INFO ] Flatten gal took : 629 ms
[2020-05-14 21:13:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 77 ms.
[2020-05-14 21:13:38] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 76 ms
[2020-05-14 21:13:38] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 12 LTL properties
Checking formula 0 : !((X((!(F((F("((i22.i2.i0.u230.p572==1)&&(i18.i4.i3.u428.p1073==1))"))U("((i22.i2.i0.u230.p572!=1)||(i18.i4.i3.u428.p1073!=1))"))))||(!(G("(i22.i2.i0.u6.p20==1)"))))))
Formula 0 simplified : !X(!F(F"((i22.i2.i0.u230.p572==1)&&(i18.i4.i3.u428.p1073==1))" U "((i22.i2.i0.u230.p572!=1)||(i18.i4.i3.u428.p1073!=1))") | !G"(i22.i2.i0.u6.p20==1)")
built 96 ordering constraints for composite.
built 13 ordering constraints for composite.
built 5 ordering constraints for composite.
built 3 ordering constraints for composite.
built 11 ordering constraints for composite.
built 3 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 13 ordering constraints for composite.
built 8 ordering constraints for composite.
built 3 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 19 ordering constraints for composite.
built 13 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 11 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 13 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 76 ordering constraints for composite.
built 14 ordering constraints for composite.
built 5 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 13 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 3 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 3 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 3 ordering constraints for composite.
built 19 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 15 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 3 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 3 ordering constraints for composite.
built 18 ordering constraints for composite.
built 39 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 35 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 67 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 30 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 34 ordering constraints for composite.
built 35 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 3 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 3 ordering constraints for composite.
built 25 ordering constraints for composite.
built 25 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 18 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 38 ordering constraints for composite.
built 36 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 68 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 12 ordering constraints for composite.
built 13 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
built 19 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 8 ordering constraints for composite.
built 3 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 41 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 35 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 67 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t36, t59, t323, t481, t548, t557, t625, t754, t777, t1041, t1121, t1199, t1266, t1343, t1471, t1494, t1758, t1838, t1916, t1983, t2060, t2238, t2395, t2458, t2615, t2678, t2835, t2868, i7.t2866, i7.t2860, i7.t2854, i7.t2848, i7.t2846, i7.t2841, i7.t2807, i7.t2647, i7.t2642, i7.t2637, i7.t2628, i7.t2626, i7.t2621, i7.t2587, i7.t2427, i7.t2422, i7.t2417, i7.t2408, i7.t2406, i7.t2401, i7.t2367, i7.t2207, i7.t2202, i7.t2197, i7.u5.t2181, i11.i0.i0.t2176, i11.i0.i1.t2168, i11.i1.i0.t1467, i11.i1.i1.t2152, i13.t1957, i13.t1922, i13.t1915, i13.i0.t2024, i13.i0.i2.t2041, i13.i0.i2.u310.t2039, i13.i2.i1.u319.t1946, i15.i0.i0.u263.t2106, i15.i0.i1.u283.t2052, i15.i1.t1733, i15.i1.t1896, i15.i1.i1.u287.t2121, i15.i1.i1.u500.t1464, i15.i1.i1.u500.t2131, i15.i1.i3.t1737, i15.i1.i3.t1732, i15.i1.i3.u394.t1735, i16.t1799, i16.t1764, i16.i0.t1829, i16.i0.t1870, i16.i0.i5.t1889, i16.i0.i5.t1887, i16.i0.i5.u384.t1757, i16.i2.i0.u377.t1788, i18.t1671, i18.t1651, i18.t1649, i18.i0.t1663, i18.i0.i0.t1667, i18.i4.t1718, i18.i4.i4.t1726, i18.i4.i4.t1724, i18.i4.i4.t1722, i18.i4.i4.t1720, i18.i4.i4.t1705, i18.i4.i4.t1703, i18.i4.i4.t1689, i18.i4.i4.t1675, i18.i4.i4.t1673, i18.i4.i4.t1626, i18.i4.i4.t1624, i18.i4.i4.t1608, i18.i4.i4.t1606, i18.i4.i4.t1604, i18.i4.i4.t1589, i18.i4.i4.t1587, i18.i4.i4.t1533, i18.i4.i4.u485.t1493, i18.i4.i4.u485.t1497, i18.i4.i4.u485.t1504, i18.i4.i4.u485.t1524, i18.i4.i4.u485.t1531, i18.i4.i4.u485.t1548, i18.i4.i4.u485.t1551, i18.i4.i4.u485.t1558, i18.i4.i4.u485.t1578, i18.i4.i4.u485.t1585, i18.i4.i4.u485.t1600, i18.i4.i4.u485.t1622, i18.i4.i4.u485.t1680, i18.i4.i4.u485.t1687, i18.i4.i4.u485.t1694, i18.i4.i4.u485.t1701, i18.i4.i4.u485.t1711, i19.i1.t1569, i19.i1.i0.t1573, i21.i1.t1515, i21.i1.i0.t1519, i22.i1.t750, i22.i2.i0.u6.t3, i22.i2.i2.u503.t1459, i22.i2.i3.t1451, i22.i2.i4.t1435, i25.i0.t1016, i25.i0.i2.u764.t747, i25.i0.i2.u764.t1414, i25.i0.i3.t1179, i25.i0.i3.u554.t1404, i25.i0.i4.t1020, i25.i0.i4.t1015, i25.i0.i4.u660.t1018, i25.i1.i0.u532.t1389, i25.i1.i1.u550.t1335, i26.t1240, i26.t1205, i26.t1198, i26.i0.t1307, i26.i0.i2.t1324, i26.i0.i2.u573.t1322, i26.i3.i3.u592.t1229, i28.t1153, i28.t1047, i28.i1.t1040, i28.i1.t1082, i28.i1.t1112, i28.i1.i0.t1172, i28.i1.i0.t1170, i28.i3.i1.u647.t1071, i29.t954, i29.t934, i29.t932, i29.i0.t1001, i29.i0.i5.t1009, i29.i0.i5.t1007, i29.i0.i5.t1005, i29.i0.i5.t1003, i29.i0.i5.t988, i29.i0.i5.t986, i29.i0.i5.t972, i29.i0.i5.t958, i29.i0.i5.t956, i29.i0.i5.t909, i29.i0.i5.t907, i29.i0.i5.t893, i29.i0.i5.t889, i29.i0.i5.t885, i29.i0.i5.t872, i29.i0.i5.t870, i29.i0.i5.t816, i29.i0.i5.u749.t776, i29.i0.i5.u749.t780, i29.i0.i5.u749.t787, i29.i0.i5.u749.t807, i29.i0.i5.u749.t814, i29.i0.i5.u749.t831, i29.i0.i5.u749.t834, i29.i0.i5.u749.t841, i29.i0.i5.u749.t861, i29.i0.i5.u749.t868, i29.i0.i5.u749.t883, i29.i0.i5.u749.t905, i29.i0.i5.u749.t963, i29.i0.i5.u749.t970, i29.i0.i5.u749.t977, i29.i0.i5.u749.t984, i29.i0.i5.u749.t994, i29.i1.t946, i29.i1.i0.t950, i30.i1.t852, i30.i1.i0.t856, i32.i1.t798, i32.i1.i0.t802, i35.t522, i35.t487, i35.t480, i35.i0.t589, i35.i0.i1.t606, i35.i0.i1.u818.t604, i35.i2.i0.u855.t511, i36.i0.i0.u793.t671, i36.i0.i1.u812.t617, i36.i1.t298, i36.i1.t461, i36.i1.i0.u765.t29, i36.i1.i0.u765.t696, i36.i1.i0.u816.t686, i36.i1.i3.t302, i36.i1.i3.t297, i36.i1.i3.u924.t300, i37.t435, i37.t394, i37.t329, i37.i2.t322, i37.i2.t364, i37.i2.i0.t454, i37.i2.i0.t452, i37.i3.i2.u909.t353, i38.t236, i38.t214, i38.i0.t228, i38.i0.i0.t232, i38.i4.t283, i38.i4.i4.t291, i38.i4.i4.t289, i38.i4.i4.t287, i38.i4.i4.t285, i38.i4.i4.t270, i38.i4.i4.t268, i38.i4.i4.t254, i38.i4.i4.t240, i38.i4.i4.t238, i38.i4.i4.t191, i38.i4.i4.t189, i38.i4.i4.t173, i38.i4.i4.t171, i38.i4.i4.t169, i38.i4.i4.t154, i38.i4.i4.t152, i38.i4.i4.t98, i38.i4.i4.u1016.t58, i38.i4.i4.u1016.t62, i38.i4.i4.u1016.t69, i38.i4.i4.u1016.t89, i38.i4.i4.u1016.t96, i38.i4.i4.u1016.t113, i38.i4.i4.u1016.t116, i38.i4.i4.u1016.t123, i38.i4.i4.u1016.t143, i38.i4.i4.u1016.t150, i38.i4.i4.u1016.t165, i38.i4.i4.u1016.t187, i38.i4.i4.u1016.t245, i38.i4.i4.u1016.t252, i38.i4.i4.u1016.t259, i38.i4.i4.u1016.t266, i38.i4.i4.u1016.t276, i39.i1.t134, i39.i1.i0.t138, i41.i1.t80, i41.i1.i0.t84, i42.i0.i0.u768.t741, i42.i0.i1.t733, i42.i1.i0.t717, i42.i1.i2.u1029.t32, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/2802/274/3076
Computing Next relation with stutter on 502928 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
3296 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,33.4606,598720,1,0,748320,11526,31325,1.90882e+06,775,78510,6276811
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CloudReconfiguration-PT-304-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(X((G(!(G("(i13.i2.i0.u327.p816==1)"))))U(F(X(F(G(X(("(i18.i4.i4.u433.p1095==1)")U("(i2.i2.i0.u72.p183==1)")))))))))))
Formula 1 simplified : !FX(G!G"(i13.i2.i0.u327.p816==1)" U FXFGX("(i18.i4.i4.u433.p1095==1)" U "(i2.i2.i0.u72.p183==1)"))
Computing Next relation with stutter on 502928 deadlock states
47 unique states visited
46 strongly connected components in search stack
48 transitions explored
47 items max in DFS search stack
670 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,40.1646,676624,1,0,939905,11830,35992,2.38094e+06,835,78510,6791151
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-304-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(F("(i13.i0.i2.u334.p838==1)"))))
Formula 2 simplified : !GF"(i13.i0.i2.u334.p838==1)"
Computing Next relation with stutter on 502928 deadlock states
48 unique states visited
48 strongly connected components in search stack
49 transitions explored
48 items max in DFS search stack
348 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,43.648,738396,1,0,1.07992e+06,11878,36093,2.71993e+06,835,78510,7082631
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-304-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(X(!(X(G((F(X(G((G("(i1.i0.i0.u32.p79==1)"))U("(i37.i4.i3.u922.p2302==1)")))))&&("(i38.i4.i2.u941.p2355==1)"))))))))
Formula 3 simplified : X!XG("(i38.i4.i2.u941.p2355==1)" & FXG(G"(i1.i0.i0.u32.p79==1)" U "(i37.i4.i3.u922.p2302==1)"))
Computing Next relation with stutter on 502928 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
0 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,43.6547,739348,1,0,1.07993e+06,11878,36115,2.71994e+06,835,78510,7082802
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-304-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((F(("(i29.i0.i1.u671.p1675==1)")U(!(("(i27.u613.p1549==1)")U("(i29.i0.i1.u671.p1675==1)")))))U((X("(i29.i0.i1.u671.p1675==1)"))||(F(G("(i21.i1.i1.u476.p1190!=1)"))))))
Formula 4 simplified : !(F("(i29.i0.i1.u671.p1675==1)" U !("(i27.u613.p1549==1)" U "(i29.i0.i1.u671.p1675==1)")) U (X"(i29.i0.i1.u671.p1675==1)" | FG"(i21.i1.i1.u476.p1190!=1)"))
Computing Next relation with stutter on 502928 deadlock states
Compilation finished in 69547 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 104 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, (<>(((LTLAP10==true))U(!( ((LTLAP11==true))U((LTLAP10==true))) )))U(( X((LTLAP10==true))) || ( <>([]((LTLAP12==true)))) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, (<>(((LTLAP10==true))U(!( ((LTLAP11==true))U((LTLAP10==true))) )))U(( X((LTLAP10==true))) || ( <>([]((LTLAP12==true)))) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, (<>(((LTLAP10==true))U(!( ((LTLAP11==true))U((LTLAP10==true))) )))U(( X((LTLAP10==true))) || ( <>([]((LTLAP12==true)))) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
8 unique states visited
4 strongly connected components in search stack
8 transitions explored
6 items max in DFS search stack
24146 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,285.12,2204416,1,0,3.38133e+06,14604,12806,6.4019e+06,444,80878,8158769
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-304-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(G(X("((i25.i0.i2.u764.p1908==1)&&(i43.u1033.p2575==1))")))))
Formula 5 simplified : !FGX"((i25.i0.i2.u764.p1908==1)&&(i43.u1033.p2575==1))"
Computing Next relation with stutter on 502928 deadlock states
47 unique states visited
46 strongly connected components in search stack
48 transitions explored
47 items max in DFS search stack
323 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,288.349,2254312,1,0,3.52537e+06,14604,14897,6.4019e+06,479,80878,8500254
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-304-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G("(i19.i1.i1.u454.p1137!=1)")))
Formula 6 simplified : !G"(i19.i1.i1.u454.p1137!=1)"
Computing Next relation with stutter on 502928 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
190 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,290.254,2292856,1,0,3.60497e+06,14604,14977,6.4019e+06,480,80878,8695157
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-304-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(((X(!(X("(i24.i0.i1.u566.p1409==1)"))))&&(G("(i13.i2.i1.u318.p794==1)")))U(F((F("(i24.i0.i1.u566.p1409==1)"))||("(i16.i3.i1.u386.p965==1)"))))))
Formula 7 simplified : (X!X"(i24.i0.i1.u566.p1409==1)" & G"(i13.i2.i1.u318.p794==1)") U F("(i16.i3.i1.u386.p965==1)" | F"(i24.i0.i1.u566.p1409==1)")
Computing Next relation with stutter on 502928 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
375 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,294.005,2372012,1,0,3.77292e+06,14604,15079,6.4019e+06,480,80878,9045359
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-304-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((((F("(i36.i1.i0.u786.p1957==1)"))&&("(i15.i1.i1.u257.p637!=1)"))&&("(i36.i1.i0.u786.p1957==1)"))U((F("(i40.i1.i1.u999.p2492==1)"))U("(i40.i1.i1.u999.p2492==1)"))))
Formula 8 simplified : !(("(i15.i1.i1.u257.p637!=1)" & "(i36.i1.i0.u786.p1957==1)" & F"(i36.i1.i0.u786.p1957==1)") U (F"(i40.i1.i1.u999.p2492==1)" U "(i40.i1.i1.u999.p2492==1)"))
Computing Next relation with stutter on 502928 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
5 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,294.058,2373068,1,0,3.77476e+06,14604,15107,6.4019e+06,480,80878,9050368
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-304-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((!(F(G(!(X(X(G((X("(i16.i1.i2.u365.p916==1)"))&&((X(F("(i25.i0.i0.u501.p1896==1)")))||("(i16.i1.i2.u365.p916==1)")))))))))))
Formula 9 simplified : FG!XXG(X"(i16.i1.i2.u365.p916==1)" & ("(i16.i1.i2.u365.p916==1)" | XF"(i25.i0.i0.u501.p1896==1)"))
Computing Next relation with stutter on 502928 deadlock states
124 unique states visited
124 strongly connected components in search stack
125 transitions explored
124 items max in DFS search stack
2544 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,319.495,2682588,1,0,4.28994e+06,15935,15242,7.43108e+06,482,82973,9895537
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-304-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X((G(("(i18.i4.i4.u485.p1001==1)")U(F("(i18.i4.i4.u485.p1001==1)"))))&&(X("(i37.i1.i1.u884.p2204==1)")))))
Formula 10 simplified : !X(G("(i18.i4.i4.u485.p1001==1)" U F"(i18.i4.i4.u485.p1001==1)") & X"(i37.i1.i1.u884.p2204==1)")
Computing Next relation with stutter on 502928 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
2587 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,345.371,2682588,1,0,4.28995e+06,15935,12967,7.43109e+06,443,82973,654060
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-304-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X((((X(F("(i37.i4.i1.u898.p2242==1)")))U("(i36.i1.i1.u817.p2559==1)"))||("(i40.i1.i0.u996.p2485!=1)"))||("(i28.i0.i3.u631.p1576==1)"))))
Formula 11 simplified : !X("(i28.i0.i3.u631.p1576==1)" | "(i40.i1.i0.u996.p2485!=1)" | (XF"(i37.i4.i1.u898.p2242==1)" U "(i36.i1.i1.u817.p2559==1)"))
Computing Next relation with stutter on 502928 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
67 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,346.044,2682588,1,0,4.28995e+06,15935,14751,7.43109e+06,482,82973,758380
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA CloudReconfiguration-PT-304-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
BK_STOP 1589491167042
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
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="CloudReconfiguration-PT-304"
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"
# 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 CloudReconfiguration-PT-304, 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 r051-ebro-158902545600026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-304.tgz
mv CloudReconfiguration-PT-304 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;