About the Execution of ITS-Tools for QuasiCertifProtocol-PT-28
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1286.932 | 382726.00 | 455883.00 | 237.90 | T???FT?TF???FFTF | 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/mcc2021-input.r178-tajo-162089415200108.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-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 QuasiCertifProtocol-PT-28, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089415200108
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 333K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.0M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 71K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 419K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 27K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 118K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 35K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Mar 27 10:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 27 10:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 25 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 25 13:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.9K Mar 22 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.4M May 5 16:51 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 QuasiCertifProtocol-PT-28-00
FORMULA_NAME QuasiCertifProtocol-PT-28-01
FORMULA_NAME QuasiCertifProtocol-PT-28-02
FORMULA_NAME QuasiCertifProtocol-PT-28-03
FORMULA_NAME QuasiCertifProtocol-PT-28-04
FORMULA_NAME QuasiCertifProtocol-PT-28-05
FORMULA_NAME QuasiCertifProtocol-PT-28-06
FORMULA_NAME QuasiCertifProtocol-PT-28-07
FORMULA_NAME QuasiCertifProtocol-PT-28-08
FORMULA_NAME QuasiCertifProtocol-PT-28-09
FORMULA_NAME QuasiCertifProtocol-PT-28-10
FORMULA_NAME QuasiCertifProtocol-PT-28-11
FORMULA_NAME QuasiCertifProtocol-PT-28-12
FORMULA_NAME QuasiCertifProtocol-PT-28-13
FORMULA_NAME QuasiCertifProtocol-PT-28-14
FORMULA_NAME QuasiCertifProtocol-PT-28-15
=== Now, execution of the tool begins
BK_START 1621236107423
Running Version 0
[2021-05-17 07:21:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 07:21:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 07:21:49] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2021-05-17 07:21:49] [INFO ] Transformed 2998 places.
[2021-05-17 07:21:49] [INFO ] Transformed 446 transitions.
[2021-05-17 07:21:49] [INFO ] Parsed PT model containing 2998 places and 446 transitions in 194 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 07:21:49] [INFO ] Initial state test concluded for 4 properties.
FORMULA QuasiCertifProtocol-PT-28-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1084 out of 2998 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 2968 transition count 446
Applied a total of 30 rules in 301 ms. Remains 2968 /2998 variables (removed 30) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2968 cols
[2021-05-17 07:21:49] [INFO ] Computed 2523 place invariants in 174 ms
[2021-05-17 07:21:51] [INFO ] Implicit Places using invariants in 1908 ms returned []
// Phase 1: matrix 446 rows 2968 cols
[2021-05-17 07:21:51] [INFO ] Computed 2523 place invariants in 48 ms
[2021-05-17 07:21:53] [INFO ] Implicit Places using invariants and state equation in 1615 ms returned []
Implicit Place search using SMT with State Equation took 3552 ms to find 0 implicit places.
// Phase 1: matrix 446 rows 2968 cols
[2021-05-17 07:21:53] [INFO ] Computed 2523 place invariants in 46 ms
[2021-05-17 07:21:54] [INFO ] Dead Transitions using invariants and state equation in 1187 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2968/2998 places, 446/446 transitions.
[2021-05-17 07:21:54] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 07:21:54] [INFO ] Flatten gal took : 184 ms
FORMULA QuasiCertifProtocol-PT-28-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 07:21:54] [INFO ] Flatten gal took : 100 ms
[2021-05-17 07:21:55] [INFO ] Input system was already deterministic with 446 transitions.
Incomplete random walk after 100000 steps, including 3026 resets, run finished after 694 ms. (steps per millisecond=144 ) properties (out of 20) seen :5
Running SMT prover for 15 properties.
// Phase 1: matrix 446 rows 2968 cols
[2021-05-17 07:21:55] [INFO ] Computed 2523 place invariants in 88 ms
[2021-05-17 07:21:56] [INFO ] [Real]Absence check using 2 positive place invariants in 46 ms returned sat
[2021-05-17 07:21:57] [INFO ] [Real]Absence check using 2 positive and 2521 generalized place invariants in 657 ms returned sat
[2021-05-17 07:21:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:22:02] [INFO ] [Real]Absence check using state equation in 5689 ms returned sat
[2021-05-17 07:22:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:22:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 27 ms returned sat
[2021-05-17 07:22:03] [INFO ] [Nat]Absence check using 2 positive and 2521 generalized place invariants in 598 ms returned sat
[2021-05-17 07:22:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:22:08] [INFO ] [Nat]Absence check using state equation in 4574 ms returned sat
[2021-05-17 07:22:08] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 47 ms.
[2021-05-17 07:22:11] [INFO ] Deduced a trap composed of 10 places in 215 ms of which 7 ms to minimize.
[2021-05-17 07:22:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 409 ms
[2021-05-17 07:22:12] [INFO ] Added : 114 causal constraints over 23 iterations in 3526 ms. Result :sat
[2021-05-17 07:22:12] [INFO ] [Real]Absence check using 2 positive place invariants in 43 ms returned unsat
[2021-05-17 07:22:13] [INFO ] [Real]Absence check using 2 positive place invariants in 32 ms returned sat
[2021-05-17 07:22:13] [INFO ] [Real]Absence check using 2 positive and 2521 generalized place invariants in 779 ms returned sat
[2021-05-17 07:22:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:22:18] [INFO ] [Real]Absence check using state equation in 4543 ms returned sat
[2021-05-17 07:22:18] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 53 ms.
[2021-05-17 07:22:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:22:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 30 ms returned sat
[2021-05-17 07:22:19] [INFO ] [Nat]Absence check using 2 positive and 2521 generalized place invariants in 649 ms returned sat
[2021-05-17 07:22:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:22:24] [INFO ] [Nat]Absence check using state equation in 4099 ms returned sat
[2021-05-17 07:22:24] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 69 ms.
[2021-05-17 07:22:28] [INFO ] Added : 147 causal constraints over 30 iterations in 3879 ms. Result :sat
[2021-05-17 07:22:28] [INFO ] [Real]Absence check using 2 positive place invariants in 31 ms returned sat
[2021-05-17 07:22:29] [INFO ] [Real]Absence check using 2 positive and 2521 generalized place invariants in 610 ms returned sat
[2021-05-17 07:22:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:22:32] [INFO ] [Real]Absence check using state equation in 3425 ms returned sat
[2021-05-17 07:22:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:22:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 39 ms returned sat
[2021-05-17 07:22:33] [INFO ] [Nat]Absence check using 2 positive and 2521 generalized place invariants in 553 ms returned sat
[2021-05-17 07:22:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:22:37] [INFO ] [Nat]Absence check using state equation in 3658 ms returned sat
[2021-05-17 07:22:37] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 48 ms.
[2021-05-17 07:22:40] [INFO ] Added : 114 causal constraints over 23 iterations in 3239 ms. Result :sat
[2021-05-17 07:22:40] [INFO ] [Real]Absence check using 2 positive place invariants in 31 ms returned sat
[2021-05-17 07:22:41] [INFO ] [Real]Absence check using 2 positive and 2521 generalized place invariants in 625 ms returned sat
[2021-05-17 07:22:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:22:42] [INFO ] [Real]Absence check using state equation in 829 ms returned sat
[2021-05-17 07:22:42] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 38 ms.
[2021-05-17 07:22:46] [INFO ] Added : 134 causal constraints over 27 iterations in 3922 ms. Result :sat
[2021-05-17 07:22:46] [INFO ] [Real]Absence check using 2 positive place invariants in 32 ms returned sat
[2021-05-17 07:22:47] [INFO ] [Real]Absence check using 2 positive and 2521 generalized place invariants in 679 ms returned sat
[2021-05-17 07:22:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:22:50] [INFO ] [Real]Absence check using state equation in 2531 ms returned sat
[2021-05-17 07:22:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:22:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 22 ms returned sat
[2021-05-17 07:22:51] [INFO ] [Nat]Absence check using 2 positive and 2521 generalized place invariants in 501 ms returned sat
[2021-05-17 07:22:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:22:53] [INFO ] [Nat]Absence check using state equation in 2519 ms returned sat
[2021-05-17 07:22:53] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 53 ms.
[2021-05-17 07:22:55] [INFO ] Added : 61 causal constraints over 13 iterations in 1782 ms. Result :sat
[2021-05-17 07:22:55] [INFO ] [Real]Absence check using 2 positive place invariants in 49 ms returned sat
[2021-05-17 07:22:56] [INFO ] [Real]Absence check using 2 positive and 2521 generalized place invariants in 694 ms returned sat
[2021-05-17 07:22:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:22:57] [INFO ] [Real]Absence check using state equation in 843 ms returned sat
[2021-05-17 07:22:57] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 32 ms.
[2021-05-17 07:23:01] [INFO ] Added : 135 causal constraints over 27 iterations in 3776 ms. Result :sat
[2021-05-17 07:23:01] [INFO ] [Real]Absence check using 2 positive place invariants in 30 ms returned sat
[2021-05-17 07:23:02] [INFO ] [Real]Absence check using 2 positive and 2521 generalized place invariants in 695 ms returned sat
[2021-05-17 07:23:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:23:05] [INFO ] [Real]Absence check using state equation in 2760 ms returned sat
[2021-05-17 07:23:05] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 40 ms.
[2021-05-17 07:23:07] [INFO ] Added : 59 causal constraints over 12 iterations in 1954 ms. Result :sat
[2021-05-17 07:23:07] [INFO ] [Real]Absence check using 2 positive place invariants in 30 ms returned sat
[2021-05-17 07:23:08] [INFO ] [Real]Absence check using 2 positive and 2521 generalized place invariants in 706 ms returned sat
[2021-05-17 07:23:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:23:19] [INFO ] [Real]Absence check using state equation in 10385 ms returned sat
[2021-05-17 07:23:19] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 37 ms.
[2021-05-17 07:23:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:23:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 28 ms returned sat
[2021-05-17 07:23:20] [INFO ] [Nat]Absence check using 2 positive and 2521 generalized place invariants in 564 ms returned sat
[2021-05-17 07:23:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:23:30] [INFO ] [Nat]Absence check using state equation in 9729 ms returned sat
[2021-05-17 07:23:30] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 49 ms.
[2021-05-17 07:23:34] [INFO ] Added : 147 causal constraints over 30 iterations in 4038 ms. Result :sat
[2021-05-17 07:23:34] [INFO ] [Real]Absence check using 2 positive place invariants in 31 ms returned sat
[2021-05-17 07:23:35] [INFO ] [Real]Absence check using 2 positive and 2521 generalized place invariants in 697 ms returned sat
[2021-05-17 07:23:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:23:39] [INFO ] [Real]Absence check using state equation in 4367 ms returned sat
[2021-05-17 07:23:39] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 49 ms.
[2021-05-17 07:23:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:23:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 26 ms returned sat
[2021-05-17 07:23:41] [INFO ] [Nat]Absence check using 2 positive and 2521 generalized place invariants in 674 ms returned sat
[2021-05-17 07:23:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:23:45] [INFO ] [Nat]Absence check using state equation in 4405 ms returned sat
[2021-05-17 07:23:46] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 49 ms.
[2021-05-17 07:23:50] [INFO ] Added : 141 causal constraints over 29 iterations in 4045 ms. Result :sat
[2021-05-17 07:23:50] [INFO ] [Real]Absence check using 2 positive place invariants in 31 ms returned sat
[2021-05-17 07:23:51] [INFO ] [Real]Absence check using 2 positive and 2521 generalized place invariants in 680 ms returned sat
[2021-05-17 07:23:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:23:55] [INFO ] [Real]Absence check using state equation in 4288 ms returned sat
[2021-05-17 07:23:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:23:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 32 ms returned sat
[2021-05-17 07:23:56] [INFO ] [Nat]Absence check using 2 positive and 2521 generalized place invariants in 613 ms returned sat
[2021-05-17 07:23:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:24:15] [INFO ] [Nat]Absence check using state equation in 18996 ms returned unknown
[2021-05-17 07:24:15] [INFO ] [Real]Absence check using 2 positive place invariants in 23 ms returned sat
[2021-05-17 07:24:16] [INFO ] [Real]Absence check using 2 positive and 2521 generalized place invariants in 526 ms returned sat
[2021-05-17 07:24:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:24:24] [INFO ] [Real]Absence check using state equation in 7879 ms returned sat
[2021-05-17 07:24:24] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 46 ms.
[2021-05-17 07:24:27] [INFO ] Added : 120 causal constraints over 24 iterations in 3432 ms. Result :sat
[2021-05-17 07:24:28] [INFO ] [Real]Absence check using 2 positive place invariants in 29 ms returned sat
[2021-05-17 07:24:29] [INFO ] [Real]Absence check using 2 positive and 2521 generalized place invariants in 685 ms returned sat
[2021-05-17 07:24:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:24:31] [INFO ] [Real]Absence check using state equation in 2134 ms returned sat
[2021-05-17 07:24:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:24:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 30 ms returned sat
[2021-05-17 07:24:32] [INFO ] [Nat]Absence check using 2 positive and 2521 generalized place invariants in 566 ms returned sat
[2021-05-17 07:24:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:24:34] [INFO ] [Nat]Absence check using state equation in 2066 ms returned sat
[2021-05-17 07:24:34] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 37 ms.
[2021-05-17 07:24:36] [INFO ] Added : 59 causal constraints over 12 iterations in 1732 ms. Result :sat
[2021-05-17 07:24:36] [INFO ] [Real]Absence check using 2 positive place invariants in 30 ms returned unsat
[2021-05-17 07:24:37] [INFO ] [Real]Absence check using 2 positive place invariants in 29 ms returned sat
[2021-05-17 07:24:37] [INFO ] [Real]Absence check using 2 positive and 2521 generalized place invariants in 636 ms returned sat
[2021-05-17 07:24:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:24:37] [INFO ] [Real]Absence check using state equation in 97 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
[2021-05-17 07:24:37] [INFO ] Initial state test concluded for 2 properties.
FORMULA QuasiCertifProtocol-PT-28-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||X(p1)))))], workingDir=/home/mcc/execution]
Support contains 58 out of 2968 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2968/2968 places, 446/446 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2965 transition count 446
Applied a total of 3 rules in 436 ms. Remains 2965 /2968 variables (removed 3) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2965 cols
[2021-05-17 07:24:38] [INFO ] Computed 2521 place invariants in 58 ms
[2021-05-17 07:24:42] [INFO ] Implicit Places using invariants in 3740 ms returned []
// Phase 1: matrix 446 rows 2965 cols
[2021-05-17 07:24:42] [INFO ] Computed 2521 place invariants in 65 ms
[2021-05-17 07:24:50] [INFO ] Implicit Places using invariants and state equation in 7982 ms returned []
Implicit Place search using SMT with State Equation took 11724 ms to find 0 implicit places.
// Phase 1: matrix 446 rows 2965 cols
[2021-05-17 07:24:50] [INFO ] Computed 2521 place invariants in 29 ms
[2021-05-17 07:24:51] [INFO ] Dead Transitions using invariants and state equation in 1296 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2965/2968 places, 446/446 transitions.
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-28-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 (ADD s83 s85 s86 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s121 s122)), p1:(LEQ 1 (ADD s2781 s2782 s2783 s2784 s2785 s2786 s2787 s2788 s2789 s2790 s2791 s2792 s2793 s2794 s2795 s2796 s2798 s2799 s2800 s2801 s2802 s2803 s2804 s2821 s2822 s2823 s2824 s2825 s2826))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1309 ms.
Product exploration explored 100000 steps with 50000 reset in 1208 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 2965 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), (F (OR (G p1) (G (NOT p1)))), p0, (NOT p1)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA QuasiCertifProtocol-PT-28-00 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property QuasiCertifProtocol-PT-28-00 finished in 16892 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 2968 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2968/2968 places, 446/446 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 2938 transition count 446
Applied a total of 30 rules in 184 ms. Remains 2938 /2968 variables (removed 30) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2938 cols
[2021-05-17 07:24:55] [INFO ] Computed 2493 place invariants in 127 ms
[2021-05-17 07:24:58] [INFO ] Implicit Places using invariants in 3915 ms returned []
// Phase 1: matrix 446 rows 2938 cols
[2021-05-17 07:24:58] [INFO ] Computed 2493 place invariants in 97 ms
[2021-05-17 07:25:12] [INFO ] Implicit Places using invariants and state equation in 13956 ms returned [1971, 1972, 1974, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 17883 ms to find 29 implicit places.
// Phase 1: matrix 446 rows 2909 cols
[2021-05-17 07:25:12] [INFO ] Computed 2464 place invariants in 109 ms
[2021-05-17 07:25:14] [INFO ] Dead Transitions using invariants and state equation in 1239 ms returned []
Starting structural reductions, iteration 1 : 2909/2968 places, 446/446 transitions.
Applied a total of 0 rules in 277 ms. Remains 2909 /2909 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2909 cols
[2021-05-17 07:25:14] [INFO ] Computed 2464 place invariants in 109 ms
[2021-05-17 07:25:15] [INFO ] Dead Transitions using invariants and state equation in 1281 ms returned []
Finished structural reductions, in 2 iterations. Remains : 2909/2968 places, 446/446 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s218 s56)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1672 ms.
Product exploration explored 100000 steps with 50000 reset in 1650 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 2909 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p0) (G (NOT p0)))), p0]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 1486 ms.
Product exploration explored 100000 steps with 50000 reset in 1365 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 2909 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2909/2909 places, 446/446 transitions.
Applied a total of 0 rules in 511 ms. Remains 2909 /2909 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2021-05-17 07:25:23] [INFO ] Redundant transitions in 64 ms returned []
// Phase 1: matrix 446 rows 2909 cols
[2021-05-17 07:25:23] [INFO ] Computed 2464 place invariants in 56 ms
[2021-05-17 07:25:24] [INFO ] Dead Transitions using invariants and state equation in 1091 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2909/2909 places, 446/446 transitions.
Product exploration explored 100000 steps with 50000 reset in 7545 ms.
Product exploration explored 100000 steps with 50000 reset in 6850 ms.
[2021-05-17 07:25:39] [INFO ] Flatten gal took : 98 ms
[2021-05-17 07:25:39] [INFO ] Flatten gal took : 93 ms
[2021-05-17 07:25:39] [INFO ] Time to serialize gal into /tmp/LTL5115435949459812099.gal : 17 ms
[2021-05-17 07:25:39] [INFO ] Time to serialize properties into /tmp/LTL16987458419633571129.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5115435949459812099.gal, -t, CGAL, -LTL, /tmp/LTL16987458419633571129.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5115435949459812099.gal -t CGAL -LTL /tmp/LTL16987458419633571129.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(AstopAbort<=SstopAbort)"))))
Formula 0 simplified : !XF"(AstopAbort<=SstopAbort)"
Detected timeout of ITS tools.
[2021-05-17 07:25:54] [INFO ] Flatten gal took : 118 ms
[2021-05-17 07:25:54] [INFO ] Applying decomposition
[2021-05-17 07:25:54] [INFO ] Flatten gal took : 86 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3683985268520089272.txt, -o, /tmp/graph3683985268520089272.bin, -w, /tmp/graph3683985268520089272.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3683985268520089272.bin, -l, -1, -v, -w, /tmp/graph3683985268520089272.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 07:25:54] [INFO ] Decomposing Gal with order
[2021-05-17 07:25:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 07:25:55] [INFO ] Removed a total of 293 redundant transitions.
[2021-05-17 07:25:55] [INFO ] Flatten gal took : 445 ms
[2021-05-17 07:25:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 515 labels/synchronizations in 241 ms.
[2021-05-17 07:25:56] [INFO ] Time to serialize gal into /tmp/LTL8725193337060587282.gal : 49 ms
[2021-05-17 07:25:56] [INFO ] Time to serialize properties into /tmp/LTL1855221889688281252.ltl : 5 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8725193337060587282.gal, -t, CGAL, -LTL, /tmp/LTL1855221889688281252.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8725193337060587282.gal -t CGAL -LTL /tmp/LTL1855221889688281252.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(gu62.AstopAbort<=gu62.SstopAbort)"))))
Formula 0 simplified : !XF"(gu62.AstopAbort<=gu62.SstopAbort)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2450453122899595500
[2021-05-17 07:26:11] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2450453122899595500
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin2450453122899595500]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin2450453122899595500] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin2450453122899595500] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property QuasiCertifProtocol-PT-28-01 finished in 77854 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(((p0||X(p1))&&(X(p1)||F(p2))))))], workingDir=/home/mcc/execution]
Support contains 61 out of 2968 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2968/2968 places, 446/446 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 2938 transition count 446
Applied a total of 30 rules in 395 ms. Remains 2938 /2968 variables (removed 30) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2938 cols
[2021-05-17 07:26:13] [INFO ] Computed 2493 place invariants in 71 ms
[2021-05-17 07:26:17] [INFO ] Implicit Places using invariants in 4946 ms returned []
// Phase 1: matrix 446 rows 2938 cols
[2021-05-17 07:26:17] [INFO ] Computed 2493 place invariants in 63 ms
[2021-05-17 07:26:25] [INFO ] Implicit Places using invariants and state equation in 7099 ms returned [1970, 1971, 1973, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 12048 ms to find 29 implicit places.
// Phase 1: matrix 446 rows 2909 cols
[2021-05-17 07:26:25] [INFO ] Computed 2464 place invariants in 46 ms
[2021-05-17 07:26:25] [INFO ] Dead Transitions using invariants and state equation in 928 ms returned []
Starting structural reductions, iteration 1 : 2909/2968 places, 446/446 transitions.
Applied a total of 0 rules in 153 ms. Remains 2909 /2909 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2909 cols
[2021-05-17 07:26:26] [INFO ] Computed 2464 place invariants in 61 ms
[2021-05-17 07:26:27] [INFO ] Dead Transitions using invariants and state equation in 1008 ms returned []
Finished structural reductions, in 2 iterations. Remains : 2909/2968 places, 446/446 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p1)), false]
Running random walk in product with property : QuasiCertifProtocol-PT-28-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s2755 s2756 s2757 s2758 s2759 s2760 s2761 s2762 s2763 s2764 s2765 s2766 s2767 s2768 s2769 s2770 s2771 s2772 s2773 s2774 s2775 s2776 s2777 s2778 s2779 s2780 s2873 s2875 s2876) s56), p2:(GT s218 (ADD s2781 s2782 s2785 s2786 s2787 s2788 s2821 s2822 s2823 s2824 s2825 s2826 s2828 s2829 s2830 s2831 s2832 s2833 s2834 s2835 s2836 s2837 s2838 s2839 s2840 s2841 s2842 s2843 s2844)), p1:(LEQ s2754 s218)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33254 reset in 915 ms.
Product exploration explored 100000 steps with 33447 reset in 1050 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 2909 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2))), (F (OR (G p1) (G (NOT p1)))), p0, (NOT p2), p1]
Stuttering acceptance computed with spot in 169 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p1)), false]
Product exploration explored 100000 steps with 33216 reset in 1129 ms.
Product exploration explored 100000 steps with 33340 reset in 899 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p1)), false]
Support contains 61 out of 2909 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2909/2909 places, 446/446 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2909 transition count 447
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 469 ms. Remains 2909 /2909 variables (removed 0) and now considering 447/446 (removed -1) transitions.
[2021-05-17 07:26:33] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 447 rows 2909 cols
[2021-05-17 07:26:33] [INFO ] Computed 2464 place invariants in 53 ms
[2021-05-17 07:26:34] [INFO ] Dead Transitions using invariants and state equation in 1348 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2909/2909 places, 447/446 transitions.
Product exploration explored 100000 steps with 33259 reset in 4888 ms.
Product exploration explored 100000 steps with 33306 reset in 4489 ms.
[2021-05-17 07:26:43] [INFO ] Flatten gal took : 64 ms
[2021-05-17 07:26:43] [INFO ] Flatten gal took : 58 ms
[2021-05-17 07:26:44] [INFO ] Time to serialize gal into /tmp/LTL15601381181870384972.gal : 10 ms
[2021-05-17 07:26:44] [INFO ] Time to serialize properties into /tmp/LTL155810581224640109.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15601381181870384972.gal, -t, CGAL, -LTL, /tmp/LTL155810581224640109.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15601381181870384972.gal -t CGAL -LTL /tmp/LTL155810581224640109.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G((("(((((((((((((((((((((((((((((n6_18+n6_17)+n6_16)+n6_15)+n6_14)+n6_13)+n6_12)+n6_11)+n6_10)+n6_9)+n6_8)+n6_7)+n6_6)+n6_5)+n6_4)+n6_3)+n6_27)+n6_28)+n6_25)+n6_26)+n6_23)+n6_24)+n6_21)+n6_22)+n6_19)+n6_20)+n6_0)+n6_2)+n6_1)<=SstopAbort)")||(X("(AstopOK<=a3)")))&&((X("(AstopOK<=a3)"))||(F("(a3>((((((((((((((((((((((((((((n2_27+n2_28)+n2_23)+n2_24)+n2_25)+n2_26)+n2_5)+n2_6)+n2_3)+n2_4)+n2_1)+n2_2)+n2_0)+n2_14)+n2_13)+n2_12)+n2_11)+n2_10)+n2_9)+n2_8)+n2_7)+n2_22)+n2_21)+n2_20)+n2_19)+n2_18)+n2_17)+n2_16)+n2_15))")))))))
Formula 0 simplified : !FG(("(((((((((((((((((((((((((((((n6_18+n6_17)+n6_16)+n6_15)+n6_14)+n6_13)+n6_12)+n6_11)+n6_10)+n6_9)+n6_8)+n6_7)+n6_6)+n6_5)+n6_4)+n6_3)+n6_27)+n6_28)+n6_25)+n6_26)+n6_23)+n6_24)+n6_21)+n6_22)+n6_19)+n6_20)+n6_0)+n6_2)+n6_1)<=SstopAbort)" | X"(AstopOK<=a3)") & (X"(AstopOK<=a3)" | F"(a3>((((((((((((((((((((((((((((n2_27+n2_28)+n2_23)+n2_24)+n2_25)+n2_26)+n2_5)+n2_6)+n2_3)+n2_4)+n2_1)+n2_2)+n2_0)+n2_14)+n2_13)+n2_12)+n2_11)+n2_10)+n2_9)+n2_8)+n2_7)+n2_22)+n2_21)+n2_20)+n2_19)+n2_18)+n2_17)+n2_16)+n2_15))"))
Detected timeout of ITS tools.
[2021-05-17 07:26:59] [INFO ] Flatten gal took : 105 ms
[2021-05-17 07:26:59] [INFO ] Applying decomposition
[2021-05-17 07:26:59] [INFO ] Flatten gal took : 82 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15143161857170791119.txt, -o, /tmp/graph15143161857170791119.bin, -w, /tmp/graph15143161857170791119.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15143161857170791119.bin, -l, -1, -v, -w, /tmp/graph15143161857170791119.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 07:26:59] [INFO ] Decomposing Gal with order
[2021-05-17 07:26:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 07:26:59] [INFO ] Removed a total of 189 redundant transitions.
[2021-05-17 07:26:59] [INFO ] Flatten gal took : 241 ms
[2021-05-17 07:26:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 429 labels/synchronizations in 47 ms.
[2021-05-17 07:27:00] [INFO ] Time to serialize gal into /tmp/LTL6003808968438847950.gal : 12 ms
[2021-05-17 07:27:00] [INFO ] Time to serialize properties into /tmp/LTL10302944160976132281.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6003808968438847950.gal, -t, CGAL, -LTL, /tmp/LTL10302944160976132281.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6003808968438847950.gal -t CGAL -LTL /tmp/LTL10302944160976132281.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G((("(((((((((((((((((((((((((((((gu39.n6_18+gu39.n6_17)+gu39.n6_16)+gu39.n6_15)+gu39.n6_14)+gu39.n6_13)+gu39.n6_12)+gu39.n6_11)+gu39.n6_10)+gu39.n6_9)+gu39.n6_8)+gu39.n6_7)+gu39.n6_6)+gu39.n6_5)+gu39.n6_4)+gu39.n6_3)+gu39.n6_27)+gu39.n6_28)+gu39.n6_25)+gu39.n6_26)+gu39.n6_23)+gu39.n6_24)+gu39.n6_21)+gu39.n6_22)+gu39.n6_19)+gu39.n6_20)+gu39.n6_0)+gu39.n6_2)+gu39.n6_1)<=gu39.SstopAbort)")||(X("(gu40.AstopOK<=gu40.a3)")))&&((X("(gu40.AstopOK<=gu40.a3)"))||(F("(gu40.a3>((((((((((((((((((((((((((((gu40.n2_27+gu40.n2_28)+gu40.n2_23)+gu40.n2_24)+gu40.n2_25)+gu40.n2_26)+gu40.n2_5)+gu40.n2_6)+gu40.n2_3)+gu40.n2_4)+gu40.n2_1)+gu40.n2_2)+gu40.n2_0)+gu40.n2_14)+gu40.n2_13)+gu40.n2_12)+gu40.n2_11)+gu40.n2_10)+gu40.n2_9)+gu40.n2_8)+gu40.n2_7)+gu40.n2_22)+gu40.n2_21)+gu40.n2_20)+gu40.n2_19)+gu40.n2_18)+gu40.n2_17)+gu40.n2_16)+gu40.n2_15))")))))))
Formula 0 simplified : !FG(("(((((((((((((((((((((((((((((gu39.n6_18+gu39.n6_17)+gu39.n6_16)+gu39.n6_15)+gu39.n6_14)+gu39.n6_13)+gu39.n6_12)+gu39.n6_11)+gu39.n6_10)+gu39.n6_9)+gu39.n6_8)+gu39.n6_7)+gu39.n6_6)+gu39.n6_5)+gu39.n6_4)+gu39.n6_3)+gu39.n6_27)+gu39.n6_28)+gu39.n6_25)+gu39.n6_26)+gu39.n6_23)+gu39.n6_24)+gu39.n6_21)+gu39.n6_22)+gu39.n6_19)+gu39.n6_20)+gu39.n6_0)+gu39.n6_2)+gu39.n6_1)<=gu39.SstopAbort)" | X"(gu40.AstopOK<=gu40.a3)") & (X"(gu40.AstopOK<=gu40.a3)" | F"(gu40.a3>((((((((((((((((((((((((((((gu40.n2_27+gu40.n2_28)+gu40.n2_23)+gu40.n2_24)+gu40.n2_25)+gu40.n2_26)+gu40.n2_5)+gu40.n2_6)+gu40.n2_3)+gu40.n2_4)+gu40.n2_1)+gu40.n2_2)+gu40.n2_0)+gu40.n2_14)+gu40.n2_13)+gu40.n2_12)+gu40.n2_11)+gu40.n2_10)+gu40.n2_9)+gu40.n2_8)+gu40.n2_7)+gu40.n2_22)+gu40.n2_21)+gu40.n2_20)+gu40.n2_19)+gu40.n2_18)+gu40.n2_17)+gu40.n2_16)+gu40.n2_15))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5903439387669238731
[2021-05-17 07:27:15] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5903439387669238731
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5903439387669238731]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5903439387669238731] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5903439387669238731] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property QuasiCertifProtocol-PT-28-02 finished in 63661 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)&&(G(!p1) U G(p2))))], workingDir=/home/mcc/execution]
Support contains 900 out of 2968 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2968/2968 places, 446/446 transitions.
Graph (complete) has 29418 edges and 2968 vertex of which 2936 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.13 ms
Discarding 32 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2934 transition count 444
Applied a total of 3 rules in 318 ms. Remains 2934 /2968 variables (removed 34) and now considering 444/446 (removed 2) transitions.
// Phase 1: matrix 444 rows 2934 cols
[2021-05-17 07:27:16] [INFO ] Computed 2492 place invariants in 62 ms
[2021-05-17 07:27:19] [INFO ] Implicit Places using invariants in 3147 ms returned []
// Phase 1: matrix 444 rows 2934 cols
[2021-05-17 07:27:19] [INFO ] Computed 2492 place invariants in 31 ms
[2021-05-17 07:27:25] [INFO ] Implicit Places using invariants and state equation in 5617 ms returned [1968, 1969, 1971, 1980, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2588, 2589, 2590, 2591, 2592, 2593, 2594, 2595, 2596, 2597, 2598, 2599, 2600, 2601, 2602, 2603, 2608, 2609, 2610, 2611, 2838, 2839, 2840, 2841, 2842, 2843, 2844, 2845, 2852]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 8782 ms to find 58 implicit places.
[2021-05-17 07:27:25] [INFO ] Redundant transitions in 45 ms returned []
// Phase 1: matrix 444 rows 2876 cols
[2021-05-17 07:27:26] [INFO ] Computed 2436 place invariants in 845 ms
[2021-05-17 07:27:27] [INFO ] Dead Transitions using invariants and state equation in 2184 ms returned []
Starting structural reductions, iteration 1 : 2876/2968 places, 444/446 transitions.
Applied a total of 0 rules in 127 ms. Remains 2876 /2876 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2021-05-17 07:27:27] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 444 rows 2876 cols
[2021-05-17 07:27:28] [INFO ] Computed 2436 place invariants in 847 ms
[2021-05-17 07:27:29] [INFO ] Dead Transitions using invariants and state equation in 2225 ms returned []
Finished structural reductions, in 2 iterations. Remains : 2876/2968 places, 444/446 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p2), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-28-03 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p2), acceptance={0} source=2 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p2:(GT 1 s211), p1:(GT 1 (ADD s29 s30 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58)), p0:(LEQ (ADD s171 s172 s173 s174 s175 s176 s177 s178 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199 s200 s201 s202 s214) (ADD s1884 s1885 s1886 s1887 s1888 s1889 s1890 s1891 s1892 s1893 s1894 s1895 s1896 s1897 s1898 s1899 s1900 s1901 s1902 s1903 s1904 s1905 s1906 s1907 s1908 s1909 s1910 s1911 s1912 s1913 s1914 s1915 s1916 s1917 s1918 s1919 s1920 s1921 s1922 s1923 s1924 s1925 s1926 s1927 s1928 s1929 s1930 s1931 s1932 s1933 s1934 s1935 s1936 s1937 s1938 s1939 s1940 s1941 s1942 s1943 s1944 s1945 s1946 s1947 s1948 s1949 s1950 s1951 s1952 s1953 s1954 s1955 s1956 s1957 s1958 s1959 s1960 s1961 s1962 s1963 s1964 s1965 s1966 s1967 s1968 s1969 s1970 s1971 s1972 s1973 s1974 s1975 s1976 s1983 s1984 s1985 s1986 s1987 s1988 s1989 s1990 s1991 s1992 s1993 s1994 s1995 s1996 s1997 s1998 s1999 s2000 s2001 s2002 s2003 s2004 s2005 s2006 s2007 s2008 s2009 s2010 s2011 s2012 s2013 s2014 s2015 s2016 s2017 s2018 s2019 s2020 s2021 s2022 s2023 s2024 s2025 s2026 s2027 s2028 s2029 s2030 s2031 s2032 s2033 s2034 s2035 s2036 s2037 s2038 s2039 s2040 s2041 s2042 s2043 s2044 s2045 s2046 s2047 s2048 s2049 s2050 s2051 s2052 s2053 s2054 s2055 s2056 s2057 s2058 s2059 s2060 s2061 s2062 s2063 s2064 s2065 s2066 s2067 s2068 s2069 s2070 s2071 s2072 s2073 s2074 s2075 s2076 s2077 s2078 s2079 s2080 s2081 s2082 s2083 s2084 s2085 s2086 s2087 s2088 s2089 s2090 s2091 s2092 s2093 s2094 s2095 s2096 s2097 s2098 s2099 s2100 s2101 s2102 s2103 s2104 s2105 s2106 s2107 s2108 s2109 s2110 s2111 s2112 s2113 s2114 s2115 s2116 s2117 s2118 s2119 s2120 s2121 s2122 s2123 s2124 s2125 s2126 s2127 s2128 s2129 s2130 s2131 s2132 s2133 s2134 s2135 s2136 s2137 s2138 s2139 s2140 s2141 s2142 s2143 s2144 s2145 s2146 s2147 s2148 s2149 s2150 s2151 s2152 s2153 s2154 s2155 s2156 s2157 s2158 s2159 s2160 s2161 s2162 s2163 s2164 s2165 s2166 s2167 s2168 s2169 s2170 s2171 s2172 s2173 s2174 s2175 s2176 s2177 s2178 s2179 s2180 s2181 s2182 s2183 s2184 s2185 s2186 s2187 s2188 s2189 s2190 s2191 s2192 s2193 s2194 s2195 s2196 s2197 s2198 s2199 s2200 s2201 s2202 s2203 s2204 s2205 s2206 s2207 s2208 s2209 s2210 s2211 s2212 s2213 s2214 s2215 s2216 s2217 s2218 s2219 s2220 s2221 s2222 s2223 s2224 s2225 s2226 s2227 s2228 s2229 s2230 s2231 s2232 s2233 s2234 s2235 s2236 s2237 s2238 s2239 s2240 s2241 s2242 s2243 s2244 s2245 s2246 s2247 s2248 s2249 s2250 s2251 s2252 s2253 s2254 s2255 s2256 s2257 s2258 s2259 s2260 s2261 s2262 s2263 s2264 s2265 s2266 s2267 s2268 s2269 s2270 s2271 s2272 s2273 s2274 s2275 s2276 s2277 s2278 s2279 s2280 s2281 s2282 s2283 s2284 s2285 s2286 s2287 s2288 s2289 s2290 s2291 s2292 s2293 s2294 s2295 s2296 s2297 s2298 s2299 s2300 s2301 s2302 s2303 s2304 s2305 s2306 s2307 s2308 s2309 s2310 s2311 s2312 s2313 s2314 s2315 s2316 s2317 s2318 s2319 s2320 s2321 s2322 s2323 s2324 s2325 s2326 s2327 s2328 s2329 s2330 s2331 s2332 s2333 s2334 s2335 s2336 s2337 s2338 s2339 s2340 s2341 s2342 s2343 s2344 s2345 s2346 s2347 s2348 s2349 s2350 s2351 s2352 s2353 s2354 s2355 s2356 s2357 s2358 s2359 s2360 s2361 s2362 s2363 s2364 s2365 s2366 s2367 s2368 s2369 s2370 s2371 s2372 s2373 s2374 s2375 s2376 s2377 s2378 s2379 s2380 s2381 s2382 s2383 s2384 s2385 s2386 s2387 s2388 s2389 s2390 s2391 s2392 s2393 s2394 s2395 s2396 s2397 s2398 s2399 s2400 s2401 s2402 s2403 s2404 s2405 s2406 s2407 s2408 s2409 s2410 s2411 s2412 s2413 s2414 s2415 s2416 s2417 s2418 s2419 s2420 s2421 s2422 s2423 s2424 s2425 s2426 s2427 s2428 s2429 s2430 s2431 s2432 s2433 s2434 s2435 s2436 s2437 s2438 s2439 s2440 s2441 s2442 s2443 s2444 s2445 s2446 s2447 s2448 s2449 s2450 s2451 s2452 s2453 s2454 s2455 s2456 s2457 s2458 s2459 s2460 s2461 s2462 s2463 s2464 s2465 s2466 s2467 s2468 s2469 s2470 s2471 s2472 s2473 s2474 s2475 s2476 s2477 s2478 s2479 s2480 s2481 s2482 s2483 s2484 s2485 s2486 s2487 s2488 s2489 s2490 s2491 s2492 s2493 s2494 s2495 s2496 s2497 s2498 s2499 s2500 s2501 s2502 s2503 s2504 s2505 s2506 s2507 s2508 s2509 s2510 s2511 s2512 s2513 s2514 s2515 s2516 s2517 s2518 s2519 s2520 s2521 s2522 s2523 s2524 s2525 s2526 s2527 s2528 s2529 s2530 s2531 s2532 s2533 s2534 s2535 s2536 s2537 s2538 s2539 s2540 s2541 s2542 s2543 s2544 s2545 s2546 s2547 s2548 s2549 s2550 s2551 s2552 s2553 s2554 s2555 s2556 s2557 s2558 s2559 s2560 s2561 s2562 s2563 s2564 s2565 s2566 s2567 s2568 s2569 s2570 s2571 s2572 s2573 s2574 s2575 s2576 s2577 s2578 s2579 s2580 s2581 s2582 s2583 s2584 s2585 s2586 s2587 s2588 s2589 s2590 s2591 s2592 s2593 s2594 s2595 s2596 s2597 s2598 s2599 s2600 s2601 s2602 s2603 s2604 s2605 s2606 s2607 s2608 s2609 s2610 s2611 s2612 s2613 s2614 s2615 s2616 s2617 s2618 s2619 s2620 s2621 s2622 s2623 s2624 s2625 s2626 s2627 s2628 s2629 s2630 s2631 s2632 s2633 s2634 s2635 s2636 s2637 s2638 s2639 s2640 s2641 s2642 s2643 s2644 s2645 s2646 s2647 s2648 s2649 s2650 s2651 s2652 s2653 s2654 s2655 s2656 s2657 s2658 s2659 s2660 s2661 s2662 s2663 s2664 s2665 s2666 s2667 s2668 s2669 s2670 s2671 s2672 s2673 s2674 s2675 s2676 s2677 s2678 s2679 s2680 s2681 s2682 s2683 s2684 s2685 s2686 s2687 s2688 s2689 s2690 s2691 s2692 s2693 s2694 s2695 s2696 s2697 s2698 s2699 s2700 s2701 s2702 s2703 s2704 s2705 s2706 s2707 s2708 s2709 s2710 s2711 s2712 s2713 s2714 s2715 s2716 s2717 s2718 s2719 s2720 s2721 s2722 s2723 s2724 s2725 s2726 s2727 s2728 s2729 s2730))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2811 reset in 433 ms.
Product exploration explored 100000 steps with 2809 reset in 655 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 2876 transition count 444
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p2)), (F (G p1)), (F (G p0)), p2, p1, (NOT p0)]
Adopting property with smaller alphabet thanks to knowledge :p1
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p2), (AND (NOT p2) p1)]
Support contains 30 out of 2876 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2876/2876 places, 444/444 transitions.
Applied a total of 0 rules in 257 ms. Remains 2876 /2876 variables (removed 0) and now considering 444/444 (removed 0) transitions.
// Phase 1: matrix 444 rows 2876 cols
[2021-05-17 07:27:33] [INFO ] Computed 2436 place invariants in 849 ms
[2021-05-17 07:27:37] [INFO ] Implicit Places using invariants in 4356 ms returned []
// Phase 1: matrix 444 rows 2876 cols
[2021-05-17 07:27:37] [INFO ] Computed 2436 place invariants in 630 ms
[2021-05-17 07:27:53] [INFO ] Implicit Places using invariants and state equation in 16456 ms returned []
Implicit Place search using SMT with State Equation took 20814 ms to find 0 implicit places.
[2021-05-17 07:27:53] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 444 rows 2876 cols
[2021-05-17 07:27:54] [INFO ] Computed 2436 place invariants in 837 ms
[2021-05-17 07:27:55] [INFO ] Dead Transitions using invariants and state equation in 2110 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2876/2876 places, 444/444 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p2), (AND (NOT p2) p1)]
Product exploration explored 100000 steps with 2817 reset in 444 ms.
Product exploration explored 100000 steps with 2809 reset in 492 ms.
Starting structural reductions, iteration 0 : 2876/2876 places, 444/444 transitions.
Applied a total of 0 rules in 244 ms. Remains 2876 /2876 variables (removed 0) and now considering 444/444 (removed 0) transitions.
// Phase 1: matrix 444 rows 2876 cols
[2021-05-17 07:27:57] [INFO ] Computed 2436 place invariants in 848 ms
[2021-05-17 07:28:00] [INFO ] Implicit Places using invariants in 3812 ms returned []
// Phase 1: matrix 444 rows 2876 cols
[2021-05-17 07:28:01] [INFO ] Computed 2436 place invariants in 762 ms
[2021-05-17 07:28:07] [INFO ] Implicit Places using invariants and state equation in 6675 ms returned []
Implicit Place search using SMT with State Equation took 10491 ms to find 0 implicit places.
[2021-05-17 07:28:07] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 444 rows 2876 cols
[2021-05-17 07:28:08] [INFO ] Computed 2436 place invariants in 561 ms
[2021-05-17 07:28:09] [INFO ] Dead Transitions using invariants and state equation in 1620 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2876/2876 places, 444/444 transitions.
Application raised an uncaught exception null
java.lang.UnsupportedOperationException
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:879)
at fr.lip6.move.gal.application.MccTranslator.lambda$3(MccTranslator.java:862)
at fr.lip6.move.gal.structural.expr.NaryOp.forEachChild(NaryOp.java:153)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:862)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:760)
at fr.lip6.move.gal.application.MccTranslator.rebuildSpecification(MccTranslator.java:729)
at fr.lip6.move.gal.application.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:585)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:269)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
BK_STOP 1621236490149
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="QuasiCertifProtocol-PT-28"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-PT-28, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-162089415200108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-28.tgz
mv QuasiCertifProtocol-PT-28 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;