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-162124155800013.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 CANConstruction-PT-010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124155800013
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 33K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 193K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 97K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K May 12 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 12 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 12 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 12 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 4.0K May 11 18:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 11 18:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 11 15:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K May 11 15:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 12 04:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 12 04:39 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 554K 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 CANConstruction-PT-010-00
FORMULA_NAME CANConstruction-PT-010-01
FORMULA_NAME CANConstruction-PT-010-02
FORMULA_NAME CANConstruction-PT-010-03
FORMULA_NAME CANConstruction-PT-010-04
FORMULA_NAME CANConstruction-PT-010-05
FORMULA_NAME CANConstruction-PT-010-06
FORMULA_NAME CANConstruction-PT-010-07
FORMULA_NAME CANConstruction-PT-010-08
FORMULA_NAME CANConstruction-PT-010-09
FORMULA_NAME CANConstruction-PT-010-10
FORMULA_NAME CANConstruction-PT-010-11
FORMULA_NAME CANConstruction-PT-010-12
FORMULA_NAME CANConstruction-PT-010-13
FORMULA_NAME CANConstruction-PT-010-14
FORMULA_NAME CANConstruction-PT-010-15

=== Now, execution of the tool begins

BK_START 1621242850176

Running Version 0
[2021-05-17 09:14:11] [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 09:14:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 09:14:11] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2021-05-17 09:14:11] [INFO ] Transformed 322 places.
[2021-05-17 09:14:11] [INFO ] Transformed 480 transitions.
[2021-05-17 09:14:11] [INFO ] Parsed PT model containing 322 places and 480 transitions in 129 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 09:14:11] [INFO ] Initial state test concluded for 4 properties.
FORMULA CANConstruction-PT-010-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-010-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 322 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 322/322 places, 480/480 transitions.
Discarding 69 places :
Symmetric choice reduction at 0 with 69 rule applications. Total rules 69 place count 253 transition count 342
Iterating global reduction 0 with 69 rules applied. Total rules applied 138 place count 253 transition count 342
Applied a total of 138 rules in 58 ms. Remains 253 /322 variables (removed 69) and now considering 342/480 (removed 138) transitions.
// Phase 1: matrix 342 rows 253 cols
[2021-05-17 09:14:12] [INFO ] Computed 21 place invariants in 14 ms
[2021-05-17 09:14:12] [INFO ] Implicit Places using invariants in 262 ms returned [12, 26, 40, 68, 82, 96, 110, 124, 138]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 289 ms to find 9 implicit places.
// Phase 1: matrix 342 rows 244 cols
[2021-05-17 09:14:12] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-17 09:14:12] [INFO ] Dead Transitions using invariants and state equation in 191 ms returned []
Starting structural reductions, iteration 1 : 244/322 places, 342/480 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 235 transition count 333
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 235 transition count 333
Applied a total of 18 rules in 21 ms. Remains 235 /244 variables (removed 9) and now considering 333/342 (removed 9) transitions.
// Phase 1: matrix 333 rows 235 cols
[2021-05-17 09:14:12] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-17 09:14:12] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 333 rows 235 cols
[2021-05-17 09:14:12] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-17 09:14:12] [INFO ] State equation strengthened by 190 read => feed constraints.
[2021-05-17 09:14:13] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 235/322 places, 333/480 transitions.
[2021-05-17 09:14:13] [INFO ] Flatten gal took : 52 ms
[2021-05-17 09:14:13] [INFO ] Flatten gal took : 24 ms
[2021-05-17 09:14:13] [INFO ] Input system was already deterministic with 333 transitions.
Finished random walk after 1581 steps, including 9 resets, run visited all 29 properties in 16 ms. (steps per millisecond=98 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((F(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 235/235 places, 333/333 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 235 transition count 272
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 122 place count 174 transition count 272
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 122 place count 174 transition count 263
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 140 place count 165 transition count 263
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 151 place count 154 transition count 241
Iterating global reduction 2 with 11 rules applied. Total rules applied 162 place count 154 transition count 241
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 2 with 7 rules applied. Total rules applied 169 place count 154 transition count 234
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 176 place count 147 transition count 234
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 192 place count 139 transition count 226
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 212 place count 129 transition count 296
Applied a total of 212 rules in 64 ms. Remains 129 /235 variables (removed 106) and now considering 296/333 (removed 37) transitions.
// Phase 1: matrix 296 rows 129 cols
[2021-05-17 09:14:13] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-17 09:14:13] [INFO ] Implicit Places using invariants in 65 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
[2021-05-17 09:14:13] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 296 rows 128 cols
[2021-05-17 09:14:13] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:13] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Starting structural reductions, iteration 1 : 128/235 places, 296/333 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 126 transition count 294
Applied a total of 4 rules in 16 ms. Remains 126 /128 variables (removed 2) and now considering 294/296 (removed 2) transitions.
// Phase 1: matrix 294 rows 126 cols
[2021-05-17 09:14:13] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:13] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 294 rows 126 cols
[2021-05-17 09:14:13] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:13] [INFO ] State equation strengthened by 280 read => feed constraints.
[2021-05-17 09:14:14] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 126/235 places, 294/333 transitions.
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-010-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s20 1) (GEQ s28 1)) (AND (GEQ s17 1) (GEQ s34 1))), p1:(AND (GEQ s17 1) (GEQ s34 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 73 steps with 1 reset in 2 ms.
FORMULA CANConstruction-PT-010-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-01 finished in 870 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X((p1||(p2&&F(p1)&&G(p3))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 235/235 places, 333/333 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 226 transition count 315
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 226 transition count 315
Applied a total of 18 rules in 9 ms. Remains 226 /235 variables (removed 9) and now considering 315/333 (removed 18) transitions.
// Phase 1: matrix 315 rows 226 cols
[2021-05-17 09:14:14] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-17 09:14:14] [INFO ] Implicit Places using invariants in 88 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
// Phase 1: matrix 315 rows 225 cols
[2021-05-17 09:14:14] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:14] [INFO ] Dead Transitions using invariants and state equation in 115 ms returned []
Starting structural reductions, iteration 1 : 225/235 places, 315/333 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 224 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 224 transition count 314
Applied a total of 2 rules in 13 ms. Remains 224 /225 variables (removed 1) and now considering 314/315 (removed 1) transitions.
// Phase 1: matrix 314 rows 224 cols
[2021-05-17 09:14:14] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:14] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 314 rows 224 cols
[2021-05-17 09:14:14] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:14] [INFO ] State equation strengthened by 190 read => feed constraints.
[2021-05-17 09:14:15] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 224/235 places, 314/333 transitions.
Stuttering acceptance computed with spot in 253 ms :[(NOT p3), (OR (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-010-02 automaton TGBA [mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 5}], [{ cond=(AND p1 p3), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p3), acceptance={0} source=1 dest: 1}, { cond=(NOT p3), acceptance={0} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 6}, { cond=(NOT p0), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) p3), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) p3), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1) p3), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 6}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) p2 p3), acceptance={0} source=6 dest: 3}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={0} source=6 dest: 4}, { cond=(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), acceptance={0} source=6 dest: 6}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), acceptance={0} source=6 dest: 7}], [{ cond=(AND (NOT p1) p2 p3), acceptance={} source=7 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=7 dest: 5}]], initial=2, aps=[p3:(LT s190 1), p1:(LT s217 1), p0:(GEQ s100 1), p2:(OR (LT s114 1) (LT s213 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 371 ms.
Product exploration explored 100000 steps with 50000 reset in 329 ms.
Knowledge obtained : [p3, p1, (NOT p0), p2]
Stuttering acceptance computed with spot in 223 ms :[(NOT p3), (OR (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 269 ms.
Product exploration explored 100000 steps with 50000 reset in 302 ms.
Applying partial POR strategy [true, true, false, true, false, true, false, true]
Stuttering acceptance computed with spot in 221 ms :[(NOT p3), (OR (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Support contains 5 out of 224 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 224/224 places, 314/314 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 224 transition count 314
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 39 place count 224 transition count 314
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 49 place count 224 transition count 314
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 69 place count 204 transition count 294
Deduced a syphon composed of 29 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 89 place count 204 transition count 294
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 127 place count 204 transition count 294
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 174 place count 157 transition count 247
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 47 rules applied. Total rules applied 221 place count 157 transition count 247
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -88
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 231 place count 157 transition count 335
Deduced a syphon composed of 30 places in 0 ms
Applied a total of 231 rules in 48 ms. Remains 157 /224 variables (removed 67) and now considering 335/314 (removed -21) transitions.
[2021-05-17 09:14:17] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 335 rows 157 cols
[2021-05-17 09:14:17] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:17] [INFO ] Dead Transitions using invariants and state equation in 116 ms returned []
Finished structural reductions, in 1 iterations. Remains : 157/224 places, 335/314 transitions.
Product exploration explored 100000 steps with 50000 reset in 1144 ms.
Product exploration explored 100000 steps with 50000 reset in 1085 ms.
[2021-05-17 09:14:19] [INFO ] Flatten gal took : 17 ms
[2021-05-17 09:14:19] [INFO ] Flatten gal took : 17 ms
[2021-05-17 09:14:19] [INFO ] Time to serialize gal into /tmp/LTL807636197035040537.gal : 8 ms
[2021-05-17 09:14:19] [INFO ] Time to serialize properties into /tmp/LTL10156221205647652564.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/LTL807636197035040537.gal, -t, CGAL, -LTL, /tmp/LTL10156221205647652564.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/LTL807636197035040537.gal -t CGAL -LTL /tmp/LTL10156221205647652564.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((("(Node8ID>=1)")U(X(("(Node9GiveAnswer2<1)")||(((F("(Node9GiveAnswer2<1)"))&&(G("(Node6GiveAnswer3<1)")))&&("((Node9IsInserted<1)||(Node8requestsent9<1))"))))))
Formula 0 simplified : !("(Node8ID>=1)" U X("(Node9GiveAnswer2<1)" | ("((Node9IsInserted<1)||(Node8requestsent9<1))" & F"(Node9GiveAnswer2<1)" & G"(Node6GiveAnswer3<1)")))
Detected timeout of ITS tools.
[2021-05-17 09:14:35] [INFO ] Flatten gal took : 15 ms
[2021-05-17 09:14:35] [INFO ] Applying decomposition
[2021-05-17 09:14:35] [INFO ] Flatten gal took : 15 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/graph1391280187190619897.txt, -o, /tmp/graph1391280187190619897.bin, -w, /tmp/graph1391280187190619897.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/graph1391280187190619897.bin, -l, -1, -v, -w, /tmp/graph1391280187190619897.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 09:14:35] [INFO ] Decomposing Gal with order
[2021-05-17 09:14:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 09:14:35] [INFO ] Removed a total of 187 redundant transitions.
[2021-05-17 09:14:35] [INFO ] Flatten gal took : 58 ms
[2021-05-17 09:14:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 320 labels/synchronizations in 13 ms.
[2021-05-17 09:14:35] [INFO ] Time to serialize gal into /tmp/LTL93408198725092949.gal : 6 ms
[2021-05-17 09:14:35] [INFO ] Time to serialize properties into /tmp/LTL18425929127398300148.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/LTL93408198725092949.gal, -t, CGAL, -LTL, /tmp/LTL18425929127398300148.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/LTL93408198725092949.gal -t CGAL -LTL /tmp/LTL18425929127398300148.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((("(i8.u31.Node8ID>=1)")U(X(("(i2.u7.Node9GiveAnswer2<1)")||(((F("(i2.u7.Node9GiveAnswer2<1)"))&&(G("(i3.u11.Node6GiveAnswer3<1)")))&&("((i2.u7.Node9IsInserted<1)||(i8.u33.Node8requestsent9<1))"))))))
Formula 0 simplified : !("(i8.u31.Node8ID>=1)" U X("(i2.u7.Node9GiveAnswer2<1)" | ("((i2.u7.Node9IsInserted<1)||(i8.u33.Node8requestsent9<1))" & F"(i2.u7.Node9GiveAnswer2<1)" & G"(i3.u11.Node6GiveAnswer3<1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17993737480682878850
[2021-05-17 09:14:50] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17993737480682878850
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/ltsmin17993737480682878850]
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/ltsmin17993737480682878850] 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/ltsmin17993737480682878850] 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 CANConstruction-PT-010-02 finished in 37007 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((G(F(p1)) U p2)&&p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 235/235 places, 333/333 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 235 transition count 270
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 172 transition count 270
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 126 place count 172 transition count 261
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 144 place count 163 transition count 261
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 154 place count 153 transition count 241
Iterating global reduction 2 with 10 rules applied. Total rules applied 164 place count 153 transition count 241
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 6 rules applied. Total rules applied 170 place count 153 transition count 235
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 176 place count 147 transition count 235
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 196 place count 137 transition count 225
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -69
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 216 place count 127 transition count 294
Applied a total of 216 rules in 31 ms. Remains 127 /235 variables (removed 108) and now considering 294/333 (removed 39) transitions.
// Phase 1: matrix 294 rows 127 cols
[2021-05-17 09:14:51] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 09:14:51] [INFO ] Implicit Places using invariants in 74 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
[2021-05-17 09:14:51] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 294 rows 126 cols
[2021-05-17 09:14:51] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-17 09:14:51] [INFO ] Dead Transitions using invariants and state equation in 114 ms returned []
Starting structural reductions, iteration 1 : 126/235 places, 294/333 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 124 transition count 292
Applied a total of 4 rules in 14 ms. Remains 124 /126 variables (removed 2) and now considering 292/294 (removed 2) transitions.
// Phase 1: matrix 292 rows 124 cols
[2021-05-17 09:14:51] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:51] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 292 rows 124 cols
[2021-05-17 09:14:51] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-17 09:14:51] [INFO ] State equation strengthened by 279 read => feed constraints.
[2021-05-17 09:14:51] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 124/235 places, 292/333 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : CANConstruction-PT-010-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s28 1) (GEQ s103 1)), p2:(GEQ s106 1), p1:(AND (GEQ s28 1) (GEQ s103 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-010-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-03 finished in 740 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||(p0&&F(((F(p2)&&p1)||G(F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 235/235 places, 333/333 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 235 transition count 270
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 172 transition count 270
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 126 place count 172 transition count 261
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 144 place count 163 transition count 261
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 155 place count 152 transition count 239
Iterating global reduction 2 with 11 rules applied. Total rules applied 166 place count 152 transition count 239
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 2 with 7 rules applied. Total rules applied 173 place count 152 transition count 232
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 180 place count 145 transition count 232
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 196 place count 137 transition count 224
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 216 place count 127 transition count 294
Applied a total of 216 rules in 25 ms. Remains 127 /235 variables (removed 108) and now considering 294/333 (removed 39) transitions.
// Phase 1: matrix 294 rows 127 cols
[2021-05-17 09:14:52] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 09:14:52] [INFO ] Implicit Places using invariants in 62 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
[2021-05-17 09:14:52] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 294 rows 126 cols
[2021-05-17 09:14:52] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-17 09:14:52] [INFO ] Dead Transitions using invariants and state equation in 108 ms returned []
Starting structural reductions, iteration 1 : 126/235 places, 294/333 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 124 transition count 292
Applied a total of 4 rules in 11 ms. Remains 124 /126 variables (removed 2) and now considering 292/294 (removed 2) transitions.
// Phase 1: matrix 292 rows 124 cols
[2021-05-17 09:14:52] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:52] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 292 rows 124 cols
[2021-05-17 09:14:52] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:52] [INFO ] State equation strengthened by 280 read => feed constraints.
[2021-05-17 09:14:52] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 124/235 places, 292/333 transitions.
[2021-05-17 09:14:52] [INFO ] Initial state test concluded for 1 properties.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : CANConstruction-PT-010-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s10 1) (LT s44 1)), p1:(AND (GEQ s20 1) (GEQ s74 1)), p2:(OR (LT s20 1) (LT s74 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]]
Product exploration explored 100000 steps with 2146 reset in 338 ms.
Stack based approach found an accepted trace after 13304 steps with 287 reset with depth 55 and stack size 52 in 48 ms.
FORMULA CANConstruction-PT-010-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-04 finished in 1098 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 235/235 places, 333/333 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 235 transition count 273
Reduce places removed 60 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 121 place count 175 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 122 place count 174 transition count 272
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 122 place count 174 transition count 263
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 140 place count 165 transition count 263
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 149 place count 156 transition count 245
Iterating global reduction 3 with 9 rules applied. Total rules applied 158 place count 156 transition count 245
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 163 place count 156 transition count 240
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 168 place count 151 transition count 240
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 192 place count 139 transition count 228
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 212 place count 129 transition count 296
Applied a total of 212 rules in 26 ms. Remains 129 /235 variables (removed 106) and now considering 296/333 (removed 37) transitions.
// Phase 1: matrix 296 rows 129 cols
[2021-05-17 09:14:53] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-17 09:14:53] [INFO ] Implicit Places using invariants in 65 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
[2021-05-17 09:14:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 296 rows 128 cols
[2021-05-17 09:14:53] [INFO ] Computed 11 place invariants in 8 ms
[2021-05-17 09:14:53] [INFO ] Dead Transitions using invariants and state equation in 108 ms returned []
Starting structural reductions, iteration 1 : 128/235 places, 296/333 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 126 transition count 294
Applied a total of 4 rules in 9 ms. Remains 126 /128 variables (removed 2) and now considering 294/296 (removed 2) transitions.
// Phase 1: matrix 294 rows 126 cols
[2021-05-17 09:14:53] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:53] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 294 rows 126 cols
[2021-05-17 09:14:53] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:53] [INFO ] State equation strengthened by 278 read => feed constraints.
[2021-05-17 09:14:53] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 126/235 places, 294/333 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-010-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LT s66 1), p1:(AND (LT s86 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2013 reset in 270 ms.
Stack based approach found an accepted trace after 39 steps with 0 reset with depth 40 and stack size 39 in 0 ms.
FORMULA CANConstruction-PT-010-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-05 finished in 946 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 235/235 places, 333/333 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 224 transition count 311
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 224 transition count 311
Applied a total of 22 rules in 4 ms. Remains 224 /235 variables (removed 11) and now considering 311/333 (removed 22) transitions.
// Phase 1: matrix 311 rows 224 cols
[2021-05-17 09:14:54] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 09:14:54] [INFO ] Implicit Places using invariants in 75 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
// Phase 1: matrix 311 rows 223 cols
[2021-05-17 09:14:54] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:54] [INFO ] Dead Transitions using invariants and state equation in 173 ms returned []
Starting structural reductions, iteration 1 : 223/235 places, 311/333 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 222 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 310
Applied a total of 2 rules in 12 ms. Remains 222 /223 variables (removed 1) and now considering 310/311 (removed 1) transitions.
// Phase 1: matrix 310 rows 222 cols
[2021-05-17 09:14:54] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:54] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 310 rows 222 cols
[2021-05-17 09:14:54] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:54] [INFO ] State equation strengthened by 190 read => feed constraints.
[2021-05-17 09:14:54] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 222/235 places, 310/333 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : CANConstruction-PT-010-06 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s82 1), p1:(LT s94 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 266 steps with 1 reset in 1 ms.
FORMULA CANConstruction-PT-010-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-06 finished in 774 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||((p1 U G(p2))&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 235/235 places, 333/333 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 235 transition count 272
Reduce places removed 61 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 62 rules applied. Total rules applied 123 place count 174 transition count 271
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 124 place count 173 transition count 271
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 124 place count 173 transition count 261
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 144 place count 163 transition count 261
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 153 place count 154 transition count 243
Iterating global reduction 3 with 9 rules applied. Total rules applied 162 place count 154 transition count 243
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 167 place count 154 transition count 238
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 172 place count 149 transition count 238
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 194 place count 138 transition count 227
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -61
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 212 place count 129 transition count 288
Applied a total of 212 rules in 53 ms. Remains 129 /235 variables (removed 106) and now considering 288/333 (removed 45) transitions.
// Phase 1: matrix 288 rows 129 cols
[2021-05-17 09:14:54] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 09:14:55] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 288 rows 129 cols
[2021-05-17 09:14:55] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 09:14:55] [INFO ] State equation strengthened by 269 read => feed constraints.
[2021-05-17 09:14:55] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2021-05-17 09:14:55] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 288 rows 129 cols
[2021-05-17 09:14:55] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 09:14:55] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/235 places, 288/333 transitions.
Stuttering acceptance computed with spot in 112 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 : CANConstruction-PT-010-07 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={1} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p2), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s57 1), p2:(AND (GEQ s15 1) (GEQ s17 1)), p1:(GEQ s66 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1886 reset in 301 ms.
Stack based approach found an accepted trace after 796 steps with 14 reset with depth 53 and stack size 46 in 4 ms.
FORMULA CANConstruction-PT-010-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-07 finished in 1010 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 235/235 places, 333/333 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 235 transition count 272
Reduce places removed 61 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 62 rules applied. Total rules applied 123 place count 174 transition count 271
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 124 place count 173 transition count 271
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 124 place count 173 transition count 263
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 140 place count 165 transition count 263
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 150 place count 155 transition count 243
Iterating global reduction 3 with 10 rules applied. Total rules applied 160 place count 155 transition count 243
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 6 rules applied. Total rules applied 166 place count 155 transition count 237
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 172 place count 149 transition count 237
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 194 place count 138 transition count 226
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -69
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 214 place count 128 transition count 295
Applied a total of 214 rules in 20 ms. Remains 128 /235 variables (removed 107) and now considering 295/333 (removed 38) transitions.
// Phase 1: matrix 295 rows 128 cols
[2021-05-17 09:14:55] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 09:14:55] [INFO ] Implicit Places using invariants in 74 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
[2021-05-17 09:14:55] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 295 rows 127 cols
[2021-05-17 09:14:55] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-17 09:14:56] [INFO ] Dead Transitions using invariants and state equation in 112 ms returned []
Starting structural reductions, iteration 1 : 127/235 places, 295/333 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 125 transition count 293
Applied a total of 4 rules in 8 ms. Remains 125 /127 variables (removed 2) and now considering 293/295 (removed 2) transitions.
// Phase 1: matrix 293 rows 125 cols
[2021-05-17 09:14:56] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:56] [INFO ] Implicit Places using invariants in 135 ms returned []
// Phase 1: matrix 293 rows 125 cols
[2021-05-17 09:14:56] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:56] [INFO ] State equation strengthened by 279 read => feed constraints.
[2021-05-17 09:14:56] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 125/235 places, 293/333 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s26 1) (GEQ s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1145 steps with 55 reset in 3 ms.
FORMULA CANConstruction-PT-010-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-09 finished in 681 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 235/235 places, 333/333 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 225 transition count 313
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 225 transition count 313
Applied a total of 20 rules in 4 ms. Remains 225 /235 variables (removed 10) and now considering 313/333 (removed 20) transitions.
// Phase 1: matrix 313 rows 225 cols
[2021-05-17 09:14:56] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 09:14:56] [INFO ] Implicit Places using invariants in 72 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 ms to find 1 implicit places.
// Phase 1: matrix 313 rows 224 cols
[2021-05-17 09:14:56] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-17 09:14:56] [INFO ] Dead Transitions using invariants and state equation in 116 ms returned []
Starting structural reductions, iteration 1 : 224/235 places, 313/333 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 223 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 223 transition count 312
Applied a total of 2 rules in 4 ms. Remains 223 /224 variables (removed 1) and now considering 312/313 (removed 1) transitions.
// Phase 1: matrix 312 rows 223 cols
[2021-05-17 09:14:56] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:56] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 312 rows 223 cols
[2021-05-17 09:14:56] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:56] [INFO ] State equation strengthened by 190 read => feed constraints.
[2021-05-17 09:14:57] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 223/235 places, 312/333 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : CANConstruction-PT-010-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s213 1), p0:(GEQ s49 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-010-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-10 finished in 681 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 235/235 places, 333/333 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 225 transition count 313
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 225 transition count 313
Applied a total of 20 rules in 6 ms. Remains 225 /235 variables (removed 10) and now considering 313/333 (removed 20) transitions.
// Phase 1: matrix 313 rows 225 cols
[2021-05-17 09:14:57] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 09:14:57] [INFO ] Implicit Places using invariants in 72 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
// Phase 1: matrix 313 rows 224 cols
[2021-05-17 09:14:57] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:57] [INFO ] Dead Transitions using invariants and state equation in 114 ms returned []
Starting structural reductions, iteration 1 : 224/235 places, 313/333 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 223 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 223 transition count 312
Applied a total of 2 rules in 4 ms. Remains 223 /224 variables (removed 1) and now considering 312/313 (removed 1) transitions.
// Phase 1: matrix 312 rows 223 cols
[2021-05-17 09:14:57] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:57] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 312 rows 223 cols
[2021-05-17 09:14:57] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:57] [INFO ] State equation strengthened by 190 read => feed constraints.
[2021-05-17 09:14:57] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 223/235 places, 312/333 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GEQ s201 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]]
Stuttering criterion allowed to conclude after 238 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-010-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-11 finished in 746 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p1)||p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 235/235 places, 333/333 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 224 transition count 311
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 224 transition count 311
Applied a total of 22 rules in 4 ms. Remains 224 /235 variables (removed 11) and now considering 311/333 (removed 22) transitions.
// Phase 1: matrix 311 rows 224 cols
[2021-05-17 09:14:57] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 09:14:58] [INFO ] Implicit Places using invariants in 71 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
// Phase 1: matrix 311 rows 223 cols
[2021-05-17 09:14:58] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:58] [INFO ] Dead Transitions using invariants and state equation in 113 ms returned []
Starting structural reductions, iteration 1 : 223/235 places, 311/333 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 222 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 310
Applied a total of 2 rules in 4 ms. Remains 222 /223 variables (removed 1) and now considering 310/311 (removed 1) transitions.
// Phase 1: matrix 310 rows 222 cols
[2021-05-17 09:14:58] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:58] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 310 rows 222 cols
[2021-05-17 09:14:58] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:14:58] [INFO ] State equation strengthened by 190 read => feed constraints.
[2021-05-17 09:14:58] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 222/235 places, 310/333 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-010-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(LT s7 1), p0:(OR (LT s102 1) (LT s119 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 284 ms.
Product exploration explored 100000 steps with 50000 reset in 295 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 300 ms.
Product exploration explored 100000 steps with 50000 reset in 317 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 222 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 222/222 places, 310/310 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 222 transition count 310
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 39 place count 222 transition count 310
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 49 place count 222 transition count 310
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 67 place count 204 transition count 292
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 85 place count 204 transition count 292
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 122 place count 204 transition count 292
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 168 place count 158 transition count 246
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 214 place count 158 transition count 246
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -90
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 224 place count 158 transition count 336
Deduced a syphon composed of 32 places in 0 ms
Applied a total of 224 rules in 18 ms. Remains 158 /222 variables (removed 64) and now considering 336/310 (removed -26) transitions.
[2021-05-17 09:15:00] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 336 rows 158 cols
[2021-05-17 09:15:00] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-17 09:15:00] [INFO ] Dead Transitions using invariants and state equation in 111 ms returned []
Finished structural reductions, in 1 iterations. Remains : 158/222 places, 336/310 transitions.
Product exploration explored 100000 steps with 50000 reset in 1032 ms.
Product exploration explored 100000 steps with 50000 reset in 1043 ms.
[2021-05-17 09:15:02] [INFO ] Flatten gal took : 12 ms
[2021-05-17 09:15:02] [INFO ] Flatten gal took : 13 ms
[2021-05-17 09:15:02] [INFO ] Time to serialize gal into /tmp/LTL13543657062948440060.gal : 2 ms
[2021-05-17 09:15:02] [INFO ] Time to serialize properties into /tmp/LTL3075552765432318582.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/LTL13543657062948440060.gal, -t, CGAL, -LTL, /tmp/LTL3075552765432318582.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/LTL13543657062948440060.gal -t CGAL -LTL /tmp/LTL3075552765432318582.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((Node8IsInserted<1)||(Node9Request<1))")||(F("(Node0DHTinfo2<1)")))))
Formula 0 simplified : !X("((Node8IsInserted<1)||(Node9Request<1))" | F"(Node0DHTinfo2<1)")
Detected timeout of ITS tools.
[2021-05-17 09:15:17] [INFO ] Flatten gal took : 12 ms
[2021-05-17 09:15:17] [INFO ] Applying decomposition
[2021-05-17 09:15:17] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15791649575435812423.txt, -o, /tmp/graph15791649575435812423.bin, -w, /tmp/graph15791649575435812423.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/graph15791649575435812423.bin, -l, -1, -v, -w, /tmp/graph15791649575435812423.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 09:15:17] [INFO ] Decomposing Gal with order
[2021-05-17 09:15:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 09:15:17] [INFO ] Removed a total of 185 redundant transitions.
[2021-05-17 09:15:17] [INFO ] Flatten gal took : 30 ms
[2021-05-17 09:15:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 320 labels/synchronizations in 8 ms.
[2021-05-17 09:15:17] [INFO ] Time to serialize gal into /tmp/LTL8193008478223691191.gal : 3 ms
[2021-05-17 09:15:17] [INFO ] Time to serialize properties into /tmp/LTL12943467539751266552.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/LTL8193008478223691191.gal, -t, CGAL, -LTL, /tmp/LTL12943467539751266552.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/LTL8193008478223691191.gal -t CGAL -LTL /tmp/LTL12943467539751266552.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("((i7.u30.Node8IsInserted<1)||(i9.u37.Node9Request<1))")||(F("(i0.u3.Node0DHTinfo2<1)")))))
Formula 0 simplified : !X("((i7.u30.Node8IsInserted<1)||(i9.u37.Node9Request<1))" | F"(i0.u3.Node0DHTinfo2<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4528879842411781215
[2021-05-17 09:15:32] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4528879842411781215
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/ltsmin4528879842411781215]
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/ltsmin4528879842411781215] 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/ltsmin4528879842411781215] 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 CANConstruction-PT-010-12 finished in 35568 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 235/235 places, 333/333 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 224 transition count 311
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 224 transition count 311
Applied a total of 22 rules in 4 ms. Remains 224 /235 variables (removed 11) and now considering 311/333 (removed 22) transitions.
// Phase 1: matrix 311 rows 224 cols
[2021-05-17 09:15:33] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 09:15:33] [INFO ] Implicit Places using invariants in 83 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
// Phase 1: matrix 311 rows 223 cols
[2021-05-17 09:15:33] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:15:33] [INFO ] Dead Transitions using invariants and state equation in 130 ms returned []
Starting structural reductions, iteration 1 : 223/235 places, 311/333 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 222 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 310
Applied a total of 2 rules in 4 ms. Remains 222 /223 variables (removed 1) and now considering 310/311 (removed 1) transitions.
// Phase 1: matrix 310 rows 222 cols
[2021-05-17 09:15:33] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:15:33] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 310 rows 222 cols
[2021-05-17 09:15:33] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:15:33] [INFO ] State equation strengthened by 190 read => feed constraints.
[2021-05-17 09:15:34] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 222/235 places, 310/333 transitions.
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-13 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:(OR (LT s114 1) (LT s149 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 90 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-010-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-13 finished in 680 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||(X(F(p1))&&G(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 235/235 places, 333/333 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 224 transition count 311
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 224 transition count 311
Applied a total of 22 rules in 4 ms. Remains 224 /235 variables (removed 11) and now considering 311/333 (removed 22) transitions.
// Phase 1: matrix 311 rows 224 cols
[2021-05-17 09:15:34] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 09:15:34] [INFO ] Implicit Places using invariants in 80 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
// Phase 1: matrix 311 rows 223 cols
[2021-05-17 09:15:34] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:15:34] [INFO ] Dead Transitions using invariants and state equation in 135 ms returned []
Starting structural reductions, iteration 1 : 223/235 places, 311/333 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 222 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 310
Applied a total of 2 rules in 3 ms. Remains 222 /223 variables (removed 1) and now considering 310/311 (removed 1) transitions.
// Phase 1: matrix 310 rows 222 cols
[2021-05-17 09:15:34] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-17 09:15:34] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 310 rows 222 cols
[2021-05-17 09:15:34] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:15:34] [INFO ] State equation strengthened by 190 read => feed constraints.
[2021-05-17 09:15:34] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 222/235 places, 310/333 transitions.
Stuttering acceptance computed with spot in 74 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-010-14 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={1} source=0 dest: 2}, { cond=(AND p0 p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={1} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s66 1) (LT s145 1)), p2:(OR (LT s54 1) (LT s144 1)), p1:(OR (LT s35 1) (LT s54 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1196 reset in 192 ms.
Product exploration explored 100000 steps with 1287 reset in 200 ms.
Knowledge obtained : [p0, p2, p1]
Stuttering acceptance computed with spot in 75 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1285 reset in 193 ms.
Product exploration explored 100000 steps with 1234 reset in 201 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 82 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 222 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 222/222 places, 310/310 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 222 transition count 310
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 39 place count 222 transition count 310
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 50 place count 222 transition count 310
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 70 place count 202 transition count 290
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 90 place count 202 transition count 290
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 127 place count 202 transition count 290
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 173 place count 156 transition count 244
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 219 place count 156 transition count 244
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -90
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 229 place count 156 transition count 334
Deduced a syphon composed of 31 places in 0 ms
Applied a total of 229 rules in 15 ms. Remains 156 /222 variables (removed 66) and now considering 334/310 (removed -24) transitions.
[2021-05-17 09:15:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 334 rows 156 cols
[2021-05-17 09:15:36] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-17 09:15:36] [INFO ] Dead Transitions using invariants and state equation in 110 ms returned []
Finished structural reductions, in 1 iterations. Remains : 156/222 places, 334/310 transitions.
Product exploration explored 100000 steps with 1292 reset in 263 ms.
Stack based approach found an accepted trace after 5801 steps with 59 reset with depth 209 and stack size 194 in 13 ms.
FORMULA CANConstruction-PT-010-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-14 finished in 2229 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 235 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 235/235 places, 333/333 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 235 transition count 270
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 172 transition count 270
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 126 place count 172 transition count 261
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 144 place count 163 transition count 261
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 154 place count 153 transition count 241
Iterating global reduction 2 with 10 rules applied. Total rules applied 164 place count 153 transition count 241
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 6 rules applied. Total rules applied 170 place count 153 transition count 235
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 176 place count 147 transition count 235
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 198 place count 136 transition count 224
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -69
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 218 place count 126 transition count 293
Applied a total of 218 rules in 13 ms. Remains 126 /235 variables (removed 109) and now considering 293/333 (removed 40) transitions.
// Phase 1: matrix 293 rows 126 cols
[2021-05-17 09:15:36] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 09:15:36] [INFO ] Implicit Places using invariants in 71 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
[2021-05-17 09:15:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 293 rows 125 cols
[2021-05-17 09:15:36] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:15:36] [INFO ] Dead Transitions using invariants and state equation in 101 ms returned []
Starting structural reductions, iteration 1 : 125/235 places, 293/333 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 123 transition count 291
Applied a total of 4 rules in 6 ms. Remains 123 /125 variables (removed 2) and now considering 291/293 (removed 2) transitions.
// Phase 1: matrix 291 rows 123 cols
[2021-05-17 09:15:36] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:15:36] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 291 rows 123 cols
[2021-05-17 09:15:36] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 09:15:36] [INFO ] State equation strengthened by 279 read => feed constraints.
[2021-05-17 09:15:36] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 123/235 places, 291/333 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-010-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:(GEQ s98 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 50 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-010-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-010-15 finished in 611 ms.
Using solver Z3 to compute partial order matrices.
[2021-05-17 09:15:37] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin18408105994447547952
[2021-05-17 09:15:37] [INFO ] Computing symmetric may disable matrix : 333 transitions.
[2021-05-17 09:15:37] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 09:15:37] [INFO ] Computing symmetric may enable matrix : 333 transitions.
[2021-05-17 09:15:37] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 09:15:37] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11703146158975014692.txt, -o, /tmp/graph11703146158975014692.bin, -w, /tmp/graph11703146158975014692.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/graph11703146158975014692.bin, -l, -1, -v, -w, /tmp/graph11703146158975014692.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 09:15:37] [INFO ] Decomposing Gal with order
[2021-05-17 09:15:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 09:15:37] [INFO ] Computing Do-Not-Accords matrix : 333 transitions.
[2021-05-17 09:15:37] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 09:15:37] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18408105994447547952
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/ltsmin18408105994447547952]
[2021-05-17 09:15:37] [INFO ] Removed a total of 190 redundant transitions.
[2021-05-17 09:15:37] [INFO ] Flatten gal took : 29 ms
[2021-05-17 09:15:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 320 labels/synchronizations in 17 ms.
[2021-05-17 09:15:37] [INFO ] Time to serialize gal into /tmp/LTLFireability186831246320250863.gal : 3 ms
[2021-05-17 09:15:37] [INFO ] Time to serialize properties into /tmp/LTLFireability18231479478161116131.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/LTLFireability186831246320250863.gal, -t, CGAL, -LTL, /tmp/LTLFireability18231479478161116131.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/LTLFireability186831246320250863.gal -t CGAL -LTL /tmp/LTLFireability18231479478161116131.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((("(i8.u33.Node8ID>=1)")U(X(("(i2.i1.u12.Node9GiveAnswer2<1)")||(((!("((i8.u36.Node9IsInserted>=1)&&(i8.u36.Node8requestsent9>=1))"))&&(F("(i2.i1.u12.Node9GiveAnswer2<1)")))&&(G("(i10.u46.Node6GiveAnswer3<1)")))))))
Formula 0 simplified : !("(i8.u33.Node8ID>=1)" U X("(i2.i1.u12.Node9GiveAnswer2<1)" | (!"((i8.u36.Node9IsInserted>=1)&&(i8.u36.Node8requestsent9>=1))" & F"(i2.i1.u12.Node9GiveAnswer2<1)" & G"(i10.u46.Node6GiveAnswer3<1)")))
Compilation finished in 1522 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin18408105994447547952]
Link finished in 51 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)&&<>((LTLAPp1==true))&&[]((LTLAPp3==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin18408105994447547952]
LTSmin run took 577 ms.
FORMULA CANConstruction-PT-010-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>((LTLAPp5==true))||(LTLAPp4==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin18408105994447547952]
LTSmin run took 380 ms.
FORMULA CANConstruction-PT-010-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621242940619

--------------------
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="CANConstruction-PT-010"
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 CANConstruction-PT-010, 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-162124155800013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-010.tgz
mv CANConstruction-PT-010 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;