About the Execution of ITS-Tools for GPUForwardProgress-PT-32b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1005.144 | 79824.00 | 116991.00 | 395.80 | FFFTTFTTTTFTTFFF | 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.r292-tall-162124156100220.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 GPUForwardProgress-PT-32b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156100220
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 18K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 170K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 123K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 12 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.3K May 11 18:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 11 18:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 11 15:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K May 11 15:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 4 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 109K May 12 08:13 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 GPUForwardProgress-PT-32b-00
FORMULA_NAME GPUForwardProgress-PT-32b-01
FORMULA_NAME GPUForwardProgress-PT-32b-02
FORMULA_NAME GPUForwardProgress-PT-32b-03
FORMULA_NAME GPUForwardProgress-PT-32b-04
FORMULA_NAME GPUForwardProgress-PT-32b-05
FORMULA_NAME GPUForwardProgress-PT-32b-06
FORMULA_NAME GPUForwardProgress-PT-32b-07
FORMULA_NAME GPUForwardProgress-PT-32b-08
FORMULA_NAME GPUForwardProgress-PT-32b-09
FORMULA_NAME GPUForwardProgress-PT-32b-10
FORMULA_NAME GPUForwardProgress-PT-32b-11
FORMULA_NAME GPUForwardProgress-PT-32b-12
FORMULA_NAME GPUForwardProgress-PT-32b-13
FORMULA_NAME GPUForwardProgress-PT-32b-14
FORMULA_NAME GPUForwardProgress-PT-32b-15
=== Now, execution of the tool begins
BK_START 1621276769722
Running Version 0
[2021-05-17 18:39:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 18:39:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 18:39:31] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2021-05-17 18:39:31] [INFO ] Transformed 644 places.
[2021-05-17 18:39:31] [INFO ] Transformed 677 transitions.
[2021-05-17 18:39:31] [INFO ] Found NUPN structural information;
[2021-05-17 18:39:31] [INFO ] Parsed PT model containing 644 places and 677 transitions in 112 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 18:39:31] [INFO ] Initial state test concluded for 4 properties.
FORMULA GPUForwardProgress-PT-32b-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 644 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 644/644 places, 677/677 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 643 transition count 677
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 61 place count 583 transition count 617
Iterating global reduction 1 with 60 rules applied. Total rules applied 121 place count 583 transition count 617
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 142 place count 562 transition count 596
Iterating global reduction 1 with 21 rules applied. Total rules applied 163 place count 562 transition count 596
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 182 place count 562 transition count 577
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 561 transition count 576
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 561 transition count 576
Applied a total of 184 rules in 162 ms. Remains 561 /644 variables (removed 83) and now considering 576/677 (removed 101) transitions.
// Phase 1: matrix 576 rows 561 cols
[2021-05-17 18:39:31] [INFO ] Computed 33 place invariants in 23 ms
[2021-05-17 18:39:32] [INFO ] Implicit Places using invariants in 266 ms returned []
// Phase 1: matrix 576 rows 561 cols
[2021-05-17 18:39:32] [INFO ] Computed 33 place invariants in 4 ms
[2021-05-17 18:39:32] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
// Phase 1: matrix 576 rows 561 cols
[2021-05-17 18:39:32] [INFO ] Computed 33 place invariants in 3 ms
[2021-05-17 18:39:32] [INFO ] Dead Transitions using invariants and state equation in 270 ms returned []
Finished structural reductions, in 1 iterations. Remains : 561/644 places, 576/677 transitions.
[2021-05-17 18:39:32] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-17 18:39:32] [INFO ] Flatten gal took : 70 ms
FORMULA GPUForwardProgress-PT-32b-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 18:39:32] [INFO ] Flatten gal took : 31 ms
[2021-05-17 18:39:33] [INFO ] Input system was already deterministic with 576 transitions.
Incomplete random walk after 100000 steps, including 367 resets, run finished after 426 ms. (steps per millisecond=234 ) properties (out of 19) seen :12
Running SMT prover for 7 properties.
// Phase 1: matrix 576 rows 561 cols
[2021-05-17 18:39:33] [INFO ] Computed 33 place invariants in 3 ms
[2021-05-17 18:39:33] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 13 ms returned sat
[2021-05-17 18:39:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:39:33] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2021-05-17 18:39:33] [INFO ] Computed and/alt/rep : 570/819/570 causal constraints (skipped 5 transitions) in 36 ms.
[2021-05-17 18:39:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 18:39:34] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 14 ms returned sat
[2021-05-17 18:39:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 18:39:34] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2021-05-17 18:39:34] [INFO ] Computed and/alt/rep : 570/819/570 causal constraints (skipped 5 transitions) in 43 ms.
[2021-05-17 18:39:35] [INFO ] Added : 191 causal constraints over 39 iterations in 1129 ms. Result :sat
[2021-05-17 18:39:35] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 18 ms returned sat
[2021-05-17 18:39:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:39:35] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2021-05-17 18:39:35] [INFO ] Computed and/alt/rep : 570/819/570 causal constraints (skipped 5 transitions) in 35 ms.
[2021-05-17 18:39:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 18:39:35] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 14 ms returned sat
[2021-05-17 18:39:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 18:39:36] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2021-05-17 18:39:36] [INFO ] Computed and/alt/rep : 570/819/570 causal constraints (skipped 5 transitions) in 37 ms.
[2021-05-17 18:39:37] [INFO ] Added : 168 causal constraints over 34 iterations in 912 ms. Result :sat
[2021-05-17 18:39:37] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 13 ms returned sat
[2021-05-17 18:39:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:39:37] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2021-05-17 18:39:37] [INFO ] Computed and/alt/rep : 570/819/570 causal constraints (skipped 5 transitions) in 30 ms.
[2021-05-17 18:39:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 18:39:37] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 14 ms returned sat
[2021-05-17 18:39:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 18:39:37] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2021-05-17 18:39:37] [INFO ] Computed and/alt/rep : 570/819/570 causal constraints (skipped 5 transitions) in 34 ms.
[2021-05-17 18:39:38] [INFO ] Added : 145 causal constraints over 30 iterations in 777 ms. Result :sat
[2021-05-17 18:39:38] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 14 ms returned sat
[2021-05-17 18:39:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:39:38] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2021-05-17 18:39:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 18:39:38] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 14 ms returned sat
[2021-05-17 18:39:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 18:39:38] [INFO ] [Nat]Absence check using state equation in 92 ms returned unsat
[2021-05-17 18:39:38] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 14 ms returned sat
[2021-05-17 18:39:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:39:39] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2021-05-17 18:39:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 18:39:39] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 13 ms returned sat
[2021-05-17 18:39:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 18:39:39] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2021-05-17 18:39:39] [INFO ] Computed and/alt/rep : 570/819/570 causal constraints (skipped 5 transitions) in 35 ms.
[2021-05-17 18:39:40] [INFO ] Added : 194 causal constraints over 39 iterations in 1045 ms. Result :sat
[2021-05-17 18:39:40] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 13 ms returned sat
[2021-05-17 18:39:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:39:40] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2021-05-17 18:39:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 18:39:40] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 14 ms returned sat
[2021-05-17 18:39:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 18:39:40] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2021-05-17 18:39:40] [INFO ] Computed and/alt/rep : 570/819/570 causal constraints (skipped 5 transitions) in 24 ms.
[2021-05-17 18:39:42] [INFO ] Added : 196 causal constraints over 40 iterations in 1097 ms. Result :sat
[2021-05-17 18:39:42] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 13 ms returned sat
[2021-05-17 18:39:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:39:42] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2021-05-17 18:39:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 18:39:42] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 14 ms returned sat
[2021-05-17 18:39:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 18:39:42] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2021-05-17 18:39:42] [INFO ] Computed and/alt/rep : 570/819/570 causal constraints (skipped 5 transitions) in 35 ms.
[2021-05-17 18:39:43] [INFO ] Added : 169 causal constraints over 34 iterations in 888 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0&&(p1||F(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 561 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 561/561 places, 576/576 transitions.
Graph (trivial) has 472 edges and 561 vertex of which 6 / 561 are part of one of the 1 SCC in 10 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 276 transitions
Trivial Post-agglo rules discarded 276 transitions
Performed 276 trivial Post agglomeration. Transition count delta: 276
Iterating post reduction 0 with 276 rules applied. Total rules applied 277 place count 555 transition count 293
Reduce places removed 276 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 294 rules applied. Total rules applied 571 place count 279 transition count 275
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 577 place count 273 transition count 275
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 577 place count 273 transition count 208
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 711 place count 206 transition count 208
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 901 place count 111 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 902 place count 111 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 903 place count 110 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 904 place count 110 transition count 111
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 908 place count 108 transition count 110
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 911 place count 108 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 912 place count 107 transition count 109
Applied a total of 912 rules in 101 ms. Remains 107 /561 variables (removed 454) and now considering 109/576 (removed 467) transitions.
[2021-05-17 18:39:43] [INFO ] Flow matrix only has 78 transitions (discarded 31 similar events)
// Phase 1: matrix 78 rows 107 cols
[2021-05-17 18:39:43] [INFO ] Computed 33 place invariants in 0 ms
[2021-05-17 18:39:43] [INFO ] Implicit Places using invariants in 72 ms returned []
[2021-05-17 18:39:43] [INFO ] Flow matrix only has 78 transitions (discarded 31 similar events)
// Phase 1: matrix 78 rows 107 cols
[2021-05-17 18:39:43] [INFO ] Computed 33 place invariants in 2 ms
[2021-05-17 18:39:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 18:39:43] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2021-05-17 18:39:43] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-17 18:39:43] [INFO ] Flow matrix only has 78 transitions (discarded 31 similar events)
// Phase 1: matrix 78 rows 107 cols
[2021-05-17 18:39:43] [INFO ] Computed 33 place invariants in 0 ms
[2021-05-17 18:39:43] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Finished structural reductions, in 1 iterations. Remains : 107/561 places, 109/576 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : GPUForwardProgress-PT-32b-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s24 0) (EQ s25 1)) (AND (EQ s64 1) (OR (EQ s25 0) (EQ s24 1)))), p1:(AND (EQ s64 1) (OR (EQ s25 0) (EQ s24 1))), p2:(EQ s93 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-32b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-01 finished in 566 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(X(G(p0)))) U (p1||X((p0 U p2)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 561 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 561/561 places, 576/576 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 544 transition count 559
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 544 transition count 559
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 544 transition count 553
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 48 place count 536 transition count 545
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 536 transition count 545
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 63 place count 536 transition count 538
Applied a total of 63 rules in 73 ms. Remains 536 /561 variables (removed 25) and now considering 538/576 (removed 38) transitions.
// Phase 1: matrix 538 rows 536 cols
[2021-05-17 18:39:44] [INFO ] Computed 33 place invariants in 3 ms
[2021-05-17 18:39:44] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 538 rows 536 cols
[2021-05-17 18:39:44] [INFO ] Computed 33 place invariants in 2 ms
[2021-05-17 18:39:44] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
// Phase 1: matrix 538 rows 536 cols
[2021-05-17 18:39:44] [INFO ] Computed 33 place invariants in 11 ms
[2021-05-17 18:39:44] [INFO ] Dead Transitions using invariants and state equation in 268 ms returned []
Finished structural reductions, in 1 iterations. Remains : 536/561 places, 538/576 transitions.
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (NOT p0), true, (AND (NOT p2) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-32b-02 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s47 1), p2:(AND (EQ s479 1) (EQ s47 1)), p0:(EQ s479 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][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-32b-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-02 finished in 1045 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 561 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 561/561 places, 576/576 transitions.
Graph (trivial) has 472 edges and 561 vertex of which 6 / 561 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 275 transitions
Trivial Post-agglo rules discarded 275 transitions
Performed 275 trivial Post agglomeration. Transition count delta: 275
Iterating post reduction 0 with 275 rules applied. Total rules applied 276 place count 555 transition count 294
Reduce places removed 275 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 294 rules applied. Total rules applied 570 place count 280 transition count 275
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 578 place count 274 transition count 273
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 580 place count 272 transition count 273
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 67 Pre rules applied. Total rules applied 580 place count 272 transition count 206
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 714 place count 205 transition count 206
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 0 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 4 with 184 rules applied. Total rules applied 898 place count 113 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 899 place count 113 transition count 113
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 900 place count 112 transition count 112
Iterating global reduction 5 with 1 rules applied. Total rules applied 901 place count 112 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 903 place count 111 transition count 111
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 904 place count 111 transition count 111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 905 place count 110 transition count 110
Applied a total of 905 rules in 53 ms. Remains 110 /561 variables (removed 451) and now considering 110/576 (removed 466) transitions.
[2021-05-17 18:39:45] [INFO ] Flow matrix only has 81 transitions (discarded 29 similar events)
// Phase 1: matrix 81 rows 110 cols
[2021-05-17 18:39:45] [INFO ] Computed 33 place invariants in 0 ms
[2021-05-17 18:39:45] [INFO ] Implicit Places using invariants in 63 ms returned []
[2021-05-17 18:39:45] [INFO ] Flow matrix only has 81 transitions (discarded 29 similar events)
// Phase 1: matrix 81 rows 110 cols
[2021-05-17 18:39:45] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-17 18:39:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-17 18:39:45] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2021-05-17 18:39:45] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-17 18:39:45] [INFO ] Flow matrix only has 81 transitions (discarded 29 similar events)
// Phase 1: matrix 81 rows 110 cols
[2021-05-17 18:39:45] [INFO ] Computed 33 place invariants in 0 ms
[2021-05-17 18:39:45] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 110/561 places, 110/576 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-32b-05 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:(AND (NEQ s2 0) (NEQ s39 1)), p0:(OR (NEQ s78 0) (NEQ s71 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32b-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-05 finished in 334 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X((G(p0)||X((X(p2)||p1))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 561 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 561/561 places, 576/576 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 547 transition count 562
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 547 transition count 562
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 34 place count 547 transition count 556
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 542 transition count 551
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 542 transition count 551
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 48 place count 542 transition count 547
Applied a total of 48 rules in 62 ms. Remains 542 /561 variables (removed 19) and now considering 547/576 (removed 29) transitions.
// Phase 1: matrix 547 rows 542 cols
[2021-05-17 18:39:45] [INFO ] Computed 33 place invariants in 2 ms
[2021-05-17 18:39:45] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 547 rows 542 cols
[2021-05-17 18:39:45] [INFO ] Computed 33 place invariants in 2 ms
[2021-05-17 18:39:45] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
// Phase 1: matrix 547 rows 542 cols
[2021-05-17 18:39:45] [INFO ] Computed 33 place invariants in 2 ms
[2021-05-17 18:39:46] [INFO ] Dead Transitions using invariants and state equation in 258 ms returned []
Finished structural reductions, in 1 iterations. Remains : 542/561 places, 547/576 transitions.
Stuttering acceptance computed with spot in 350 ms :[true, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-32b-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 3}], [{ cond=true, acceptance={} source=8 dest: 7}], [{ cond=true, acceptance={} source=9 dest: 10}], [{ cond=true, acceptance={} source=10 dest: 8}]], initial=9, aps=[p1:(OR (EQ s263 0) (EQ s118 1)), p2:(EQ s154 1), p0:(OR (EQ s154 1) (EQ s95 0) (EQ s86 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, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16666 reset in 339 ms.
Product exploration explored 100000 steps with 16666 reset in 251 ms.
Graph (complete) has 844 edges and 542 vertex of which 506 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.2 ms
Knowledge obtained : [p1, (NOT p2), p0]
Stuttering acceptance computed with spot in 258 ms :[true, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 16666 reset in 206 ms.
Product exploration explored 100000 steps with 16666 reset in 215 ms.
Applying partial POR strategy [true, false, true, false, false, true, true, false, false, false, false]
Stuttering acceptance computed with spot in 270 ms :[true, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 5 out of 542 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 542/542 places, 547/547 transitions.
Graph (trivial) has 439 edges and 542 vertex of which 6 / 542 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 257 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 257 rules applied. Total rules applied 258 place count 537 transition count 541
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 37 Pre rules applied. Total rules applied 258 place count 537 transition count 1199
Deduced a syphon composed of 294 places in 1 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 295 place count 537 transition count 1199
Discarding 157 places :
Symmetric choice reduction at 1 with 157 rule applications. Total rules 452 place count 380 transition count 670
Deduced a syphon composed of 137 places in 1 ms
Iterating global reduction 1 with 157 rules applied. Total rules applied 609 place count 380 transition count 670
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 231 places in 0 ms
Iterating global reduction 1 with 94 rules applied. Total rules applied 703 place count 380 transition count 670
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 705 place count 380 transition count 668
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 769 place count 316 transition count 604
Deduced a syphon composed of 167 places in 1 ms
Iterating global reduction 2 with 64 rules applied. Total rules applied 833 place count 316 transition count 604
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 168 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 834 place count 316 transition count 604
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 835 place count 315 transition count 603
Deduced a syphon composed of 167 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 836 place count 315 transition count 603
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -314
Deduced a syphon composed of 202 places in 1 ms
Iterating global reduction 2 with 35 rules applied. Total rules applied 871 place count 315 transition count 917
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 903 place count 283 transition count 853
Deduced a syphon composed of 170 places in 0 ms
Iterating global reduction 2 with 32 rules applied. Total rules applied 935 place count 283 transition count 853
Deduced a syphon composed of 170 places in 0 ms
Applied a total of 935 rules in 134 ms. Remains 283 /542 variables (removed 259) and now considering 853/547 (removed -306) transitions.
[2021-05-17 18:39:48] [INFO ] Redundant transitions in 46 ms returned []
[2021-05-17 18:39:48] [INFO ] Flow matrix only has 733 transitions (discarded 120 similar events)
// Phase 1: matrix 733 rows 283 cols
[2021-05-17 18:39:48] [INFO ] Computed 33 place invariants in 3 ms
[2021-05-17 18:39:48] [INFO ] Dead Transitions using invariants and state equation in 284 ms returned []
Finished structural reductions, in 1 iterations. Remains : 283/542 places, 853/547 transitions.
Product exploration explored 100000 steps with 16666 reset in 266 ms.
Product exploration explored 100000 steps with 16666 reset in 272 ms.
[2021-05-17 18:39:49] [INFO ] Flatten gal took : 26 ms
[2021-05-17 18:39:49] [INFO ] Flatten gal took : 26 ms
[2021-05-17 18:39:49] [INFO ] Time to serialize gal into /tmp/LTL5147241051230021514.gal : 11 ms
[2021-05-17 18:39:49] [INFO ] Time to serialize properties into /tmp/LTL12933919757718346288.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/LTL5147241051230021514.gal, -t, CGAL, -LTL, /tmp/LTL12933919757718346288.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/LTL5147241051230021514.gal -t CGAL -LTL /tmp/LTL12933919757718346288.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X((G("(((p173==1)||(p105==0))||(p95==1))"))||(X(("((p304==0)||(p131==1))")||(X("(p173==1)"))))))))))
Formula 0 simplified : !XXXX(G"(((p173==1)||(p105==0))||(p95==1))" | X("((p304==0)||(p131==1))" | X"(p173==1)"))
Detected timeout of ITS tools.
[2021-05-17 18:40:04] [INFO ] Flatten gal took : 24 ms
[2021-05-17 18:40:04] [INFO ] Applying decomposition
[2021-05-17 18:40:04] [INFO ] Flatten gal took : 23 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/graph5633363278911966630.txt, -o, /tmp/graph5633363278911966630.bin, -w, /tmp/graph5633363278911966630.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/graph5633363278911966630.bin, -l, -1, -v, -w, /tmp/graph5633363278911966630.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 18:40:04] [INFO ] Decomposing Gal with order
[2021-05-17 18:40:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 18:40:04] [INFO ] Removed a total of 69 redundant transitions.
[2021-05-17 18:40:04] [INFO ] Flatten gal took : 85 ms
[2021-05-17 18:40:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2021-05-17 18:40:04] [INFO ] Time to serialize gal into /tmp/LTL866297376340933386.gal : 9 ms
[2021-05-17 18:40:04] [INFO ] Time to serialize properties into /tmp/LTL18186309020820689185.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/LTL866297376340933386.gal, -t, CGAL, -LTL, /tmp/LTL18186309020820689185.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/LTL866297376340933386.gal -t CGAL -LTL /tmp/LTL18186309020820689185.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X((G("(((i8.u65.p173==1)||(i5.u47.p105==0))||(i4.u37.p95==1))"))||(X(("((i16.u110.p304==0)||(i6.u50.p131==1))")||(X("(i8.u65.p173==1)"))))))))))
Formula 0 simplified : !XXXX(G"(((i8.u65.p173==1)||(i5.u47.p105==0))||(i4.u37.p95==1))" | X("((i16.u110.p304==0)||(i6.u50.p131==1))" | X"(i8.u65.p173==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin402299699451523156
[2021-05-17 18:40:19] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin402299699451523156
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/ltsmin402299699451523156]
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/ltsmin402299699451523156] 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/ltsmin402299699451523156] 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 GPUForwardProgress-PT-32b-06 finished in 35502 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0 U (p1||G(p0)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 561 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 561/561 places, 576/576 transitions.
Graph (trivial) has 471 edges and 561 vertex of which 6 / 561 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 274 transitions
Trivial Post-agglo rules discarded 274 transitions
Performed 274 trivial Post agglomeration. Transition count delta: 274
Iterating post reduction 0 with 274 rules applied. Total rules applied 275 place count 555 transition count 295
Reduce places removed 274 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 290 rules applied. Total rules applied 565 place count 281 transition count 279
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 572 place count 276 transition count 277
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 574 place count 274 transition count 277
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 66 Pre rules applied. Total rules applied 574 place count 274 transition count 211
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 706 place count 208 transition count 211
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 0 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 4 with 184 rules applied. Total rules applied 890 place count 116 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 891 place count 116 transition count 118
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 892 place count 115 transition count 117
Iterating global reduction 5 with 1 rules applied. Total rules applied 893 place count 115 transition count 117
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 899 place count 112 transition count 116
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 901 place count 112 transition count 116
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 902 place count 111 transition count 115
Applied a total of 902 rules in 35 ms. Remains 111 /561 variables (removed 450) and now considering 115/576 (removed 461) transitions.
[2021-05-17 18:40:20] [INFO ] Flow matrix only has 85 transitions (discarded 30 similar events)
// Phase 1: matrix 85 rows 111 cols
[2021-05-17 18:40:20] [INFO ] Computed 33 place invariants in 0 ms
[2021-05-17 18:40:21] [INFO ] Implicit Places using invariants in 272 ms returned []
[2021-05-17 18:40:21] [INFO ] Flow matrix only has 85 transitions (discarded 30 similar events)
// Phase 1: matrix 85 rows 111 cols
[2021-05-17 18:40:21] [INFO ] Computed 33 place invariants in 0 ms
[2021-05-17 18:40:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-17 18:40:21] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
[2021-05-17 18:40:21] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-17 18:40:21] [INFO ] Flow matrix only has 85 transitions (discarded 30 similar events)
// Phase 1: matrix 85 rows 111 cols
[2021-05-17 18:40:21] [INFO ] Computed 33 place invariants in 0 ms
[2021-05-17 18:40:21] [INFO ] Dead Transitions using invariants and state equation in 92 ms returned []
Finished structural reductions, in 1 iterations. Remains : 111/561 places, 115/576 transitions.
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-32b-10 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}]], initial=0, aps=[p1:(AND (NEQ s19 0) (NEQ s73 1) (NEQ s29 0) (NEQ s96 1) (OR (NEQ s2 0) (NEQ s98 1))), p0:(AND (NEQ s29 0) (NEQ s96 1) (OR (NEQ s2 0) (NEQ s98 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32b-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-10 finished in 873 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F((X(X(p1))&&p0)) U p2)))], workingDir=/home/mcc/execution]
Support contains 5 out of 561 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 561/561 places, 576/576 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 546 transition count 561
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 546 transition count 561
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 35 place count 546 transition count 556
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 42 place count 539 transition count 549
Iterating global reduction 1 with 7 rules applied. Total rules applied 49 place count 539 transition count 549
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 55 place count 539 transition count 543
Applied a total of 55 rules in 31 ms. Remains 539 /561 variables (removed 22) and now considering 543/576 (removed 33) transitions.
// Phase 1: matrix 543 rows 539 cols
[2021-05-17 18:40:21] [INFO ] Computed 33 place invariants in 2 ms
[2021-05-17 18:40:21] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 543 rows 539 cols
[2021-05-17 18:40:21] [INFO ] Computed 33 place invariants in 2 ms
[2021-05-17 18:40:22] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
// Phase 1: matrix 543 rows 539 cols
[2021-05-17 18:40:22] [INFO ] Computed 33 place invariants in 9 ms
[2021-05-17 18:40:22] [INFO ] Dead Transitions using invariants and state equation in 226 ms returned []
Finished structural reductions, in 1 iterations. Remains : 539/561 places, 543/576 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p2), (NOT p2), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-32b-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 3}]], initial=0, aps=[p2:(OR (EQ s283 0) (EQ s7 1)), p0:(AND (EQ s199 1) (OR (EQ s511 0) (EQ s281 1))), p1:(EQ s199 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 472 ms.
Product exploration explored 100000 steps with 50000 reset in 410 ms.
Graph (complete) has 840 edges and 539 vertex of which 503 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.1 ms
Knowledge obtained : [p2, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 171 ms :[(NOT p2), (NOT p2), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 451 ms.
Product exploration explored 100000 steps with 50000 reset in 455 ms.
[2021-05-17 18:40:24] [INFO ] Flatten gal took : 21 ms
[2021-05-17 18:40:24] [INFO ] Flatten gal took : 17 ms
[2021-05-17 18:40:24] [INFO ] Time to serialize gal into /tmp/LTL6309663473026087703.gal : 3 ms
[2021-05-17 18:40:24] [INFO ] Time to serialize properties into /tmp/LTL17380258184619173933.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/LTL6309663473026087703.gal, -t, CGAL, -LTL, /tmp/LTL17380258184619173933.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/LTL6309663473026087703.gal -t CGAL -LTL /tmp/LTL17380258184619173933.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F((("(p232==1)")&&(X(X("(p232==1)"))))&&("((p603==0)||(p327==1))")))U("((p330==0)||(p7==1))"))))
Formula 0 simplified : !X(F("((p603==0)||(p327==1))" & "(p232==1)" & XX"(p232==1)") U "((p330==0)||(p7==1))")
Detected timeout of ITS tools.
[2021-05-17 18:40:39] [INFO ] Flatten gal took : 42 ms
[2021-05-17 18:40:39] [INFO ] Applying decomposition
[2021-05-17 18:40:39] [INFO ] Flatten gal took : 16 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/graph16310633157424640559.txt, -o, /tmp/graph16310633157424640559.bin, -w, /tmp/graph16310633157424640559.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/graph16310633157424640559.bin, -l, -1, -v, -w, /tmp/graph16310633157424640559.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 18:40:39] [INFO ] Decomposing Gal with order
[2021-05-17 18:40:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 18:40:40] [INFO ] Removed a total of 175 redundant transitions.
[2021-05-17 18:40:40] [INFO ] Flatten gal took : 52 ms
[2021-05-17 18:40:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-17 18:40:40] [INFO ] Time to serialize gal into /tmp/LTL7734486098667412788.gal : 4 ms
[2021-05-17 18:40:40] [INFO ] Time to serialize properties into /tmp/LTL1199047855834936134.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/LTL7734486098667412788.gal, -t, CGAL, -LTL, /tmp/LTL1199047855834936134.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/LTL7734486098667412788.gal -t CGAL -LTL /tmp/LTL1199047855834936134.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F((("(i12.u87.p232==1)")&&(X(X("(i12.u87.p232==1)"))))&&("((i32.u221.p603==0)||(i17.u122.p327==1))")))U("((i17.u123.p330==0)||(i0.i0.i0.u2.p7==1))"))))
Formula 0 simplified : !X(F("((i32.u221.p603==0)||(i17.u122.p327==1))" & "(i12.u87.p232==1)" & XX"(i12.u87.p232==1)") U "((i17.u123.p330==0)||(i0.i0.i0.u2.p7==1))")
Reverse transition relation is NOT exact ! Due to transitions t510, i1.t498, i1.u14.t505, i2.t492, i2.u20.t485, i3.t478, i3.t469, i4.t462, i4.t452, i5.t445, i5.t438, i6.t431, i6.u51.t421, i7.t414, i7.t407, i8.t400, i8.t390, i9.t383, i9.u66.t375, i10.t368, i10.t361, i11.t354, i11.t344, i12.t337, i12.t327, i13.t320, i13.t313, i14.t306, i14.t299, i15.t292, i15.u107.t283, i16.t276, i16.t266, i17.t259, i17.t250, i18.t243, i18.t236, i19.t229, i19.u133.t222, i20.t215, i20.u139.t208, i21.t201, i21.u145.t192, i22.t185, i22.t175, i23.t168, i23.u163.t158, i24.t151, i24.u169.t144, i25.t137, i25.t129, i26.t122, i26.t115, i27.t108, i27.t101, i28.t94, i28.u191.t87, i29.t80, i29.t73, i30.t66, i30.t57, i31.t50, i31.t43, i32.t36, i32.t29, i33.t23, i33.t12, i33.t2, i33.u225.t24, i33.u231.t5, i33.u231.t6, i33.u231.t8, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/471/72/543
Computing Next relation with stutter on 3.70604e+15 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
122 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,1.26664,51268,1,0,55271,278,4408,80236,157,452,359908
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-32b-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property GPUForwardProgress-PT-32b-11 finished in 19690 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((!p0&&F(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 561 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 561/561 places, 576/576 transitions.
Graph (trivial) has 474 edges and 561 vertex of which 6 / 561 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 276 transitions
Trivial Post-agglo rules discarded 276 transitions
Performed 276 trivial Post agglomeration. Transition count delta: 276
Iterating post reduction 0 with 276 rules applied. Total rules applied 277 place count 555 transition count 293
Reduce places removed 276 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 294 rules applied. Total rules applied 571 place count 279 transition count 275
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 577 place count 273 transition count 275
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 577 place count 273 transition count 208
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 711 place count 206 transition count 208
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 905 place count 109 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 906 place count 109 transition count 110
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 907 place count 108 transition count 109
Iterating global reduction 4 with 1 rules applied. Total rules applied 908 place count 108 transition count 109
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 912 place count 106 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 913 place count 105 transition count 107
Applied a total of 913 rules in 33 ms. Remains 105 /561 variables (removed 456) and now considering 107/576 (removed 469) transitions.
[2021-05-17 18:40:41] [INFO ] Flow matrix only has 76 transitions (discarded 31 similar events)
// Phase 1: matrix 76 rows 105 cols
[2021-05-17 18:40:41] [INFO ] Computed 33 place invariants in 0 ms
[2021-05-17 18:40:41] [INFO ] Implicit Places using invariants in 67 ms returned []
[2021-05-17 18:40:41] [INFO ] Flow matrix only has 76 transitions (discarded 31 similar events)
// Phase 1: matrix 76 rows 105 cols
[2021-05-17 18:40:41] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-17 18:40:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 18:40:41] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2021-05-17 18:40:41] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-17 18:40:41] [INFO ] Flow matrix only has 76 transitions (discarded 31 similar events)
// Phase 1: matrix 76 rows 105 cols
[2021-05-17 18:40:41] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-17 18:40:41] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 1 iterations. Remains : 105/561 places, 107/576 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, p0, (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-14 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (NEQ s5 0) (NEQ s67 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 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32b-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-14 finished in 378 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 561 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 561/561 places, 576/576 transitions.
Graph (trivial) has 475 edges and 561 vertex of which 6 / 561 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 276 transitions
Trivial Post-agglo rules discarded 276 transitions
Performed 276 trivial Post agglomeration. Transition count delta: 276
Iterating post reduction 0 with 276 rules applied. Total rules applied 277 place count 555 transition count 293
Reduce places removed 276 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 295 rules applied. Total rules applied 572 place count 279 transition count 274
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 579 place count 273 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 580 place count 272 transition count 273
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 68 Pre rules applied. Total rules applied 580 place count 272 transition count 205
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 4 with 136 rules applied. Total rules applied 716 place count 204 transition count 205
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 910 place count 107 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 911 place count 107 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 912 place count 106 transition count 106
Iterating global reduction 5 with 1 rules applied. Total rules applied 913 place count 106 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 915 place count 105 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 916 place count 104 transition count 104
Applied a total of 916 rules in 29 ms. Remains 104 /561 variables (removed 457) and now considering 104/576 (removed 472) transitions.
[2021-05-17 18:40:41] [INFO ] Flow matrix only has 74 transitions (discarded 30 similar events)
// Phase 1: matrix 74 rows 104 cols
[2021-05-17 18:40:41] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-17 18:40:41] [INFO ] Implicit Places using invariants in 67 ms returned []
[2021-05-17 18:40:41] [INFO ] Flow matrix only has 74 transitions (discarded 30 similar events)
// Phase 1: matrix 74 rows 104 cols
[2021-05-17 18:40:41] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-17 18:40:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 18:40:42] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2021-05-17 18:40:42] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-17 18:40:42] [INFO ] Flow matrix only has 74 transitions (discarded 30 similar events)
// Phase 1: matrix 74 rows 104 cols
[2021-05-17 18:40:42] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-17 18:40:42] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
Finished structural reductions, in 1 iterations. Remains : 104/561 places, 104/576 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-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:(NEQ s22 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 24 steps with 1 reset in 3 ms.
FORMULA GPUForwardProgress-PT-32b-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-15 finished in 312 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin951215437256321804
[2021-05-17 18:40:42] [INFO ] Computing symmetric may disable matrix : 576 transitions.
[2021-05-17 18:40:42] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 18:40:42] [INFO ] Computing symmetric may enable matrix : 576 transitions.
[2021-05-17 18:40:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 18:40:42] [INFO ] Applying decomposition
[2021-05-17 18:40:42] [INFO ] Flatten gal took : 23 ms
[2021-05-17 18:40:42] [INFO ] Computing Do-Not-Accords matrix : 576 transitions.
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/graph13740595785487336153.txt, -o, /tmp/graph13740595785487336153.bin, -w, /tmp/graph13740595785487336153.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/graph13740595785487336153.bin, -l, -1, -v, -w, /tmp/graph13740595785487336153.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 18:40:42] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 18:40:42] [INFO ] Decomposing Gal with order
[2021-05-17 18:40:42] [INFO ] Built C files in 127ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin951215437256321804
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/ltsmin951215437256321804]
[2021-05-17 18:40:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 18:40:42] [INFO ] Removed a total of 66 redundant transitions.
[2021-05-17 18:40:42] [INFO ] Flatten gal took : 32 ms
[2021-05-17 18:40:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 8 ms.
[2021-05-17 18:40:42] [INFO ] Time to serialize gal into /tmp/LTLCardinality12540473295657009558.gal : 4 ms
[2021-05-17 18:40:42] [INFO ] Time to serialize properties into /tmp/LTLCardinality3333077168168405344.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/LTLCardinality12540473295657009558.gal, -t, CGAL, -LTL, /tmp/LTLCardinality3333077168168405344.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/LTLCardinality12540473295657009558.gal -t CGAL -LTL /tmp/LTLCardinality3333077168168405344.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X((G("(((i9.i1.u64.p173==1)||(i6.i0.u40.p105==0))||(i5.i0.u36.p95==1))"))||(X(("((i17.i1.u115.p304==0)||(i7.i0.u49.p131==1))")||(X("(i9.i1.u64.p173==1)"))))))))))
Formula 0 simplified : !XXXX(G"(((i9.i1.u64.p173==1)||(i6.i0.u40.p105==0))||(i5.i0.u36.p95==1))" | X("((i17.i1.u115.p304==0)||(i7.i0.u49.p131==1))" | X"(i9.i1.u64.p173==1)"))
Compilation finished in 3773 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin951215437256321804]
Link finished in 49 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, --when, --ltl, X(X(X(X(([]((LTLAPp0==true))||X((X((LTLAPp2==true))||(LTLAPp1==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin951215437256321804]
LTSmin run took 2275 ms.
FORMULA GPUForwardProgress-PT-32b-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
BK_STOP 1621276849546
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-32b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-32b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r292-tall-162124156100220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-32b.tgz
mv GPUForwardProgress-PT-32b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;