About the Execution of ITS-Tools for DES-PT-50a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5797.960 | 1091307.00 | 3884211.00 | 835.90 | FFFFFFTFTTTFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r064-tall-162038396700133.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 DES-PT-50a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tall-162038396700133
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 120K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 80K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 03:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 03:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 97K 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 DES-PT-50a-00
FORMULA_NAME DES-PT-50a-01
FORMULA_NAME DES-PT-50a-02
FORMULA_NAME DES-PT-50a-03
FORMULA_NAME DES-PT-50a-04
FORMULA_NAME DES-PT-50a-05
FORMULA_NAME DES-PT-50a-06
FORMULA_NAME DES-PT-50a-07
FORMULA_NAME DES-PT-50a-08
FORMULA_NAME DES-PT-50a-09
FORMULA_NAME DES-PT-50a-10
FORMULA_NAME DES-PT-50a-11
FORMULA_NAME DES-PT-50a-12
FORMULA_NAME DES-PT-50a-13
FORMULA_NAME DES-PT-50a-14
FORMULA_NAME DES-PT-50a-15
=== Now, execution of the tool begins
BK_START 1620480459972
Running Version 0
[2021-05-08 13:27:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-08 13:27:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 13:27:41] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2021-05-08 13:27:41] [INFO ] Transformed 314 places.
[2021-05-08 13:27:41] [INFO ] Transformed 271 transitions.
[2021-05-08 13:27:41] [INFO ] Found NUPN structural information;
[2021-05-08 13:27:41] [INFO ] Parsed PT model containing 314 places and 271 transitions in 122 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-08 13:27:41] [INFO ] Initial state test concluded for 4 properties.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-50a-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 314 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 314/314 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 313 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 313 transition count 256
Applied a total of 2 rules in 64 ms. Remains 313 /314 variables (removed 1) and now considering 256/257 (removed 1) transitions.
// Phase 1: matrix 256 rows 313 cols
[2021-05-08 13:27:41] [INFO ] Computed 59 place invariants in 39 ms
[2021-05-08 13:27:42] [INFO ] Implicit Places using invariants in 329 ms returned [211]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 357 ms to find 1 implicit places.
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:27:42] [INFO ] Computed 58 place invariants in 28 ms
[2021-05-08 13:27:42] [INFO ] Dead Transitions using invariants and state equation in 213 ms returned []
Starting structural reductions, iteration 1 : 312/314 places, 256/257 transitions.
Applied a total of 0 rules in 12 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:27:42] [INFO ] Computed 58 place invariants in 10 ms
[2021-05-08 13:27:42] [INFO ] Dead Transitions using invariants and state equation in 173 ms returned []
Finished structural reductions, in 2 iterations. Remains : 312/314 places, 256/257 transitions.
[2021-05-08 13:27:42] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-08 13:27:42] [INFO ] Flatten gal took : 63 ms
FORMULA DES-PT-50a-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 13:27:42] [INFO ] Flatten gal took : 33 ms
[2021-05-08 13:27:42] [INFO ] Input system was already deterministic with 256 transitions.
Incomplete random walk after 100000 steps, including 2229 resets, run finished after 530 ms. (steps per millisecond=188 ) properties (out of 20) seen :5
Running SMT prover for 15 properties.
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:27:43] [INFO ] Computed 58 place invariants in 6 ms
[2021-05-08 13:27:43] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2021-05-08 13:27:43] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 12 ms returned sat
[2021-05-08 13:27:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 13:27:43] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2021-05-08 13:27:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 13:27:43] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2021-05-08 13:27:43] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 52 ms returned sat
[2021-05-08 13:27:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 13:27:44] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2021-05-08 13:27:44] [INFO ] Computed and/alt/rep : 248/744/248 causal constraints (skipped 7 transitions) in 23 ms.
[2021-05-08 13:27:44] [INFO ] Added : 165 causal constraints over 33 iterations in 637 ms. Result :sat
[2021-05-08 13:27:44] [INFO ] [Real]Absence check using 33 positive place invariants in 12 ms returned sat
[2021-05-08 13:27:44] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 18 ms returned sat
[2021-05-08 13:27:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 13:27:44] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2021-05-08 13:27:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 13:27:45] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2021-05-08 13:27:45] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 87 ms returned sat
[2021-05-08 13:27:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 13:27:45] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2021-05-08 13:27:45] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 4 ms to minimize.
[2021-05-08 13:27:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2021-05-08 13:27:45] [INFO ] Computed and/alt/rep : 248/744/248 causal constraints (skipped 7 transitions) in 30 ms.
[2021-05-08 13:27:46] [INFO ] Added : 173 causal constraints over 35 iterations in 735 ms. Result :sat
[2021-05-08 13:27:46] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2021-05-08 13:27:46] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 12 ms returned sat
[2021-05-08 13:27:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 13:27:46] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2021-05-08 13:27:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 13:27:46] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2021-05-08 13:27:46] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 70 ms returned sat
[2021-05-08 13:27:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 13:27:46] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2021-05-08 13:27:46] [INFO ] Computed and/alt/rep : 248/744/248 causal constraints (skipped 7 transitions) in 27 ms.
[2021-05-08 13:27:47] [INFO ] Added : 198 causal constraints over 40 iterations in 713 ms. Result :sat
[2021-05-08 13:27:47] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2021-05-08 13:27:47] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 13:27:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 13:27:47] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2021-05-08 13:27:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 13:27:47] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2021-05-08 13:27:47] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 97 ms returned sat
[2021-05-08 13:27:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 13:27:48] [INFO ] [Nat]Absence check using state equation in 363 ms returned sat
[2021-05-08 13:27:48] [INFO ] Computed and/alt/rep : 248/744/248 causal constraints (skipped 7 transitions) in 19 ms.
[2021-05-08 13:27:48] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2021-05-08 13:27:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2021-05-08 13:27:48] [INFO ] Added : 154 causal constraints over 32 iterations in 744 ms. Result :sat
[2021-05-08 13:27:49] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2021-05-08 13:27:49] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 13:27:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 13:27:49] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2021-05-08 13:27:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 13:27:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2021-05-08 13:27:49] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 99 ms returned sat
[2021-05-08 13:27:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 13:27:49] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2021-05-08 13:27:49] [INFO ] Computed and/alt/rep : 248/744/248 causal constraints (skipped 7 transitions) in 19 ms.
[2021-05-08 13:27:50] [INFO ] Added : 105 causal constraints over 22 iterations in 431 ms. Result :sat
[2021-05-08 13:27:50] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2021-05-08 13:27:50] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 12 ms returned sat
[2021-05-08 13:27:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 13:27:50] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2021-05-08 13:27:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 13:27:50] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2021-05-08 13:27:50] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 92 ms returned sat
[2021-05-08 13:27:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 13:27:50] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2021-05-08 13:27:50] [INFO ] Computed and/alt/rep : 248/744/248 causal constraints (skipped 7 transitions) in 19 ms.
[2021-05-08 13:27:51] [INFO ] Added : 173 causal constraints over 35 iterations in 687 ms. Result :sat
[2021-05-08 13:27:51] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2021-05-08 13:27:51] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 12 ms returned sat
[2021-05-08 13:27:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 13:27:51] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2021-05-08 13:27:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 13:27:51] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2021-05-08 13:27:51] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 54 ms returned sat
[2021-05-08 13:27:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 13:27:51] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2021-05-08 13:27:52] [INFO ] Computed and/alt/rep : 248/744/248 causal constraints (skipped 7 transitions) in 15 ms.
[2021-05-08 13:27:52] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 0 ms to minimize.
[2021-05-08 13:27:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2021-05-08 13:27:52] [INFO ] Added : 92 causal constraints over 19 iterations in 471 ms. Result :sat
[2021-05-08 13:27:52] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2021-05-08 13:27:52] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 13:27:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 13:27:52] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2021-05-08 13:27:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 13:27:52] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2021-05-08 13:27:52] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 90 ms returned sat
[2021-05-08 13:27:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 13:27:52] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2021-05-08 13:27:52] [INFO ] Computed and/alt/rep : 248/744/248 causal constraints (skipped 7 transitions) in 15 ms.
[2021-05-08 13:27:53] [INFO ] Added : 78 causal constraints over 16 iterations in 287 ms. Result :sat
[2021-05-08 13:27:53] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2021-05-08 13:27:53] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 12 ms returned sat
[2021-05-08 13:27:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 13:27:53] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2021-05-08 13:27:53] [INFO ] Computed and/alt/rep : 248/744/248 causal constraints (skipped 7 transitions) in 16 ms.
[2021-05-08 13:27:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 13:27:53] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2021-05-08 13:27:53] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 13:27:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 13:27:53] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2021-05-08 13:27:53] [INFO ] Computed and/alt/rep : 248/744/248 causal constraints (skipped 7 transitions) in 17 ms.
[2021-05-08 13:27:53] [INFO ] Added : 57 causal constraints over 12 iterations in 278 ms. Result :sat
[2021-05-08 13:27:53] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2021-05-08 13:27:53] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 12 ms returned sat
[2021-05-08 13:27:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 13:27:54] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2021-05-08 13:27:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 13:27:54] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2021-05-08 13:27:54] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 38 ms returned sat
[2021-05-08 13:27:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 13:27:54] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2021-05-08 13:27:54] [INFO ] Computed and/alt/rep : 248/744/248 causal constraints (skipped 7 transitions) in 17 ms.
[2021-05-08 13:27:54] [INFO ] Added : 113 causal constraints over 24 iterations in 480 ms. Result :sat
[2021-05-08 13:27:54] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2021-05-08 13:27:54] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 12 ms returned sat
[2021-05-08 13:27:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 13:27:55] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2021-05-08 13:27:55] [INFO ] Computed and/alt/rep : 248/744/248 causal constraints (skipped 7 transitions) in 17 ms.
[2021-05-08 13:27:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 13:27:55] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2021-05-08 13:27:55] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 70 ms returned sat
[2021-05-08 13:27:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 13:27:55] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2021-05-08 13:27:55] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2021-05-08 13:27:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2021-05-08 13:27:55] [INFO ] Computed and/alt/rep : 248/744/248 causal constraints (skipped 7 transitions) in 17 ms.
[2021-05-08 13:27:56] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 0 ms to minimize.
[2021-05-08 13:27:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2021-05-08 13:27:56] [INFO ] Added : 155 causal constraints over 31 iterations in 742 ms. Result :sat
[2021-05-08 13:27:56] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2021-05-08 13:27:56] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 13:27:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 13:27:56] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2021-05-08 13:27:56] [INFO ] Computed and/alt/rep : 248/744/248 causal constraints (skipped 7 transitions) in 18 ms.
[2021-05-08 13:27:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 13:27:56] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2021-05-08 13:27:56] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 13:27:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 13:27:56] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2021-05-08 13:27:56] [INFO ] Computed and/alt/rep : 248/744/248 causal constraints (skipped 7 transitions) in 15 ms.
[2021-05-08 13:27:56] [INFO ] Added : 57 causal constraints over 12 iterations in 228 ms. Result :sat
[2021-05-08 13:27:56] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2021-05-08 13:27:56] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 12 ms returned sat
[2021-05-08 13:27:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 13:27:56] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2021-05-08 13:27:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 13:27:56] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2021-05-08 13:27:57] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 71 ms returned sat
[2021-05-08 13:27:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 13:27:57] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2021-05-08 13:27:57] [INFO ] Computed and/alt/rep : 248/744/248 causal constraints (skipped 7 transitions) in 15 ms.
[2021-05-08 13:27:57] [INFO ] Added : 175 causal constraints over 35 iterations in 636 ms. Result :sat
[2021-05-08 13:27:57] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2021-05-08 13:27:57] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 12 ms returned sat
[2021-05-08 13:27:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 13:27:58] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2021-05-08 13:27:58] [INFO ] Computed and/alt/rep : 248/744/248 causal constraints (skipped 7 transitions) in 17 ms.
[2021-05-08 13:27:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 13:27:58] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2021-05-08 13:27:58] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 13:27:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 13:27:58] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2021-05-08 13:27:58] [INFO ] Computed and/alt/rep : 248/744/248 causal constraints (skipped 7 transitions) in 15 ms.
[2021-05-08 13:27:58] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2021-05-08 13:27:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2021-05-08 13:27:58] [INFO ] Added : 67 causal constraints over 14 iterations in 321 ms. Result :sat
[2021-05-08 13:27:58] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2021-05-08 13:27:58] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 13 ms returned sat
[2021-05-08 13:27:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 13:27:58] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2021-05-08 13:27:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 13:27:58] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2021-05-08 13:27:58] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 13:27:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 13:27:58] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2021-05-08 13:27:58] [INFO ] Computed and/alt/rep : 248/744/248 causal constraints (skipped 7 transitions) in 13 ms.
[2021-05-08 13:27:59] [INFO ] Added : 58 causal constraints over 12 iterations in 278 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G(p0) U X(p1))&&X((X(p2)||G(p3)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 312 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 10 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:27:59] [INFO ] Computed 58 place invariants in 6 ms
[2021-05-08 13:27:59] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:27:59] [INFO ] Computed 58 place invariants in 5 ms
[2021-05-08 13:27:59] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:27:59] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 13:27:59] [INFO ] Dead Transitions using invariants and state equation in 130 ms returned []
Finished structural reductions, in 1 iterations. Remains : 312/312 places, 256/256 transitions.
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), true, (NOT p2), (AND (NOT p3) (NOT p2)), (NOT p0), (NOT p3)]
Running random walk in product with property : DES-PT-50a-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={} source=2 dest: 5}, { cond=p3, acceptance={} source=2 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=(NOT p3), acceptance={} source=8 dest: 4}, { cond=p3, acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (EQ s198 1) (EQ s204 1)), p1:(AND (EQ s160 1) (EQ s204 1)), p3:(OR (EQ s160 0) (EQ s204 0)), p2:(AND (EQ s62 1) (EQ s307 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DES-PT-50a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-00 finished in 1029 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 312/312 places, 256/256 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 22 ms. Remains 311 /312 variables (removed 1) and now considering 255/256 (removed 1) transitions.
// Phase 1: matrix 255 rows 311 cols
[2021-05-08 13:28:00] [INFO ] Computed 58 place invariants in 4 ms
[2021-05-08 13:28:00] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 255 rows 311 cols
[2021-05-08 13:28:00] [INFO ] Computed 58 place invariants in 8 ms
[2021-05-08 13:28:00] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2021-05-08 13:28:00] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 255 rows 311 cols
[2021-05-08 13:28:00] [INFO ] Computed 58 place invariants in 5 ms
[2021-05-08 13:28:00] [INFO ] Dead Transitions using invariants and state equation in 126 ms returned []
Finished structural reductions, in 1 iterations. Remains : 311/312 places, 255/256 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-50a-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (NEQ s35 1) (NEQ s230 1) (NEQ s232 1)), p0:(AND (EQ s25 1) (EQ s230 1) (EQ s232 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2280 reset in 348 ms.
Product exploration explored 100000 steps with 2290 reset in 296 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2294 reset in 213 ms.
Product exploration explored 100000 steps with 2303 reset in 237 ms.
[2021-05-08 13:28:02] [INFO ] Flatten gal took : 24 ms
[2021-05-08 13:28:02] [INFO ] Flatten gal took : 24 ms
[2021-05-08 13:28:02] [INFO ] Time to serialize gal into /tmp/LTL10918517137409893521.gal : 10 ms
[2021-05-08 13:28:02] [INFO ] Time to serialize properties into /tmp/LTL1140898176417764509.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/LTL10918517137409893521.gal, -t, CGAL, -LTL, /tmp/LTL1140898176417764509.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/LTL10918517137409893521.gal -t CGAL -LTL /tmp/LTL1140898176417764509.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(((p36!=1)||(p232!=1))||(p234!=1))"))||("(((p26==1)&&(p232==1))&&(p234==1))")))))
Formula 0 simplified : !GF("(((p26==1)&&(p232==1))&&(p234==1))" | G"(((p36!=1)||(p232!=1))||(p234!=1))")
Detected timeout of ITS tools.
[2021-05-08 13:28:17] [INFO ] Flatten gal took : 23 ms
[2021-05-08 13:28:17] [INFO ] Applying decomposition
[2021-05-08 13:28:17] [INFO ] Flatten gal took : 21 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/graph15465051891865497995.txt, -o, /tmp/graph15465051891865497995.bin, -w, /tmp/graph15465051891865497995.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/graph15465051891865497995.bin, -l, -1, -v, -w, /tmp/graph15465051891865497995.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 13:28:17] [INFO ] Decomposing Gal with order
[2021-05-08 13:28:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 13:28:17] [INFO ] Removed a total of 54 redundant transitions.
[2021-05-08 13:28:17] [INFO ] Flatten gal took : 54 ms
[2021-05-08 13:28:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 4 ms.
[2021-05-08 13:28:17] [INFO ] Time to serialize gal into /tmp/LTL17583101735577295412.gal : 4 ms
[2021-05-08 13:28:17] [INFO ] Time to serialize properties into /tmp/LTL14424556784628297244.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/LTL17583101735577295412.gal, -t, CGAL, -LTL, /tmp/LTL14424556784628297244.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17583101735577295412.gal -t CGAL -LTL /tmp/LTL14424556784628297244.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(((i3.u13.p36!=1)||(i3.u13.p232!=1))||(i3.u14.p234!=1))"))||("(((i3.u14.p26==1)&&(i3.u13.p232==1))&&(i3.u14.p234==1))")))))
Formula 0 simplified : !GF("(((i3.u14.p26==1)&&(i3.u13.p232==1))&&(i3.u14.p234==1))" | G"(((i3.u13.p36!=1)||(i3.u13.p232!=1))||(i3.u14.p234!=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3826408827116848176
[2021-05-08 13:28:32] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3826408827116848176
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/ltsmin3826408827116848176]
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/ltsmin3826408827116848176] 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/ltsmin3826408827116848176] 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 DES-PT-50a-01 finished in 33537 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:28:33] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 13:28:34] [INFO ] Implicit Places using invariants in 156 ms returned []
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:28:34] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 13:28:34] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:28:34] [INFO ] Computed 58 place invariants in 4 ms
[2021-05-08 13:28:34] [INFO ] Dead Transitions using invariants and state equation in 129 ms returned []
Finished structural reductions, in 1 iterations. Remains : 312/312 places, 256/256 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : DES-PT-50a-02 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (NEQ s59 1) (NEQ s307 1)), p1:(AND (NEQ s145 0) (NEQ s228 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 0 ms.
FORMULA DES-PT-50a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-02 finished in 706 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 312/312 places, 256/256 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 13 ms. Remains 311 /312 variables (removed 1) and now considering 255/256 (removed 1) transitions.
// Phase 1: matrix 255 rows 311 cols
[2021-05-08 13:28:34] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 13:28:34] [INFO ] Implicit Places using invariants in 151 ms returned []
// Phase 1: matrix 255 rows 311 cols
[2021-05-08 13:28:34] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-08 13:28:35] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2021-05-08 13:28:35] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 255 rows 311 cols
[2021-05-08 13:28:35] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 13:28:35] [INFO ] Dead Transitions using invariants and state equation in 130 ms returned []
Finished structural reductions, in 1 iterations. Remains : 311/312 places, 255/256 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50a-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s220 1) (EQ s222 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 86 steps with 3 reset in 1 ms.
FORMULA DES-PT-50a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-03 finished in 718 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 12 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:28:35] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 13:28:35] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:28:35] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 13:28:35] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2021-05-08 13:28:35] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:28:35] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 13:28:35] [INFO ] Dead Transitions using invariants and state equation in 131 ms returned []
Finished structural reductions, in 1 iterations. Remains : 312/312 places, 256/256 transitions.
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-50a-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s90 0) (EQ s307 0)), p1:(AND (EQ s141 1) (EQ s228 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 66 steps with 0 reset in 0 ms.
FORMULA DES-PT-50a-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-05 finished in 706 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 12 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:28:35] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 13:28:36] [INFO ] Implicit Places using invariants in 158 ms returned []
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:28:36] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 13:28:36] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
[2021-05-08 13:28:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:28:36] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 13:28:36] [INFO ] Dead Transitions using invariants and state equation in 130 ms returned []
Finished structural reductions, in 1 iterations. Remains : 312/312 places, 256/256 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-50a-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s240 1) (NEQ s257 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2219 reset in 283 ms.
Product exploration explored 100000 steps with 2233 reset in 395 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2227 reset in 256 ms.
Stack based approach found an accepted trace after 32920 steps with 715 reset with depth 131 and stack size 131 in 85 ms.
FORMULA DES-PT-50a-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-07 finished in 1801 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 312 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:28:37] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 13:28:37] [INFO ] Implicit Places using invariants in 163 ms returned []
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:28:37] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 13:28:38] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:28:38] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-08 13:28:38] [INFO ] Dead Transitions using invariants and state equation in 163 ms returned []
Finished structural reductions, in 1 iterations. Remains : 312/312 places, 256/256 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50a-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s184 1) (NEQ s204 1))], 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 504 ms.
Product exploration explored 100000 steps with 50000 reset in 514 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 497 ms.
Product exploration explored 100000 steps with 50000 reset in 509 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 312 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 31 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2021-05-08 13:28:40] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:28:40] [INFO ] Computed 58 place invariants in 19 ms
[2021-05-08 13:28:40] [INFO ] Dead Transitions using invariants and state equation in 141 ms returned []
Finished structural reductions, in 1 iterations. Remains : 312/312 places, 256/256 transitions.
Product exploration explored 100000 steps with 50000 reset in 1281 ms.
Product exploration explored 100000 steps with 50000 reset in 1243 ms.
[2021-05-08 13:28:43] [INFO ] Flatten gal took : 20 ms
[2021-05-08 13:28:43] [INFO ] Flatten gal took : 35 ms
[2021-05-08 13:28:43] [INFO ] Time to serialize gal into /tmp/LTL10733656438793869107.gal : 2 ms
[2021-05-08 13:28:43] [INFO ] Time to serialize properties into /tmp/LTL1408707708860574062.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/LTL10733656438793869107.gal, -t, CGAL, -LTL, /tmp/LTL1408707708860574062.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/LTL10733656438793869107.gal -t CGAL -LTL /tmp/LTL1408707708860574062.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((p184!=1)||(p204!=1))"))))
Formula 0 simplified : !XF"((p184!=1)||(p204!=1))"
Detected timeout of ITS tools.
[2021-05-08 13:28:58] [INFO ] Flatten gal took : 19 ms
[2021-05-08 13:28:58] [INFO ] Applying decomposition
[2021-05-08 13:28:58] [INFO ] Flatten gal took : 18 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/graph10816497755119327879.txt, -o, /tmp/graph10816497755119327879.bin, -w, /tmp/graph10816497755119327879.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/graph10816497755119327879.bin, -l, -1, -v, -w, /tmp/graph10816497755119327879.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 13:28:58] [INFO ] Decomposing Gal with order
[2021-05-08 13:28:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 13:28:58] [INFO ] Removed a total of 55 redundant transitions.
[2021-05-08 13:28:58] [INFO ] Flatten gal took : 31 ms
[2021-05-08 13:28:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 3 ms.
[2021-05-08 13:28:58] [INFO ] Time to serialize gal into /tmp/LTL11008496997016570832.gal : 3 ms
[2021-05-08 13:28:58] [INFO ] Time to serialize properties into /tmp/LTL14789839152826307787.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/LTL11008496997016570832.gal, -t, CGAL, -LTL, /tmp/LTL14789839152826307787.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11008496997016570832.gal -t CGAL -LTL /tmp/LTL14789839152826307787.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((u2.p184!=1)||(u2.p204!=1))"))))
Formula 0 simplified : !XF"((u2.p184!=1)||(u2.p204!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6658825588742557671
[2021-05-08 13:29:13] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6658825588742557671
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/ltsmin6658825588742557671]
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/ltsmin6658825588742557671] 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/ltsmin6658825588742557671] 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 DES-PT-50a-09 finished in 36937 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||F(G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 19 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:29:14] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 13:29:14] [INFO ] Implicit Places using invariants in 158 ms returned []
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:29:14] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 13:29:15] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2021-05-08 13:29:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:29:15] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 13:29:15] [INFO ] Dead Transitions using invariants and state equation in 130 ms returned []
Finished structural reductions, in 1 iterations. Remains : 312/312 places, 256/256 transitions.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DES-PT-50a-10 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s160 1) (EQ s204 1)), p1:(OR (EQ s160 0) (EQ s204 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2216 reset in 230 ms.
Product exploration explored 100000 steps with 2207 reset in 257 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 2196 reset in 228 ms.
Product exploration explored 100000 steps with 2247 reset in 250 ms.
[2021-05-08 13:29:16] [INFO ] Flatten gal took : 14 ms
[2021-05-08 13:29:16] [INFO ] Flatten gal took : 13 ms
[2021-05-08 13:29:16] [INFO ] Time to serialize gal into /tmp/LTL14209204713237736545.gal : 2 ms
[2021-05-08 13:29:16] [INFO ] Time to serialize properties into /tmp/LTL13616204111624754255.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/LTL14209204713237736545.gal, -t, CGAL, -LTL, /tmp/LTL13616204111624754255.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/LTL14209204713237736545.gal -t CGAL -LTL /tmp/LTL13616204111624754255.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("((p160==1)&&(p204==1))"))||(F(G("((p160==0)||(p204==0))")))))
Formula 0 simplified : !(G"((p160==1)&&(p204==1))" | FG"((p160==0)||(p204==0))")
Detected timeout of ITS tools.
[2021-05-08 13:29:31] [INFO ] Flatten gal took : 19 ms
[2021-05-08 13:29:31] [INFO ] Applying decomposition
[2021-05-08 13:29:31] [INFO ] Flatten gal took : 13 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/graph10747858009736506426.txt, -o, /tmp/graph10747858009736506426.bin, -w, /tmp/graph10747858009736506426.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/graph10747858009736506426.bin, -l, -1, -v, -w, /tmp/graph10747858009736506426.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 13:29:31] [INFO ] Decomposing Gal with order
[2021-05-08 13:29:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 13:29:31] [INFO ] Removed a total of 16 redundant transitions.
[2021-05-08 13:29:31] [INFO ] Flatten gal took : 19 ms
[2021-05-08 13:29:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-08 13:29:31] [INFO ] Time to serialize gal into /tmp/LTL5467572816687408795.gal : 2 ms
[2021-05-08 13:29:31] [INFO ] Time to serialize properties into /tmp/LTL13157491721479954011.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/LTL5467572816687408795.gal, -t, CGAL, -LTL, /tmp/LTL13157491721479954011.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5467572816687408795.gal -t CGAL -LTL /tmp/LTL13157491721479954011.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G("((u2.p160==1)&&(u2.p204==1))"))||(F(G("((u2.p160==0)||(u2.p204==0))")))))
Formula 0 simplified : !(G"((u2.p160==1)&&(u2.p204==1))" | FG"((u2.p160==0)||(u2.p204==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7694675244342620958
[2021-05-08 13:29:46] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7694675244342620958
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/ltsmin7694675244342620958]
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/ltsmin7694675244342620958] 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/ltsmin7694675244342620958] 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 DES-PT-50a-10 finished in 32998 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 312 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 312/312 places, 256/256 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 12 ms. Remains 311 /312 variables (removed 1) and now considering 255/256 (removed 1) transitions.
// Phase 1: matrix 255 rows 311 cols
[2021-05-08 13:29:47] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 13:29:47] [INFO ] Implicit Places using invariants in 187 ms returned []
// Phase 1: matrix 255 rows 311 cols
[2021-05-08 13:29:47] [INFO ] Computed 58 place invariants in 5 ms
[2021-05-08 13:29:48] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2021-05-08 13:29:48] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 255 rows 311 cols
[2021-05-08 13:29:48] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 13:29:48] [INFO ] Dead Transitions using invariants and state equation in 127 ms returned []
Finished structural reductions, in 1 iterations. Remains : 311/312 places, 255/256 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-50a-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s22 1) (EQ s230 1) (EQ s232 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 1 ms.
FORMULA DES-PT-50a-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-11 finished in 715 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 5 out of 312 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 312/312 places, 256/256 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 9 ms. Remains 311 /312 variables (removed 1) and now considering 255/256 (removed 1) transitions.
// Phase 1: matrix 255 rows 311 cols
[2021-05-08 13:29:48] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 13:29:48] [INFO ] Implicit Places using invariants in 161 ms returned []
// Phase 1: matrix 255 rows 311 cols
[2021-05-08 13:29:48] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 13:29:48] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2021-05-08 13:29:48] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 255 rows 311 cols
[2021-05-08 13:29:48] [INFO ] Computed 58 place invariants in 4 ms
[2021-05-08 13:29:49] [INFO ] Dead Transitions using invariants and state equation in 128 ms returned []
Finished structural reductions, in 1 iterations. Remains : 311/312 places, 255/256 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-50a-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s296 1) (EQ s305 1)) (AND (EQ s27 1) (EQ s230 1) (EQ s232 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 0 ms.
FORMULA DES-PT-50a-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-12 finished in 710 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(X(p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 312 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 3 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:29:49] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 13:29:49] [INFO ] Implicit Places using invariants in 154 ms returned []
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:29:49] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 13:29:49] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:29:49] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-08 13:29:49] [INFO ] Dead Transitions using invariants and state equation in 128 ms returned []
Finished structural reductions, in 1 iterations. Remains : 312/312 places, 256/256 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DES-PT-50a-13 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 1}, { cond=(NOT p0), acceptance={} source=5 dest: 3}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=5, aps=[p1:(OR (NEQ s140 1) (NEQ s228 1)), p0:(AND (EQ s211 1) (EQ s221 1) (EQ s223 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 373 ms.
Product exploration explored 100000 steps with 33333 reset in 396 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 372 ms.
Product exploration explored 100000 steps with 33333 reset in 388 ms.
Applying partial POR strategy [true, false, true, false, true, false, true]
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 5 out of 312 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2021-05-08 13:29:51] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:29:51] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 13:29:51] [INFO ] Dead Transitions using invariants and state equation in 132 ms returned []
Finished structural reductions, in 1 iterations. Remains : 312/312 places, 256/256 transitions.
Product exploration explored 100000 steps with 33333 reset in 1065 ms.
Product exploration explored 100000 steps with 33333 reset in 1094 ms.
[2021-05-08 13:29:54] [INFO ] Flatten gal took : 13 ms
[2021-05-08 13:29:54] [INFO ] Flatten gal took : 13 ms
[2021-05-08 13:29:54] [INFO ] Time to serialize gal into /tmp/LTL2515592455715061163.gal : 2 ms
[2021-05-08 13:29:54] [INFO ] Time to serialize properties into /tmp/LTL12996241872610859676.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/LTL2515592455715061163.gal, -t, CGAL, -LTL, /tmp/LTL12996241872610859676.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/LTL2515592455715061163.gal -t CGAL -LTL /tmp/LTL12996241872610859676.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(((p212==1)&&(p222==1))&&(p224==1))"))||(X(X("((p140!=1)||(p229!=1))")))))
Formula 0 simplified : !(G"(((p212==1)&&(p222==1))&&(p224==1))" | XX"((p140!=1)||(p229!=1))")
Detected timeout of ITS tools.
[2021-05-08 13:30:09] [INFO ] Flatten gal took : 28 ms
[2021-05-08 13:30:09] [INFO ] Applying decomposition
[2021-05-08 13:30:09] [INFO ] Flatten gal took : 12 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/graph16971245679242349729.txt, -o, /tmp/graph16971245679242349729.bin, -w, /tmp/graph16971245679242349729.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/graph16971245679242349729.bin, -l, -1, -v, -w, /tmp/graph16971245679242349729.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 13:30:09] [INFO ] Decomposing Gal with order
[2021-05-08 13:30:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 13:30:09] [INFO ] Removed a total of 16 redundant transitions.
[2021-05-08 13:30:09] [INFO ] Flatten gal took : 20 ms
[2021-05-08 13:30:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-08 13:30:09] [INFO ] Time to serialize gal into /tmp/LTL4038321611420957878.gal : 3 ms
[2021-05-08 13:30:09] [INFO ] Time to serialize properties into /tmp/LTL6919192035201665477.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/LTL4038321611420957878.gal, -t, CGAL, -LTL, /tmp/LTL6919192035201665477.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4038321611420957878.gal -t CGAL -LTL /tmp/LTL6919192035201665477.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G("(((i1.i1.u5.p212==1)&&(i1.i1.u7.p222==1))&&(i1.i1.u10.p224==1))"))||(X(X("((u13.p140!=1)||(u13.p229!=1))")))))
Formula 0 simplified : !(G"(((i1.i1.u5.p212==1)&&(i1.i1.u7.p222==1))&&(i1.i1.u10.p224==1))" | XX"((u13.p140!=1)||(u13.p229!=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2532417364311854748
[2021-05-08 13:30:24] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2532417364311854748
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/ltsmin2532417364311854748]
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/ltsmin2532417364311854748] 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/ltsmin2532417364311854748] 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 DES-PT-50a-13 finished in 36251 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:30:25] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 13:30:25] [INFO ] Implicit Places using invariants in 180 ms returned []
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:30:25] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 13:30:25] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2021-05-08 13:30:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:30:25] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 13:30:26] [INFO ] Dead Transitions using invariants and state equation in 123 ms returned []
Finished structural reductions, in 1 iterations. Remains : 312/312 places, 256/256 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DES-PT-50a-14 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s58 0) (EQ s307 0)), p1:(AND (EQ s130 1) (EQ s228 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 0 ms.
FORMULA DES-PT-50a-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-14 finished in 739 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 8 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:30:26] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 13:30:26] [INFO ] Implicit Places using invariants in 154 ms returned []
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:30:26] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 13:30:26] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2021-05-08 13:30:26] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 256 rows 312 cols
[2021-05-08 13:30:26] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 13:30:26] [INFO ] Dead Transitions using invariants and state equation in 132 ms returned []
Finished structural reductions, in 1 iterations. Remains : 312/312 places, 256/256 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50a-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s143 1) (EQ s228 1)) (AND (EQ s151 1) (EQ s204 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 81 steps with 0 reset in 1 ms.
FORMULA DES-PT-50a-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-15 finished in 662 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5824805414379218004
[2021-05-08 13:30:26] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2021-05-08 13:30:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 13:30:26] [INFO ] Applying decomposition
[2021-05-08 13:30:26] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2021-05-08 13:30:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 13:30:26] [INFO ] Flatten gal took : 12 ms
[2021-05-08 13:30:26] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2021-05-08 13:30:26] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 13:30:26] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5824805414379218004
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/ltsmin5824805414379218004]
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/graph14748861921500479658.txt, -o, /tmp/graph14748861921500479658.bin, -w, /tmp/graph14748861921500479658.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/graph14748861921500479658.bin, -l, -1, -v, -w, /tmp/graph14748861921500479658.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 13:30:26] [INFO ] Decomposing Gal with order
[2021-05-08 13:30:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 13:30:26] [INFO ] Removed a total of 51 redundant transitions.
[2021-05-08 13:30:26] [INFO ] Flatten gal took : 35 ms
[2021-05-08 13:30:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 3 ms.
[2021-05-08 13:30:26] [INFO ] Time to serialize gal into /tmp/LTLFireability8113199042206661710.gal : 2 ms
[2021-05-08 13:30:26] [INFO ] Time to serialize properties into /tmp/LTLFireability17295715470831400807.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/LTLFireability8113199042206661710.gal, -t, CGAL, -LTL, /tmp/LTLFireability17295715470831400807.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability8113199042206661710.gal -t CGAL -LTL /tmp/LTLFireability17295715470831400807.ltl -c -stutter-deadlock
Read 4 LTL properties
Checking formula 0 : !((G(F(("(((i3.u14.p26==1)&&(i3.u13.p232==1))&&(i3.u14.p234==1))")||(G(!("(((i3.u13.p36==1)&&(i3.u13.p232==1))&&(i3.u14.p234==1))")))))))
Formula 0 simplified : !GF("(((i3.u14.p26==1)&&(i3.u13.p232==1))&&(i3.u14.p234==1))" | G!"(((i3.u13.p36==1)&&(i3.u13.p232==1))&&(i3.u14.p234==1))")
Compilation finished in 1412 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5824805414379218004]
Link finished in 54 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>(((LTLAPp0==true)||[]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5824805414379218004]
Reverse transition relation is NOT exact ! Due to transitions t1, t226, t227, t260, u2.t8, u2.t110, u2.t114, u2.t115, u2.t116, u2.t117, u2.t118, u2.t119, u2.t120, u2.t121, u2.t122, u2.t123, u2.t124, u2.t125, u2.t126, u2.t127, u2.t128, u2.t129, u2.t130, u2.t131, u2.t132, u2.t133, u2.t134, u2.t135, u2.t136, u2.t137, u2.t138, u2.t139, u2.t140, u2.t141, u2.t142, u2.t143, u2.t144, u2.t145, u2.t146, u2.t147, u2.t148, u2.t149, u2.t150, u2.t151, u2.t152, u2.t153, u2.t154, u2.t155, u2.t156, u2.t157, u2.t158, u2.t159, u12.t209, u48.t5, u48.t60, i0.i0.u0.t10, i0.i0.u6.t269, i0.i1.t0, i0.i1.t258, i0.i1.t268, i0.i1.u1.t9, i3.t31, i11.t237, i11.t4, i11.t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/153/65/218
Computing Next relation with stutter on 5.75047e+06 deadlock states
WARNING : LTSmin timed out (>276 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>(((LTLAPp0==true)||[]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5824805414379218004]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin5824805414379218004]
LTSmin run took 463 ms.
FORMULA DES-PT-50a-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, ([]((LTLAPp3==true))||<>([]((LTLAPp4==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin5824805414379218004]
61 unique states visited
61 strongly connected components in search stack
62 transitions explored
61 items max in DFS search stack
12620 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,126.237,1957032,1,0,4.44341e+06,175739,2538,7.01922e+06,4683,1.25252e+06,3608735
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DES-PT-50a-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(F(!("((u2.p184==1)&&(u2.p204==1))")))))
Formula 1 simplified : !XF!"((u2.p184==1)&&(u2.p204==1))"
Computing Next relation with stutter on 5.75047e+06 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,126.239,1957296,1,0,4.44341e+06,175739,2565,7.01922e+06,4690,1.25252e+06,3608766
no accepting run found
Formula 1 is TRUE no accepting run found.
Checking formula 2 : !(((G("((u2.p160==1)&&(u2.p204==1))"))||(F(G("((u2.p160==0)||(u2.p204==0))")))))
Formula 2 simplified : !(G"((u2.p160==1)&&(u2.p204==1))" | FG"((u2.p160==0)||(u2.p204==0))")
Computing Next relation with stutter on 5.75047e+06 deadlock states
WARNING : LTSmin timed out (>276 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, ([]((LTLAPp3==true))||<>([]((LTLAPp4==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin5824805414379218004]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ([]((LTLAPp5==true))||X(X((LTLAPp6==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin5824805414379218004]
LTSmin run took 432 ms.
FORMULA DES-PT-50a-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 2208 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, ([]((LTLAPp3==true))||<>([]((LTLAPp4==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin5824805414379218004]
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
26942 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,395.664,3820504,1,0,9.63545e+06,185714,774,9.85868e+06,1462,1.33991e+06,2616557
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA DES-PT-50a-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((G("(((i0.i1.u5.p212==1)&&(i0.i1.u7.p222==1))&&(i0.i1.u9.p224==1))"))||(X(X(!("((u12.p140==1)&&(u12.p229==1))"))))))
Formula 3 simplified : !(G"(((i0.i1.u5.p212==1)&&(i0.i1.u7.p222==1))&&(i0.i1.u9.p224==1))" | XX!"((u12.p140==1)&&(u12.p229==1))")
Computing Next relation with stutter on 5.75047e+06 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
370 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,399.362,3820632,1,0,9.63545e+06,185714,948,9.85868e+06,1886,1.33991e+06,2722217
no accepting run found
Formula 3 is TRUE no accepting run found.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
BK_STOP 1620481551279
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -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 LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/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="DES-PT-50a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DES-PT-50a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r064-tall-162038396700133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50a.tgz
mv DES-PT-50a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;