About the Execution of ITS-Tools for Parking-PT-432
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15742.380 | 3600000.00 | 3627144.00 | 21203.70 | FTT????????????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961257800540.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 Parking-PT-432, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961257800540
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 3.7K Apr 11 23:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 11 23:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 10 22:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 10 22:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 10 07:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 07:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 12:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 9 12:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 10 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 10 22:21 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 192K 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 Parking-PT-432-CTLFireability-00
FORMULA_NAME Parking-PT-432-CTLFireability-01
FORMULA_NAME Parking-PT-432-CTLFireability-02
FORMULA_NAME Parking-PT-432-CTLFireability-03
FORMULA_NAME Parking-PT-432-CTLFireability-04
FORMULA_NAME Parking-PT-432-CTLFireability-05
FORMULA_NAME Parking-PT-432-CTLFireability-06
FORMULA_NAME Parking-PT-432-CTLFireability-07
FORMULA_NAME Parking-PT-432-CTLFireability-08
FORMULA_NAME Parking-PT-432-CTLFireability-09
FORMULA_NAME Parking-PT-432-CTLFireability-10
FORMULA_NAME Parking-PT-432-CTLFireability-11
FORMULA_NAME Parking-PT-432-CTLFireability-12
FORMULA_NAME Parking-PT-432-CTLFireability-13
FORMULA_NAME Parking-PT-432-CTLFireability-14
FORMULA_NAME Parking-PT-432-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1590000714613
[2020-05-20 18:51:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -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-20 18:51:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-20 18:51:57] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2020-05-20 18:51:57] [INFO ] Transformed 529 places.
[2020-05-20 18:51:57] [INFO ] Transformed 785 transitions.
[2020-05-20 18:51:57] [INFO ] Found NUPN structural information;
[2020-05-20 18:51:57] [INFO ] Parsed PT model containing 529 places and 785 transitions in 217 ms.
Ensure Unique test removed 328 transitions
Reduce redundant transitions removed 328 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 62 ms.
Incomplete random walk after 100000 steps, including 910 resets, run finished after 733 ms. (steps per millisecond=136 ) properties seen :[1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0]
// Phase 1: matrix 457 rows 529 cols
[2020-05-20 18:51:58] [INFO ] Computed 124 place invariants in 38 ms
[2020-05-20 18:51:58] [INFO ] [Real]Absence check using 120 positive place invariants in 91 ms returned sat
[2020-05-20 18:51:58] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 7 ms returned sat
[2020-05-20 18:51:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:59] [INFO ] [Real]Absence check using state equation in 691 ms returned sat
[2020-05-20 18:51:59] [INFO ] State equation strengthened by 108 read => feed constraints.
[2020-05-20 18:51:59] [INFO ] [Real]Added 108 Read/Feed constraints in 49 ms returned sat
[2020-05-20 18:51:59] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 112 ms.
[2020-05-20 18:52:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:52:00] [INFO ] [Nat]Absence check using 120 positive place invariants in 68 ms returned sat
[2020-05-20 18:52:00] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 18:52:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:52:01] [INFO ] [Nat]Absence check using state equation in 752 ms returned sat
[2020-05-20 18:52:01] [INFO ] [Nat]Added 108 Read/Feed constraints in 16 ms returned sat
[2020-05-20 18:52:01] [INFO ] Deduced a trap composed of 67 places in 77 ms
[2020-05-20 18:52:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2020-05-20 18:52:01] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 117 ms.
[2020-05-20 18:52:05] [INFO ] Added : 400 causal constraints over 80 iterations in 4509 ms. Result :sat
[2020-05-20 18:52:05] [INFO ] [Real]Absence check using 120 positive place invariants in 51 ms returned unsat
[2020-05-20 18:52:06] [INFO ] [Real]Absence check using 120 positive place invariants in 166 ms returned sat
[2020-05-20 18:52:06] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 18:52:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:52:06] [INFO ] [Real]Absence check using state equation in 688 ms returned sat
[2020-05-20 18:52:07] [INFO ] [Real]Added 108 Read/Feed constraints in 14 ms returned sat
[2020-05-20 18:52:07] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 28 ms.
[2020-05-20 18:52:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:52:07] [INFO ] [Nat]Absence check using 120 positive place invariants in 170 ms returned sat
[2020-05-20 18:52:07] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 18:52:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:52:08] [INFO ] [Nat]Absence check using state equation in 972 ms returned sat
[2020-05-20 18:52:08] [INFO ] [Nat]Added 108 Read/Feed constraints in 32 ms returned sat
[2020-05-20 18:52:08] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 141 ms.
[2020-05-20 18:52:12] [INFO ] Added : 451 causal constraints over 91 iterations in 4372 ms. Result :sat
[2020-05-20 18:52:13] [INFO ] Deduced a trap composed of 60 places in 143 ms
[2020-05-20 18:52:13] [INFO ] Deduced a trap composed of 52 places in 72 ms
[2020-05-20 18:52:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 403 ms
[2020-05-20 18:52:13] [INFO ] [Real]Absence check using 120 positive place invariants in 64 ms returned unsat
[2020-05-20 18:52:13] [INFO ] [Real]Absence check using 120 positive place invariants in 99 ms returned sat
[2020-05-20 18:52:13] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-20 18:52:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:52:14] [INFO ] [Real]Absence check using state equation in 696 ms returned sat
[2020-05-20 18:52:14] [INFO ] [Real]Added 108 Read/Feed constraints in 15 ms returned sat
[2020-05-20 18:52:14] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 53 ms.
[2020-05-20 18:52:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:52:14] [INFO ] [Nat]Absence check using 120 positive place invariants in 62 ms returned sat
[2020-05-20 18:52:14] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 18:52:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:52:15] [INFO ] [Nat]Absence check using state equation in 604 ms returned sat
[2020-05-20 18:52:15] [INFO ] [Nat]Added 108 Read/Feed constraints in 37 ms returned sat
[2020-05-20 18:52:15] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 46 ms.
[2020-05-20 18:52:19] [INFO ] Added : 430 causal constraints over 86 iterations in 4009 ms. Result :sat
[2020-05-20 18:52:19] [INFO ] Deduced a trap composed of 52 places in 80 ms
[2020-05-20 18:52:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2020-05-20 18:52:19] [INFO ] [Real]Absence check using 120 positive place invariants in 68 ms returned sat
[2020-05-20 18:52:19] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-20 18:52:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:52:20] [INFO ] [Real]Absence check using state equation in 812 ms returned sat
[2020-05-20 18:52:20] [INFO ] [Real]Added 108 Read/Feed constraints in 69 ms returned sat
[2020-05-20 18:52:20] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 30 ms.
[2020-05-20 18:52:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:52:20] [INFO ] [Nat]Absence check using 120 positive place invariants in 68 ms returned sat
[2020-05-20 18:52:20] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 18:52:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:52:21] [INFO ] [Nat]Absence check using state equation in 668 ms returned sat
[2020-05-20 18:52:21] [INFO ] [Nat]Added 108 Read/Feed constraints in 32 ms returned sat
[2020-05-20 18:52:21] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 26 ms.
[2020-05-20 18:52:25] [INFO ] Added : 426 causal constraints over 86 iterations in 3959 ms. Result :sat
[2020-05-20 18:52:25] [INFO ] Deduced a trap composed of 52 places in 44 ms
[2020-05-20 18:52:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2020-05-20 18:52:25] [INFO ] [Real]Absence check using 120 positive place invariants in 64 ms returned sat
[2020-05-20 18:52:25] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-20 18:52:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:52:26] [INFO ] [Real]Absence check using state equation in 742 ms returned sat
[2020-05-20 18:52:26] [INFO ] [Real]Added 108 Read/Feed constraints in 21 ms returned sat
[2020-05-20 18:52:26] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 21 ms.
[2020-05-20 18:52:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:52:26] [INFO ] [Nat]Absence check using 120 positive place invariants in 71 ms returned sat
[2020-05-20 18:52:26] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 18:52:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:52:27] [INFO ] [Nat]Absence check using state equation in 622 ms returned sat
[2020-05-20 18:52:27] [INFO ] [Nat]Added 108 Read/Feed constraints in 27 ms returned sat
[2020-05-20 18:52:27] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 60 ms.
[2020-05-20 18:52:31] [INFO ] Added : 437 causal constraints over 88 iterations in 3866 ms. Result :sat
[2020-05-20 18:52:31] [INFO ] Deduced a trap composed of 52 places in 58 ms
[2020-05-20 18:52:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2020-05-20 18:52:32] [INFO ] [Real]Absence check using 120 positive place invariants in 183 ms returned sat
[2020-05-20 18:52:32] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-20 18:52:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:52:33] [INFO ] [Real]Absence check using state equation in 1034 ms returned sat
[2020-05-20 18:52:33] [INFO ] [Real]Added 108 Read/Feed constraints in 28 ms returned sat
[2020-05-20 18:52:33] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 23 ms.
[2020-05-20 18:52:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:52:33] [INFO ] [Nat]Absence check using 120 positive place invariants in 66 ms returned sat
[2020-05-20 18:52:33] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 18:52:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:52:34] [INFO ] [Nat]Absence check using state equation in 720 ms returned sat
[2020-05-20 18:52:34] [INFO ] [Nat]Added 108 Read/Feed constraints in 27 ms returned sat
[2020-05-20 18:52:34] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 21 ms.
[2020-05-20 18:52:38] [INFO ] Added : 431 causal constraints over 87 iterations in 4102 ms. Result :sat
[2020-05-20 18:52:38] [INFO ] Deduced a trap composed of 60 places in 47 ms
[2020-05-20 18:52:38] [INFO ] Deduced a trap composed of 52 places in 49 ms
[2020-05-20 18:52:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 216 ms
[2020-05-20 18:52:38] [INFO ] [Real]Absence check using 120 positive place invariants in 69 ms returned unsat
[2020-05-20 18:52:38] [INFO ] [Real]Absence check using 120 positive place invariants in 65 ms returned sat
[2020-05-20 18:52:38] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-20 18:52:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:52:39] [INFO ] [Real]Absence check using state equation in 609 ms returned sat
[2020-05-20 18:52:39] [INFO ] [Real]Added 108 Read/Feed constraints in 19 ms returned sat
[2020-05-20 18:52:39] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 22 ms.
[2020-05-20 18:52:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:52:39] [INFO ] [Nat]Absence check using 120 positive place invariants in 64 ms returned sat
[2020-05-20 18:52:39] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 12 ms returned sat
[2020-05-20 18:52:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:52:40] [INFO ] [Nat]Absence check using state equation in 811 ms returned sat
[2020-05-20 18:52:40] [INFO ] [Nat]Added 108 Read/Feed constraints in 18 ms returned sat
[2020-05-20 18:52:40] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 29 ms.
[2020-05-20 18:52:44] [INFO ] Added : 422 causal constraints over 85 iterations in 3788 ms. Result :sat
[2020-05-20 18:52:44] [INFO ] Deduced a trap composed of 52 places in 107 ms
[2020-05-20 18:52:44] [INFO ] Deduced a trap composed of 67 places in 42 ms
[2020-05-20 18:52:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 297 ms
[2020-05-20 18:52:44] [INFO ] [Real]Absence check using 120 positive place invariants in 78 ms returned sat
[2020-05-20 18:52:44] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 18:52:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:52:45] [INFO ] [Real]Absence check using state equation in 594 ms returned sat
[2020-05-20 18:52:45] [INFO ] [Real]Added 108 Read/Feed constraints in 21 ms returned sat
[2020-05-20 18:52:45] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 36 ms.
[2020-05-20 18:52:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:52:45] [INFO ] [Nat]Absence check using 120 positive place invariants in 69 ms returned sat
[2020-05-20 18:52:45] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 18:52:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:52:46] [INFO ] [Nat]Absence check using state equation in 659 ms returned sat
[2020-05-20 18:52:46] [INFO ] [Nat]Added 108 Read/Feed constraints in 15 ms returned sat
[2020-05-20 18:52:46] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 37 ms.
[2020-05-20 18:52:50] [INFO ] Added : 430 causal constraints over 86 iterations in 3933 ms. Result :sat
[2020-05-20 18:52:50] [INFO ] Deduced a trap composed of 52 places in 76 ms
[2020-05-20 18:52:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-05-20 18:52:50] [INFO ] Flatten gal took : 163 ms
[2020-05-20 18:52:50] [INFO ] Flatten gal took : 52 ms
[2020-05-20 18:52:51] [INFO ] Applying decomposition
[2020-05-20 18:52:51] [INFO ] Flatten gal took : 63 ms
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/graph10366323407680161813.txt, -o, /tmp/graph10366323407680161813.bin, -w, /tmp/graph10366323407680161813.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/graph10366323407680161813.bin, -l, -1, -v, -w, /tmp/graph10366323407680161813.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-20 18:52:51] [INFO ] Decomposing Gal with order
[2020-05-20 18:52:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-20 18:52:51] [INFO ] Removed a total of 24 redundant transitions.
[2020-05-20 18:52:51] [INFO ] Flatten gal took : 146 ms
[2020-05-20 18:52:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 29 ms.
[2020-05-20 18:52:52] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 32 ms
[2020-05-20 18:52:52] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 1 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-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
built 48 ordering constraints for composite.
built 39 ordering constraints for composite.
built 22 ordering constraints for composite.
built 12 ordering constraints for composite.
built 24 ordering constraints for composite.
built 14 ordering constraints for composite.
built 25 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 16 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 19 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 16 ordering constraints for composite.
built 20 ordering constraints for composite.
built 5 ordering constraints for composite.
built 31 ordering constraints for composite.
built 17 ordering constraints for composite.
built 22 ordering constraints for composite.
built 5 ordering constraints for composite.
built 26 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 25 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 23 ordering constraints for composite.
built 22 ordering constraints for composite.
built 12 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 5 ordering constraints for composite.
built 41 ordering constraints for composite.
built 22 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.67025e+32,0.557497,21948,839,411,19650,39011,1120,23727,186,63174,0
Converting to forward existential form...Done !
original formula: !(EF(((i1.u146.p438==1)||((i15.i0.i2.u98.p341==1)&&(i15.i1.i2.u128.p398==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((i1.u146.p438==1)||((i15.i0.i2.u98.p341==1)&&(i15.i1.i2.u128.p398==1))))] = FALSE
(forward)formula 0,0,0.560049,21948,1,0,19650,39011,1138,23727,191,63174,188
FORMULA Parking-PT-432-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF((i20.u153.p478==1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i20.u153.p478==1))] != FALSE
(forward)formula 1,1,0.560515,21948,1,0,19650,39011,1139,23727,191,63174,270
FORMULA Parking-PT-432-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EG((((i5.u22.p46!=1)||(i5.u35.p98!=1))||(i18.u155.p487==1)))
=> equivalent forward existential formula: [FwdG(Init,(((i5.u22.p46!=1)||(i5.u35.p98!=1))||(i18.u155.p487==1)))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
(forward)formula 2,1,3.94498,145880,1,0,248952,41193,4276,299259,1099,89267,464947
FORMULA Parking-PT-432-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: !(EG(((i13.u70.p202!=1) + EG((i15.i0.i2.u112.p344==1)))))
=> equivalent forward existential formula: [FwdG(Init,((i13.u70.p202!=1) + EG((i15.i0.i2.u112.p344==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t617, t618, t620, t671, t672, t724, t725, t726, t727, t728, t779, t780, t781, i5.t783, i5.t782, i5.t778, i5.t777, i5.t776, i7.u50.t334, i7.u50.t336, i11.t729, i11.t723, i11.t722, i13.u89.t224, i13.u89.t226, i15.t674, i15.t673, i15.t670, i15.i1.t669, i15.i1.t675, i15.i1.i2.t668, i17.u129.t114, i17.u129.t116, i18.u169.t4, i18.u169.t6, i20.t621, i20.t619, i20.t616, i20.t615, i20.t614, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/417/40/457
Detected timeout of ITS tools.
[2020-05-20 19:13:09] [INFO ] Applying decomposition
[2020-05-20 19:13:09] [INFO ] Flatten gal took : 28 ms
[2020-05-20 19:13:09] [INFO ] Decomposing Gal with order
[2020-05-20 19:13:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-20 19:13:09] [INFO ] Removed a total of 128 redundant transitions.
[2020-05-20 19:13:09] [INFO ] Flatten gal took : 44 ms
[2020-05-20 19:13:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 11 ms.
[2020-05-20 19:13:09] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 8 ms
[2020-05-20 19:13:09] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 1 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-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
built 221 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.67025e+32,0.355732,13472,468,91,9438,3157,1150,16801,136,10427,0
Converting to forward existential form...Done !
original formula: !(EG(((u58.p202!=1) + EG((u87.p344==1)))))
=> equivalent forward existential formula: [FwdG(Init,((u58.p202!=1) + EG((u87.p344==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t614, t615, t616, t617, t618, t619, t620, t621, t668, t669, t670, t671, t672, t673, t674, t675, t722, t723, t724, t725, t726, t727, t728, t729, t776, t777, t778, t779, t780, t781, t782, t783, u39.t334, u39.t336, u66.t224, u66.t226, u93.t114, u93.t116, u120.t4, u120.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/401/40/441
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
Fast SCC detection found an SCC at level 50
Fast SCC detection found an SCC at level 51
Fast SCC detection found an SCC at level 52
Fast SCC detection found an SCC at level 53
Fast SCC detection found an SCC at level 54
Fast SCC detection found an SCC at level 55
Fast SCC detection found an SCC at level 56
Fast SCC detection found an SCC at level 57
Fast SCC detection found an SCC at level 58
Fast SCC detection found an SCC at level 59
Fast SCC detection found an SCC at level 60
Fast SCC detection found an SCC at level 62
Fast SCC detection found an SCC at level 63
Fast SCC detection found an SCC at level 64
Fast SCC detection found an SCC at level 65
Fast SCC detection found an SCC at level 66
Fast SCC detection found an SCC at level 67
Fast SCC detection found an SCC at level 68
Fast SCC detection found an SCC at level 69
Fast SCC detection found an SCC at level 70
Fast SCC detection found an SCC at level 71
Fast SCC detection found an SCC at level 72
Fast SCC detection found an SCC at level 73
Fast SCC detection found an SCC at level 74
Fast SCC detection found an SCC at level 75
Fast SCC detection found an SCC at level 76
Fast SCC detection found an SCC at level 77
Fast SCC detection found an SCC at level 78
Fast SCC detection found an SCC at level 79
Fast SCC detection found an SCC at level 80
Fast SCC detection found an SCC at level 81
Fast SCC detection found an SCC at level 82
Fast SCC detection found an SCC at level 83
Fast SCC detection found an SCC at level 84
Fast SCC detection found an SCC at level 85
Fast SCC detection found an SCC at level 86
Fast SCC detection found an SCC at level 87
Fast SCC detection found an SCC at level 88
Fast SCC detection found an SCC at level 89
Fast SCC detection found an SCC at level 90
Fast SCC detection found an SCC at level 91
Fast SCC detection found an SCC at level 92
Fast SCC detection found an SCC at level 93
Fast SCC detection found an SCC at level 94
Fast SCC detection found an SCC at level 95
Fast SCC detection found an SCC at level 96
Fast SCC detection found an SCC at level 97
Fast SCC detection found an SCC at level 98
Fast SCC detection found an SCC at level 99
Fast SCC detection found an SCC at level 100
Fast SCC detection found an SCC at level 101
Fast SCC detection found an SCC at level 102
Fast SCC detection found an SCC at level 103
Fast SCC detection found an SCC at level 104
Fast SCC detection found an SCC at level 105
Fast SCC detection found an SCC at level 106
Fast SCC detection found an SCC at level 107
Fast SCC detection found an SCC at level 108
Fast SCC detection found an SCC at level 109
Fast SCC detection found an SCC at level 110
Fast SCC detection found an SCC at level 111
Fast SCC detection found an SCC at level 112
Fast SCC detection found an SCC at level 113
Fast SCC detection found an SCC at level 114
Fast SCC detection found an SCC at level 115
Fast SCC detection found an SCC at level 116
Fast SCC detection found an SCC at level 117
Fast SCC detection found an SCC at level 118
Fast SCC detection found an SCC at level 119
Fast SCC detection found an SCC at level 120
Detected timeout of ITS tools.
[2020-05-20 19:33:26] [INFO ] Flatten gal took : 23 ms
[2020-05-20 19:33:26] [INFO ] Input system was already deterministic with 457 transitions.
[2020-05-20 19:33:26] [INFO ] Transformed 529 places.
[2020-05-20 19:33:26] [INFO ] Transformed 457 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-20 19:33:26] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 9 ms
[2020-05-20 19:33:26] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 1 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-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="Parking-PT-432"
export BK_EXAMINATION="CTLFireability"
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 Parking-PT-432, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r111-csrt-158961257800540"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-432.tgz
mv Parking-PT-432 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;