About the Execution of ITS-Tools for HirschbergSinclair-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2158.060 | 141168.00 | 354168.00 | 6703.50 | TFFFFFTTFTFFFTFF | 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-162124156400405.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 HirschbergSinclair-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156400405
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 33K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 160K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 113K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 12 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 5.0K May 11 18:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 11 18:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 11 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K May 11 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 3 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 333K 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 HirschbergSinclair-PT-10-00
FORMULA_NAME HirschbergSinclair-PT-10-01
FORMULA_NAME HirschbergSinclair-PT-10-02
FORMULA_NAME HirschbergSinclair-PT-10-03
FORMULA_NAME HirschbergSinclair-PT-10-04
FORMULA_NAME HirschbergSinclair-PT-10-05
FORMULA_NAME HirschbergSinclair-PT-10-06
FORMULA_NAME HirschbergSinclair-PT-10-07
FORMULA_NAME HirschbergSinclair-PT-10-08
FORMULA_NAME HirschbergSinclair-PT-10-09
FORMULA_NAME HirschbergSinclair-PT-10-10
FORMULA_NAME HirschbergSinclair-PT-10-11
FORMULA_NAME HirschbergSinclair-PT-10-12
FORMULA_NAME HirschbergSinclair-PT-10-13
FORMULA_NAME HirschbergSinclair-PT-10-14
FORMULA_NAME HirschbergSinclair-PT-10-15
=== Now, execution of the tool begins
BK_START 1621284855181
Running Version 0
[2021-05-17 20:54:24] [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-17 20:54:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 20:54:24] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2021-05-17 20:54:24] [INFO ] Transformed 260 places.
[2021-05-17 20:54:24] [INFO ] Transformed 236 transitions.
[2021-05-17 20:54:24] [INFO ] Parsed PT model containing 260 places and 236 transitions in 106 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 20:54:24] [INFO ] Initial state test concluded for 6 properties.
FORMULA HirschbergSinclair-PT-10-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-10-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-10-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-10-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-10-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 260 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 260/260 places, 236/236 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 250 transition count 236
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 17 place count 243 transition count 229
Iterating global reduction 1 with 7 rules applied. Total rules applied 24 place count 243 transition count 229
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 238 transition count 224
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 238 transition count 224
Applied a total of 34 rules in 53 ms. Remains 238 /260 variables (removed 22) and now considering 224/236 (removed 12) transitions.
// Phase 1: matrix 224 rows 238 cols
[2021-05-17 20:54:25] [INFO ] Computed 14 place invariants in 19 ms
[2021-05-17 20:54:25] [INFO ] Implicit Places using invariants in 201 ms returned []
// Phase 1: matrix 224 rows 238 cols
[2021-05-17 20:54:25] [INFO ] Computed 14 place invariants in 7 ms
[2021-05-17 20:54:25] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
// Phase 1: matrix 224 rows 238 cols
[2021-05-17 20:54:25] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-17 20:54:25] [INFO ] Dead Transitions using invariants and state equation in 178 ms returned []
Finished structural reductions, in 1 iterations. Remains : 238/260 places, 224/236 transitions.
[2021-05-17 20:54:25] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 20:54:25] [INFO ] Flatten gal took : 47 ms
FORMULA HirschbergSinclair-PT-10-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-10-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 20:54:25] [INFO ] Flatten gal took : 20 ms
[2021-05-17 20:54:25] [INFO ] Input system was already deterministic with 224 transitions.
Finished random walk after 231 steps, including 0 resets, run visited all 20 properties in 6 ms. (steps per millisecond=38 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0||G(p1)))&&X(F(!p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 238 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 238/238 places, 224/224 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 234 transition count 220
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 234 transition count 220
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 231 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 231 transition count 217
Applied a total of 14 rules in 22 ms. Remains 231 /238 variables (removed 7) and now considering 217/224 (removed 7) transitions.
// Phase 1: matrix 217 rows 231 cols
[2021-05-17 20:54:26] [INFO ] Computed 14 place invariants in 7 ms
[2021-05-17 20:54:26] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 217 rows 231 cols
[2021-05-17 20:54:26] [INFO ] Computed 14 place invariants in 5 ms
[2021-05-17 20:54:26] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
// Phase 1: matrix 217 rows 231 cols
[2021-05-17 20:54:26] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-17 20:54:26] [INFO ] Dead Transitions using invariants and state equation in 109 ms returned []
Finished structural reductions, in 1 iterations. Remains : 231/238 places, 217/224 transitions.
Stuttering acceptance computed with spot in 273 ms :[(NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : HirschbergSinclair-PT-10-02 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=1, aps=[p1:(OR (LT s15 1) (LT s50 1)), p0:(AND (GEQ s5 1) (GEQ s104 1))], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 39 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-10-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-10-02 finished in 808 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(((p0 U p1)&&(p2 U (p3||G(p4)))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 238 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 238/238 places, 224/224 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 237 transition count 148
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 150 place count 162 transition count 148
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 154 place count 158 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 158 place count 158 transition count 144
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 159 place count 158 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 160 place count 157 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 161 place count 156 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 162 place count 155 transition count 141
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 163 place count 154 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 164 place count 153 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 165 place count 152 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 166 place count 151 transition count 137
Applied a total of 166 rules in 68 ms. Remains 151 /238 variables (removed 87) and now considering 137/224 (removed 87) transitions.
// Phase 1: matrix 137 rows 151 cols
[2021-05-17 20:54:26] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:54:26] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 137 rows 151 cols
[2021-05-17 20:54:26] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:54:27] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-17 20:54:27] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2021-05-17 20:54:27] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 137 rows 151 cols
[2021-05-17 20:54:27] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:54:27] [INFO ] Dead Transitions using invariants and state equation in 80 ms returned []
Finished structural reductions, in 1 iterations. Remains : 151/238 places, 137/224 transitions.
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p1) (AND (NOT p3) (NOT p4))), (OR (NOT p1) (AND (NOT p3) (NOT p4))), (NOT p1), (AND (NOT p3) (NOT p4)), (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4))), (AND (NOT p1) (NOT p4))]
Running random walk in product with property : HirschbergSinclair-PT-10-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p4) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p1) p0 p3) (AND (NOT p1) p0 p4) (AND (NOT p1) p0 p2)), acceptance={} source=0 dest: 2}, { cond=(OR (AND p1 (NOT p3) (NOT p4) p2) (AND p0 (NOT p3) (NOT p4) p2)), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p4) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p1) p0 p3) (AND (NOT p1) p0 p4) (AND (NOT p1) p0 p2)), acceptance={0} source=1 dest: 2}, { cond=(OR (AND p1 (NOT p3) (NOT p4) p2) (AND p0 (NOT p3) (NOT p4) p2)), acceptance={0} source=1 dest: 3}, { cond=(OR (AND p1 (NOT p3) p4 p2) (AND p0 (NOT p3) p4 p2)), acceptance={} source=1 dest: 3}, { cond=(OR (AND p1 (NOT p3) p4 (NOT p2)) (AND p0 (NOT p3) p4 (NOT p2))), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p4) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p4) p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) p4 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p4 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p4)) (AND (NOT p3) (NOT p4) (NOT p2))), acceptance={0} source=4 dest: 1}, { cond=(OR (AND (NOT p1) p0 p3 (NOT p4)) (AND (NOT p1) p0 (NOT p4) p2)), acceptance={0} source=4 dest: 2}, { cond=(OR (AND p1 (NOT p3) (NOT p4) p2) (AND p0 (NOT p3) (NOT p4) p2)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND p1 (NOT p3) p4 p2) (AND p0 (NOT p3) p4 p2)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p0) p4) (AND (NOT p3) p4 (NOT p2))), acceptance={} source=4 dest: 4}, { cond=(OR (AND (NOT p1) p0 p3 p4) (AND (NOT p1) p0 p4 p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p4)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p4)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p4), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0 p4), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s3 1) (GEQ s14 1)), p0:(GEQ s76 1), p3:(AND (GEQ s8 1) (GEQ s79 1)), p4:(GEQ s17 1), p2:(AND (GEQ s3 1) (GEQ s126 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 144 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-10-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-10-03 finished in 734 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U X((p1&&F(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 238 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 238/238 places, 224/224 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 233 transition count 219
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 233 transition count 219
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 230 transition count 216
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 230 transition count 216
Applied a total of 16 rules in 20 ms. Remains 230 /238 variables (removed 8) and now considering 216/224 (removed 8) transitions.
// Phase 1: matrix 216 rows 230 cols
[2021-05-17 20:54:27] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-17 20:54:27] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 216 rows 230 cols
[2021-05-17 20:54:27] [INFO ] Computed 14 place invariants in 4 ms
[2021-05-17 20:54:27] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 230 cols
[2021-05-17 20:54:27] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-17 20:54:27] [INFO ] Dead Transitions using invariants and state equation in 113 ms returned []
Finished structural reductions, in 1 iterations. Remains : 230/238 places, 216/224 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-10-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s147 1) (OR (LT s13 1) (LT s90 1))), p1:(LT s147 1), p2:(GEQ s97 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 851 reset in 296 ms.
Product exploration explored 100000 steps with 852 reset in 244 ms.
Graph (complete) has 439 edges and 230 vertex of which 220 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Knowledge obtained : [(NOT p0), p1, (NOT p2)]
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0)]
Product exploration explored 100000 steps with 852 reset in 188 ms.
Product exploration explored 100000 steps with 852 reset in 193 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 8110 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0)]
Support contains 4 out of 230 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 230/230 places, 216/216 transitions.
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 230 transition count 216
Deduced a syphon composed of 83 places in 1 ms
Applied a total of 83 rules in 18 ms. Remains 230 /230 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2021-05-17 20:54:37] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 216 rows 230 cols
[2021-05-17 20:54:37] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:54:37] [INFO ] Dead Transitions using invariants and state equation in 105 ms returned []
Finished structural reductions, in 1 iterations. Remains : 230/230 places, 216/216 transitions.
Product exploration explored 100000 steps with 1379 reset in 380 ms.
Product exploration explored 100000 steps with 1381 reset in 243 ms.
[2021-05-17 20:54:38] [INFO ] Flatten gal took : 14 ms
[2021-05-17 20:54:38] [INFO ] Flatten gal took : 13 ms
[2021-05-17 20:54:38] [INFO ] Time to serialize gal into /tmp/LTL1867194731066087088.gal : 12 ms
[2021-05-17 20:54:38] [INFO ] Time to serialize properties into /tmp/LTL11326536944312372202.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/LTL1867194731066087088.gal, -t, CGAL, -LTL, /tmp/LTL11326536944312372202.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/LTL1867194731066087088.gal -t CGAL -LTL /tmp/LTL11326536944312372202.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("((rcv_left_reply_10_3_10>=1)&&((newmsg7<1)||(reply_10_2_to_right_6<1)))"))U(X(("(rcv_left_reply_10_3_10<1)")&&(F("(rcv_left_reply_10_2_10>=1)"))))))
Formula 0 simplified : !(F"((rcv_left_reply_10_3_10>=1)&&((newmsg7<1)||(reply_10_2_to_right_6<1)))" U X("(rcv_left_reply_10_3_10<1)" & F"(rcv_left_reply_10_2_10>=1)"))
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t13, t15, t18, t20, t22, t24, t26, t28, t32, t34, t36, t38, t40, t42, t45, t47, t191, t211, t223, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/186/30/216
Computing Next relation with stutter on 2.34375e+07 deadlock states
Detected timeout of ITS tools.
[2021-05-17 20:54:53] [INFO ] Flatten gal took : 12 ms
[2021-05-17 20:54:53] [INFO ] Applying decomposition
[2021-05-17 20:54:53] [INFO ] Flatten gal took : 14 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/graph701469628821621559.txt, -o, /tmp/graph701469628821621559.bin, -w, /tmp/graph701469628821621559.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/graph701469628821621559.bin, -l, -1, -v, -w, /tmp/graph701469628821621559.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:54:53] [INFO ] Decomposing Gal with order
[2021-05-17 20:54:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:54:53] [INFO ] Removed a total of 24 redundant transitions.
[2021-05-17 20:54:53] [INFO ] Flatten gal took : 78 ms
[2021-05-17 20:54:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2021-05-17 20:54:53] [INFO ] Time to serialize gal into /tmp/LTL15195846499378034649.gal : 11 ms
[2021-05-17 20:54:53] [INFO ] Time to serialize properties into /tmp/LTL12035774245041337270.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/LTL15195846499378034649.gal, -t, CGAL, -LTL, /tmp/LTL12035774245041337270.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/LTL15195846499378034649.gal -t CGAL -LTL /tmp/LTL12035774245041337270.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("((i2.u6.rcv_left_reply_10_3_10>=1)&&((i0.u3.newmsg7<1)||(i0.u9.reply_10_2_to_right_6<1)))"))U(X(("(i2.u6.rcv_left_reply_10_3_10<1)")&&(F("(i2.u6.rcv_left_reply_10_2_10>=1)"))))))
Formula 0 simplified : !(F"((i2.u6.rcv_left_reply_10_3_10>=1)&&((i0.u3.newmsg7<1)||(i0.u9.reply_10_2_to_right_6<1)))" U X("(i2.u6.rcv_left_reply_10_3_10<1)" & F"(i2.u6.rcv_left_reply_10_2_10>=1)"))
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t8, t9, t24, t191, t223, i0.t6, i0.u3.t36, i0.u3.t42, i0.u9.t32, i0.u9.t38, i1.t47, i1.i0.u4.t40, i1.i1.u10.t45, i1.i1.u10.t211, i2.t0, i2.u0.t15, i2.u6.t11, i3.t28, i3.t4, i3.i0.u2.t22, i3.i1.u8.t26, i3.i1.u8.t34, i4.t20, i4.u1.t18, i4.u7.t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/186/30/216
Computing Next relation with stutter on 2.34375e+07 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16485562057363455244
[2021-05-17 20:55:08] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16485562057363455244
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/ltsmin16485562057363455244]
Compilation finished in 894 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin16485562057363455244]
Link finished in 38 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, (<>((LTLAPp0==true)) U X(((LTLAPp1==true)&&<>((LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin16485562057363455244]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-10-06 finished in 56413 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(F(p0))||(p1&&F(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 238 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 238/238 places, 224/224 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 237 transition count 136
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 1 with 87 rules applied. Total rules applied 174 place count 150 transition count 136
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 179 place count 145 transition count 131
Iterating global reduction 2 with 5 rules applied. Total rules applied 184 place count 145 transition count 131
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 186 place count 145 transition count 129
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 188 place count 143 transition count 129
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 189 place count 142 transition count 128
Iterating global reduction 4 with 1 rules applied. Total rules applied 190 place count 142 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 191 place count 141 transition count 127
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 192 place count 140 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 193 place count 139 transition count 125
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 194 place count 138 transition count 124
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 195 place count 137 transition count 123
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 196 place count 136 transition count 122
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 197 place count 135 transition count 121
Applied a total of 197 rules in 46 ms. Remains 135 /238 variables (removed 103) and now considering 121/224 (removed 103) transitions.
// Phase 1: matrix 121 rows 135 cols
[2021-05-17 20:55:23] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:55:24] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 121 rows 135 cols
[2021-05-17 20:55:24] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-17 20:55:24] [INFO ] State equation strengthened by 10 read => feed constraints.
[2021-05-17 20:55:24] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2021-05-17 20:55:24] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 121 rows 135 cols
[2021-05-17 20:55:24] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-17 20:55:24] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Finished structural reductions, in 1 iterations. Remains : 135/238 places, 121/224 transitions.
Stuttering acceptance computed with spot in 81 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-10-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s6 1) (LT s77 1)), p2:(GEQ s90 1), p1:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1023 reset in 258 ms.
Product exploration explored 100000 steps with 1024 reset in 234 ms.
Graph (complete) has 329 edges and 135 vertex of which 125 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Knowledge obtained : [p0, (NOT p2), p1]
Stuttering acceptance computed with spot in 86 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1014 reset in 143 ms.
Product exploration explored 100000 steps with 1019 reset in 158 ms.
[2021-05-17 20:55:25] [INFO ] Flatten gal took : 7 ms
[2021-05-17 20:55:25] [INFO ] Flatten gal took : 7 ms
[2021-05-17 20:55:25] [INFO ] Time to serialize gal into /tmp/LTL1429974169550622946.gal : 1 ms
[2021-05-17 20:55:25] [INFO ] Time to serialize properties into /tmp/LTL11382459278217378516.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/LTL1429974169550622946.gal, -t, CGAL, -LTL, /tmp/LTL11382459278217378516.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/LTL1429974169550622946.gal -t CGAL -LTL /tmp/LTL11382459278217378516.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F((G(F("((newmsg5<1)||(reply_10_3_to_right_4<1))")))||(("(init2>=1)")&&(F("(rcv_left_election_10_3_5_5>=1)")))))))
Formula 0 simplified : !GF(GF"((newmsg5<1)||(reply_10_3_to_right_4<1))" | ("(init2>=1)" & F"(rcv_left_election_10_3_5_5>=1)"))
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t12.t13, t14.t15, t17.t18, t21.t22, t26, t27.t28, t31.t32, t34, t35.t36, t39.t40, t44.t45, t190.t191, t210.t211, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/106/15/121
Computing Next relation with stutter on 2.34375e+07 deadlock states
716 unique states visited
0 strongly connected components in search stack
803 transitions explored
133 items max in DFS search stack
455 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,4.56261,168360,1,0,1548,646397,279,1568,4028,798800,6222
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HirschbergSinclair-PT-10-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property HirschbergSinclair-PT-10-07 finished in 6824 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 238 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 238/238 places, 224/224 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 237 transition count 129
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 1 with 94 rules applied. Total rules applied 188 place count 143 transition count 129
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 193 place count 138 transition count 124
Iterating global reduction 2 with 5 rules applied. Total rules applied 198 place count 138 transition count 124
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 200 place count 138 transition count 122
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 202 place count 136 transition count 122
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 203 place count 135 transition count 121
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 204 place count 134 transition count 120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 205 place count 133 transition count 119
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 206 place count 132 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 207 place count 131 transition count 117
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 208 place count 130 transition count 116
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 209 place count 129 transition count 115
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 210 place count 128 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 211 place count 127 transition count 113
Applied a total of 211 rules in 42 ms. Remains 127 /238 variables (removed 111) and now considering 113/224 (removed 111) transitions.
// Phase 1: matrix 113 rows 127 cols
[2021-05-17 20:55:30] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:55:30] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 113 rows 127 cols
[2021-05-17 20:55:30] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-17 20:55:30] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2021-05-17 20:55:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 113 rows 127 cols
[2021-05-17 20:55:30] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:55:31] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 1 iterations. Remains : 127/238 places, 113/224 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p1), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-10-08 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(LT s94 1), p0:(AND (GEQ s80 1) (LT s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 89 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-10-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-10-08 finished in 365 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 238 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 238/238 places, 224/224 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 234 transition count 220
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 234 transition count 220
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 232 transition count 218
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 232 transition count 218
Applied a total of 12 rules in 8 ms. Remains 232 /238 variables (removed 6) and now considering 218/224 (removed 6) transitions.
// Phase 1: matrix 218 rows 232 cols
[2021-05-17 20:55:31] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:55:31] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 218 rows 232 cols
[2021-05-17 20:55:31] [INFO ] Computed 14 place invariants in 3 ms
[2021-05-17 20:55:31] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
// Phase 1: matrix 218 rows 232 cols
[2021-05-17 20:55:31] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:55:31] [INFO ] Dead Transitions using invariants and state equation in 99 ms returned []
Finished structural reductions, in 1 iterations. Remains : 232/238 places, 218/224 transitions.
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-10-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s221 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-10-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-10-11 finished in 541 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&X(F(!p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 238 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 238/238 places, 224/224 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 233 transition count 219
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 233 transition count 219
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 230 transition count 216
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 230 transition count 216
Applied a total of 16 rules in 8 ms. Remains 230 /238 variables (removed 8) and now considering 216/224 (removed 8) transitions.
// Phase 1: matrix 216 rows 230 cols
[2021-05-17 20:55:31] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:55:31] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 216 rows 230 cols
[2021-05-17 20:55:31] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-17 20:55:31] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 230 cols
[2021-05-17 20:55:32] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:55:32] [INFO ] Dead Transitions using invariants and state equation in 100 ms returned []
Finished structural reductions, in 1 iterations. Remains : 230/238 places, 216/224 transitions.
Stuttering acceptance computed with spot in 75 ms :[p0, true, true, true]
Running random walk in product with property : HirschbergSinclair-PT-10-12 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(GEQ s33 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, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-10-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-10-12 finished in 555 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 238 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 238/238 places, 224/224 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 237 transition count 137
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 172 place count 151 transition count 137
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 177 place count 146 transition count 132
Iterating global reduction 2 with 5 rules applied. Total rules applied 182 place count 146 transition count 132
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 184 place count 146 transition count 130
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 186 place count 144 transition count 130
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 187 place count 143 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 188 place count 142 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 189 place count 141 transition count 127
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 190 place count 140 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 191 place count 139 transition count 125
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 192 place count 138 transition count 124
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 193 place count 137 transition count 123
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 194 place count 136 transition count 122
Applied a total of 194 rules in 33 ms. Remains 136 /238 variables (removed 102) and now considering 122/224 (removed 102) transitions.
// Phase 1: matrix 122 rows 136 cols
[2021-05-17 20:55:32] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:55:32] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 122 rows 136 cols
[2021-05-17 20:55:32] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:55:32] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2021-05-17 20:55:32] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 122 rows 136 cols
[2021-05-17 20:55:32] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:55:32] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Finished structural reductions, in 1 iterations. Remains : 136/238 places, 122/224 transitions.
Stuttering acceptance computed with spot in 58 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-10-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 (LT s4 1) (LT s77 1)), p1:(LT s49 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 601 steps with 4 reset in 1 ms.
FORMULA HirschbergSinclair-PT-10-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-10-14 finished in 399 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 238 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 238/238 places, 224/224 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 237 transition count 137
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 172 place count 151 transition count 137
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 177 place count 146 transition count 132
Iterating global reduction 2 with 5 rules applied. Total rules applied 182 place count 146 transition count 132
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 184 place count 146 transition count 130
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 186 place count 144 transition count 130
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 187 place count 143 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 188 place count 142 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 189 place count 141 transition count 127
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 190 place count 140 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 191 place count 139 transition count 125
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 192 place count 138 transition count 124
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 193 place count 137 transition count 123
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 194 place count 136 transition count 122
Applied a total of 194 rules in 32 ms. Remains 136 /238 variables (removed 102) and now considering 122/224 (removed 102) transitions.
// Phase 1: matrix 122 rows 136 cols
[2021-05-17 20:55:32] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:55:32] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 122 rows 136 cols
[2021-05-17 20:55:32] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:55:32] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2021-05-17 20:55:32] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 122 rows 136 cols
[2021-05-17 20:55:32] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-17 20:55:32] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 1 iterations. Remains : 136/238 places, 122/224 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-10-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:(AND (GEQ s7 1) (GEQ s92 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]]
Product exploration explored 100000 steps with 1284 reset in 143 ms.
Product exploration explored 100000 steps with 1286 reset in 162 ms.
Graph (complete) has 328 edges and 136 vertex of which 126 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1286 reset in 140 ms.
Product exploration explored 100000 steps with 1286 reset in 155 ms.
[2021-05-17 20:55:33] [INFO ] Flatten gal took : 6 ms
[2021-05-17 20:55:33] [INFO ] Flatten gal took : 6 ms
[2021-05-17 20:55:33] [INFO ] Time to serialize gal into /tmp/LTL104320811209957189.gal : 1 ms
[2021-05-17 20:55:33] [INFO ] Time to serialize properties into /tmp/LTL3756486234533412680.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/LTL104320811209957189.gal, -t, CGAL, -LTL, /tmp/LTL3756486234533412680.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/LTL104320811209957189.gal -t CGAL -LTL /tmp/LTL3756486234533412680.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((newmsg7>=1)&&(election_10_3_7_to_right_6>=1))"))))
Formula 0 simplified : !GF"((newmsg7>=1)&&(election_10_3_7_to_right_6>=1))"
Reverse transition relation is NOT exact ! Due to transitions t6, t12.t13, t17.t18, t21.t22, t25.t26, t31.t32, t36, t37.t38, t39.t40, t42, t44.t45, t190.t191, t210.t211, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/109/13/122
Computing Next relation with stutter on 2.34375e+07 deadlock states
136 unique states visited
136 strongly connected components in search stack
137 transitions explored
136 items max in DFS search stack
357 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,3.58306,130160,1,0,538,465626,274,585,4043,571352,1594
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HirschbergSinclair-PT-10-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property HirschbergSinclair-PT-10-15 finished in 5151 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11454776478869200845
[2021-05-17 20:55:37] [INFO ] Computing symmetric may disable matrix : 224 transitions.
[2021-05-17 20:55:37] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 20:55:37] [INFO ] Computing symmetric may enable matrix : 224 transitions.
[2021-05-17 20:55:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 20:55:37] [INFO ] Applying decomposition
[2021-05-17 20:55:37] [INFO ] Flatten gal took : 11 ms
[2021-05-17 20:55:37] [INFO ] Computing Do-Not-Accords matrix : 224 transitions.
[2021-05-17 20:55:37] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph8975167703684116204.txt, -o, /tmp/graph8975167703684116204.bin, -w, /tmp/graph8975167703684116204.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/graph8975167703684116204.bin, -l, -1, -v, -w, /tmp/graph8975167703684116204.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:55:37] [INFO ] Decomposing Gal with order
[2021-05-17 20:55:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:55:37] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11454776478869200845
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/ltsmin11454776478869200845]
[2021-05-17 20:55:37] [INFO ] Removed a total of 17 redundant transitions.
[2021-05-17 20:55:37] [INFO ] Flatten gal took : 56 ms
[2021-05-17 20:55:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 20:55:37] [INFO ] Time to serialize gal into /tmp/LTLFireability16356242177010083214.gal : 10 ms
[2021-05-17 20:55:37] [INFO ] Time to serialize properties into /tmp/LTLFireability4082334705720613630.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/LTLFireability16356242177010083214.gal, -t, CGAL, -LTL, /tmp/LTLFireability4082334705720613630.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/LTLFireability16356242177010083214.gal -t CGAL -LTL /tmp/LTLFireability4082334705720613630.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("((i5.u8.rcv_left_reply_10_3_10>=1)&&((i3.u6.newmsg7<1)||(i2.i1.u5.reply_10_2_to_right_6<1)))"))U(X(("(i5.u8.rcv_left_reply_10_3_10<1)")&&(F("(i5.u8.rcv_left_reply_10_2_10>=1)"))))))
Formula 0 simplified : !(F"((i5.u8.rcv_left_reply_10_3_10>=1)&&((i3.u6.newmsg7<1)||(i2.i1.u5.reply_10_2_to_right_6<1)))" U X("(i5.u8.rcv_left_reply_10_3_10<1)" & F"(i5.u8.rcv_left_reply_10_2_10>=1)"))
Compilation finished in 1005 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11454776478869200845]
Link finished in 36 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, (<>((LTLAPp0==true)) U X(((LTLAPp1==true)&&<>((LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11454776478869200845]
Reverse transition relation is NOT exact ! Due to transitions start1, start2, start3, start4, start5, start7, start8, start9, start10, hdl_right_election_3_0_1_2, hdl_right_election_9_0_1_8, elected_10_10, i0.u1.hdl_left_election_1_0_1_2, i0.u1.reply_2_0_from_left_2, i1.hdl_right_election_4_0_1_3, i1.u2.hdl_left_election_2_0_1_3, i1.u3.hdl_left_election_3_0_1_4, i2.hdl_right_election_6_0_1_5, i2.start6, i2.i0.u4.hdl_left_election_4_0_1_5, i2.i0.u4.hdl_left_reply_5_0_5, i2.i1.u5.hdl_left_election_5_0_1_6, i2.i1.u5.hdl_right_election_7_0_1_6, i3.u6.hdl_left_election_6_0_1_7, i3.u9.hdl_left_election_7_0_1_8, i3.u9.reply_8_0_from_left_8, i4.u7.hdl_left_election_8_0_1_9, i5.u8.hdl_right_election_1_0_1_10, i5.u8.hdl_left_election_9_0_1_10, i5.u8.hdl_right_election_10_4_10_10, i5.u8.hdl_left_election_10_4_10_10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/193/31/224
Computing Next relation with stutter on 5.67e+07 deadlock states
5 unique states visited
0 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
2341 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,23.4438,475724,1,0,746588,292862,3423,1.69053e+06,1983,2.28058e+06,658882
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HirschbergSinclair-PT-10-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
BK_STOP 1621284996349
--------------------
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="HirschbergSinclair-PT-10"
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 HirschbergSinclair-PT-10, 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 r292-tall-162124156400405"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-10.tgz
mv HirschbergSinclair-PT-10 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 ;